AAAAAA

   
Results: 1-23 |
Results: 23
RANKINGS OF GRAPHS
Authors: BODLAENDER HL DEOGUN JS JANSEN K KLOKS T KRATSCH D MULLER H TUZA Z
Citation: Hl. Bodlaender et al., RANKINGS OF GRAPHS, SIAM journal on discrete mathematics, 11(1), 1998, pp. 168-181
A PARTIAL K-ARBORETUM OF GRAPHS WITH BOUNDED TREEWIDTH
Authors: BODLAENDER HL
Citation: Hl. Bodlaender, A PARTIAL K-ARBORETUM OF GRAPHS WITH BOUNDED TREEWIDTH, Theoretical computer science, 209(1-2), 1998, pp. 1-45
PARALLEL ALGORITHMS WITH OPTIMAL SPEEDUP FOR BOUNDED TREEWIDTH
Authors: BODLAENDER HL HAGERUP T
Citation: Hl. Bodlaender et T. Hagerup, PARALLEL ALGORITHMS WITH OPTIMAL SPEEDUP FOR BOUNDED TREEWIDTH, SIAM journal on computing, 27(6), 1998, pp. 1725-1746
TREEWIDTH FOR GRAPHS WITH SMALL CHORDALITY
Authors: BODLAENDER HL THILIKOS DM
Citation: Hl. Bodlaender et Dm. Thilikos, TREEWIDTH FOR GRAPHS WITH SMALL CHORDALITY, Discrete applied mathematics, 79(1-3), 1997, pp. 45-61
ON INTERVAL ROUTING SCHEMES AND TREEWIDTH
Authors: BODLAENDER HL VANLEEUWEN J TAN R
Citation: Hl. Bodlaender et al., ON INTERVAL ROUTING SCHEMES AND TREEWIDTH, Information and computation, 139(1), 1997, pp. 92-109
TRIANGULATING PLANAR GRAPHS WHILE MINIMIZING THE MAXIMUM DEGREE
Authors: KANT G BODLAENDER HL
Citation: G. Kant et Hl. Bodlaender, TRIANGULATING PLANAR GRAPHS WHILE MINIMIZING THE MAXIMUM DEGREE, Information and computation, 135(1), 1997, pp. 1-14
DOMINO TREEWIDTH
Authors: BODLAENDER HL ENGELFRIET J
Citation: Hl. Bodlaender et J. Engelfriet, DOMINO TREEWIDTH, Journal of algorithms, 24(1), 1997, pp. 94-123
FAST PARTITIONING L-APEX GRAPHS WITH APPLICATIONS TO APPROXIMATING MAXIMUM INDUCED-SUBGRAPH PROBLEMS
Authors: THILIKOS DM BODLAENDER HL
Citation: Dm. Thilikos et Hl. Bodlaender, FAST PARTITIONING L-APEX GRAPHS WITH APPLICATIONS TO APPROXIMATING MAXIMUM INDUCED-SUBGRAPH PROBLEMS, Information processing letters, 61(5), 1997, pp. 227-232
IT IS HARD TO KNOW WHEN GREEDY IS GOOD FOR FINDING INDEPENDENT SETS
Authors: BODLAENDER HL THILIKOS DM YAMAZAKI K
Citation: Hl. Bodlaender et al., IT IS HARD TO KNOW WHEN GREEDY IS GOOD FOR FINDING INDEPENDENT SETS, Information processing letters, 61(2), 1997, pp. 101-106
ON INTERVALIZING K-COLORED GRAPHS FOR DNA PHYSICAL MAPPING
Authors: BODLAENDER HL DEFLUITER B
Citation: Hl. Bodlaender et B. Defluiter, ON INTERVALIZING K-COLORED GRAPHS FOR DNA PHYSICAL MAPPING, Discrete applied mathematics, 71(1-3), 1996, pp. 55-77
EFFICIENT AND CONSTRUCTIVE ALGORITHMS FOR THE PATHWIDTH AND TREEWIDTHOF GRAPHS
Authors: BODLAENDER HL KLOKS T
Citation: Hl. Bodlaender et T. Kloks, EFFICIENT AND CONSTRUCTIVE ALGORITHMS FOR THE PATHWIDTH AND TREEWIDTHOF GRAPHS, Journal of algorithms, 21(2), 1996, pp. 358-402
A LINEAR-TIME IE ALGORITHM FOR FINDING 3-DECOMPOSITIONS OF SMALL TREEWIDTH
Authors: BODLAENDER HL
Citation: Hl. Bodlaender, A LINEAR-TIME IE ALGORITHM FOR FINDING 3-DECOMPOSITIONS OF SMALL TREEWIDTH, SIAM journal on computing, 25(6), 1996, pp. 1305-1317
TREEWIDTH AND PATHWIDTH OF PERMUTATION GRAPHS
Authors: BODLAENDER HL KLOKS T KRATSCH D
Citation: Hl. Bodlaender et al., TREEWIDTH AND PATHWIDTH OF PERMUTATION GRAPHS, SIAM journal on discrete mathematics, 8(4), 1995, pp. 606-616
RESTRICTIONS OF GRAPH PARTITION PROBLEMS .1.
Authors: BODLAENDER HL JANSEN K
Citation: Hl. Bodlaender et K. Jansen, RESTRICTIONS OF GRAPH PARTITION PROBLEMS .1., Theoretical computer science, 148(1), 1995, pp. 93-109
THE PARAMETERIZED COMPLEXITY OF SEQUENCE ALIGNMENT AND CONSENSUS
Authors: BODLAENDER HL DOWNEY RG FELLOWS MR WAREHAM HT
Citation: Hl. Bodlaender et al., THE PARAMETERIZED COMPLEXITY OF SEQUENCE ALIGNMENT AND CONSENSUS, Theoretical computer science, 147(1-2), 1995, pp. 31-54
PARAMETERIZED COMPLEXITY ANALYSIS IN COMPUTATIONAL BIOLOGY
Authors: BODLAENDER HL DOWNEY RG FELLOWS MR HALLETT MT WAREHAM HT
Citation: Hl. Bodlaender et al., PARAMETERIZED COMPLEXITY ANALYSIS IN COMPUTATIONAL BIOLOGY, Computer applications in the biosciences, 11(1), 1995, pp. 49-57
APPROXIMATING TREEWIDTH, PATHWIDTH, FRONTSIZE, AND SHORTEST ELIMINATION TREE
Authors: BODLAENDER HL GILBERT JR HAFSTEINSSON H KLOKS T
Citation: Hl. Bodlaender et al., APPROXIMATING TREEWIDTH, PATHWIDTH, FRONTSIZE, AND SHORTEST ELIMINATION TREE, Journal of algorithms, 18(2), 1995, pp. 238-255
W[2]-HARDNESS OF PRECEDENCE CONSTRAINED K-PROCESSOR SCHEDULING
Authors: BODLAENDER HL FELLOWS MR
Citation: Hl. Bodlaender et Mr. Fellows, W[2]-HARDNESS OF PRECEDENCE CONSTRAINED K-PROCESSOR SCHEDULING, Operations research letters, 18(2), 1995, pp. 93-97
SCHEDULING WITH INCOMPATIBLE JOBS
Authors: BODLAENDER HL JANSEN K WOEGINGER GJ
Citation: Hl. Bodlaender et al., SCHEDULING WITH INCOMPATIBLE JOBS, Discrete applied mathematics, 55(3), 1994, pp. 219-232
IMPROVED SELF-REDUCTION ALGORITHMS FOR GRAPHS WITH BOUNDED TREEWIDTH
Authors: BODLAENDER HL
Citation: Hl. Bodlaender, IMPROVED SELF-REDUCTION ALGORITHMS FOR GRAPHS WITH BOUNDED TREEWIDTH, Discrete applied mathematics, 54(2-3), 1994, pp. 101-115
IMPROVED SELF-REDUCTION ALGORITHMS FOR GRAPHS WITH BOUNDED TREEWIDTH
Authors: BODLAENDER HL
Citation: Hl. Bodlaender, IMPROVED SELF-REDUCTION ALGORITHMS FOR GRAPHS WITH BOUNDED TREEWIDTH, Discrete applied mathematics, 54(2-3), 1994, pp. 101-115
THE DISTRIBUTED BIT COMPLEXITY OF THE RING - FROM THE ANONYMOUS TO THE NON-ANONYMOUS CASE
Authors: BODLAENDER HL MORAN S WARMUTH MK
Citation: Hl. Bodlaender et al., THE DISTRIBUTED BIT COMPLEXITY OF THE RING - FROM THE ANONYMOUS TO THE NON-ANONYMOUS CASE, Information and computation, 108(1), 1994, pp. 34-50
THE PATHWIDTH AND TREEWIDTH OF COGRAPHS
Authors: BODLAENDER HL MOHRING RH
Citation: Hl. Bodlaender et Rh. Mohring, THE PATHWIDTH AND TREEWIDTH OF COGRAPHS, SIAM journal on discrete mathematics, 6(2), 1993, pp. 181-188
Risultati: 1-23 |