@inproceedings{BodlaenderDK01,
  title = {On Game-Theoretic Models of Networks},
  author = {Hans Leo Bodlaender and Michael J. Dinneen and Bakhadyr Khoussainov},
  year = {2001},
  url = {http://link.springer.de/link/service/series/0558/bibs/2223/22230550.htm},
  tags = { finite graphs, case study, meta-model, modeling, graph-rewriting, game networks, Meta-Environment, rewriting,  infinite games, process modeling, rewriting strategies},
  researchr = {https://researchr.org/publication/BodlaenderDK01},
  cites = {0},
  citedby = {0},
  pages = {550-561},
  booktitle = {isaac},
}

@article{BodlaenderJ00,
  title = {On the Complexity of the Maximum Cut Problem},
  author = {Hans Leo Bodlaender and Klaus Jansen},
  year = {2000},
  researchr = {https://researchr.org/publication/BodlaenderJ00},
  cites = {0},
  citedby = {0},
  journal = {njc},
  volume = {7},
  number = {1},
  pages = {14-31},
}

@inproceedings{RidderB99,
  title = {Graph Automorphisms with Maximal Projection Distances},
  author = {H. N. de Ridder and Hans Leo Bodlaender},
  year = {1999},
  url = {http://link.springer.de/link/service/series/0558/bibs/1684/16840204.htm},
  tags = {graph-rewriting, rewriting},
  researchr = {https://researchr.org/publication/RidderB99},
  cites = {0},
  citedby = {0},
  pages = {204-214},
  booktitle = {fct},
}

@inproceedings{BodlaenderMW89,
  title = {The Distributed Bit Complexity of the Ring: From the Anonymous to the Non-anonymous Case},
  author = {Hans Leo Bodlaender and Shlomo Moran and Manfred K. Warmuth},
  year = {1989},
  researchr = {https://researchr.org/publication/BodlaenderMW89},
  cites = {0},
  citedby = {0},
  pages = {58-67},
  booktitle = {fct},
}

@inproceedings{BodlaenderJ94,
  title = {On the Complexity of the Maximum Cut Problem},
  author = {Hans Leo Bodlaender and Klaus Jansen},
  year = {1994},
  researchr = {https://researchr.org/publication/BodlaenderJ94},
  cites = {0},
  citedby = {0},
  pages = {769-780},
  booktitle = {STACS},
}

@article{BodlaenderGK95,
  title = {Complexity Aspects of Two-Dimensional Data Compression},
  author = {Hans Leo Bodlaender and Teofilo F. Gonzalez and Ton Kloks},
  year = {1995},
  tags = {data-flow},
  researchr = {https://researchr.org/publication/BodlaenderGK95},
  cites = {0},
  citedby = {0},
  journal = {njc},
  volume = {2},
  number = {4},
  pages = {462-495},
}

@inproceedings{RooijB08,
  title = {Exact Algorithms for Edge Domination},
  author = {Johan M. M. van Rooij and Hans Leo Bodlaender},
  year = {2008},
  doi = {10.1007/978-3-540-79723-4_20},
  url = {http://dx.doi.org/10.1007/978-3-540-79723-4_20},
  researchr = {https://researchr.org/publication/RooijB08},
  cites = {0},
  citedby = {0},
  pages = {214-225},
  booktitle = {iwpec},
}

@article{BodlaenderTS94,
  title = {Trade-Offs in Non-Reversing Diameter},
  author = {Hans Leo Bodlaender and Gerard Tel and Nicola Santoro},
  year = {1994},
  researchr = {https://researchr.org/publication/BodlaenderTS94},
  cites = {0},
  citedby = {0},
  journal = {njc},
  volume = {1},
  number = {1},
  pages = {111-134},
}

@article{ThilikosSB05,
  title = {Cutwidth I: A linear time fixed parameter algorithm},
  author = {Dimitrios M. Thilikos and Maria J. Serna and Hans Leo Bodlaender},
  year = {2005},
  doi = {10.1016/j.jalgor.2004.12.001},
  url = {http://dx.doi.org/10.1016/j.jalgor.2004.12.001},
  researchr = {https://researchr.org/publication/ThilikosSB05},
  cites = {0},
  citedby = {0},
  journal = {jal},
  volume = {56},
  number = {1},
  pages = {1-24},
}

@inproceedings{BodlaenderK91,
  title = {Better Algorithms for the Pathwidth and Treewidth of Graphs},
  author = {Hans Leo Bodlaender and Ton Kloks},
  year = {1991},
  tags = {graph-rewriting, rewriting},
  researchr = {https://researchr.org/publication/BodlaenderK91},
  cites = {0},
  citedby = {0},
  pages = {544-555},
  booktitle = {icalp},
}

@inproceedings{Bodlaender07,
  title = {A Cubic Kernel for Feedback Vertex Set},
  author = {Hans Leo Bodlaender},
  year = {2007},
  doi = {10.1007/978-3-540-70918-3_28},
  url = {http://dx.doi.org/10.1007/978-3-540-70918-3_28},
  researchr = {https://researchr.org/publication/Bodlaender07},
  cites = {0},
  citedby = {0},
  pages = {320-331},
  booktitle = {STACS},
}

@article{ThilikosSB05a,
  title = {Cutwidth II: Algorithms for partial w-trees of bounded degree},
  author = {Dimitrios M. Thilikos and Maria J. Serna and Hans Leo Bodlaender},
  year = {2005},
  doi = {10.1016/j.jalgor.2004.12.003},
  url = {http://dx.doi.org/10.1016/j.jalgor.2004.12.003},
  researchr = {https://researchr.org/publication/ThilikosSB05a},
  cites = {0},
  citedby = {0},
  journal = {jal},
  volume = {56},
  number = {1},
  pages = {25-49},
}

@article{BodlaenderGHK95,
  title = {Approximating Treewidth, Pathwidth, Frontsize, and Shortest Elimination Tree},
  author = {Hans Leo Bodlaender and John R. Gilbert and Hjálmtyr Hafsteinsson and Ton Kloks},
  year = {1995},
  researchr = {https://researchr.org/publication/BodlaenderGHK95},
  cites = {0},
  citedby = {0},
  journal = {jal},
  volume = {18},
  number = {2},
  pages = {238-255},
}

@inproceedings{GaagBF04,
  title = {Monotonicity in Bayesian Networks},
  author = {Linda C. van der Gaag and Hans Leo Bodlaender and A. J. Feelders},
  year = {2004},
  url = {http://uai.sis.pitt.edu/displayArticleDetails.jsp?mmnu=1&smnu=2&article_id=1156&proceeding_id=20},
  tags = {C++},
  researchr = {https://researchr.org/publication/GaagBF04},
  cites = {0},
  citedby = {0},
  pages = {569-576},
  booktitle = {uai},
}

@inproceedings{BodlaenderBFPW02,
  title = {Radio Labeling with Pre-assigned Frequencies},
  author = {Hans Leo Bodlaender and Hajo Broersma and Fedor V. Fomin and Artem V. Pyatkin and Gerhard J. Woeginger},
  year = {2002},
  url = {http://link.springer.de/link/service/series/0558/bibs/2461/24610211.htm},
  researchr = {https://researchr.org/publication/BodlaenderBFPW02},
  cites = {0},
  citedby = {0},
  pages = {211-222},
  booktitle = {esa},
}

@article{BodlaenderKN99,
  title = {SIMPLE MAX-CUT for unit interval graphs and graphs with few P::4::s},
  author = {Hans Leo Bodlaender and Ton Kloks and Rolf Niedermeier},
  year = {1999},
  doi = {10.1016/S1571-0653(05)80014-9},
  url = {http://dx.doi.org/10.1016/S1571-0653(05)80014-9},
  tags = {graph-rewriting, rewriting},
  researchr = {https://researchr.org/publication/BodlaenderKN99},
  cites = {0},
  citedby = {0},
  journal = {endm},
  volume = {3},
  pages = {19-26},
}

@inproceedings{KatrielB05,
  title = {Online topological ordering},
  author = {Irit Katriel and Hans Leo Bodlaender},
  year = {2005},
  doi = {10.1145/1070432.1070493},
  url = {http://doi.acm.org/10.1145/1070432.1070493},
  researchr = {https://researchr.org/publication/KatrielB05},
  cites = {0},
  citedby = {0},
  pages = {443-450},
  booktitle = {soda},
}

@article{BodlaenderGKL90,
  title = {Computational complexity of norm-maximization},
  author = {Hans Leo Bodlaender and Peter Gritzmann and Victor Klee and Jan van Leeuwen},
  year = {1990},
  researchr = {https://researchr.org/publication/BodlaenderGKL90},
  cites = {0},
  citedby = {0},
  journal = {combinatorica},
  volume = {10},
  number = {2},
  pages = {203-225},
}

@inproceedings{BodlaenderGGH07,
  title = {The valve location problem},
  author = {Hans Leo Bodlaender and Alexander Grigoriev and Nadejda V. Grigorieva and Albert Hendriks},
  year = {2007},
  researchr = {https://researchr.org/publication/BodlaenderGGH07},
  cites = {0},
  citedby = {0},
  pages = {13-16},
  booktitle = {colognetwente},
}

@inproceedings{BodlaenderFT03,
  title = {Starting with Nondeterminism: The Systematic Derivation of Linear-Time Graph Layout Algorithms},
  author = {Hans Leo Bodlaender and Michael R. Fellows and Dimitrios M. Thilikos},
  year = {2003},
  url = {http://springerlink.metapress.com/openurl.asp?genre=article&issn=0302-9743&volume=2747&spage=239},
  tags = {layout, graph-rewriting, rewriting, systematic-approach},
  researchr = {https://researchr.org/publication/BodlaenderFT03},
  cites = {0},
  citedby = {0},
  pages = {239-248},
  booktitle = {mfcs},
}

@article{BodlaenderDJKKMT98,
  title = {Rankings of Graphs},
  author = {Hans Leo Bodlaender and Jitender S. Deogun and Klaus Jansen and Ton Kloks and Dieter Kratsch and Haiko Müller and Zsolt Tuza},
  year = {1998},
  url = {http://epubs.siam.org/sam-bin/dbq/article/28255},
  tags = {graph-rewriting, rewriting},
  researchr = {https://researchr.org/publication/BodlaenderDJKKMT98},
  cites = {0},
  citedby = {0},
  journal = {siamdm},
  volume = {11},
  number = {1},
  pages = {168-181},
}

@inproceedings{GrigorievB05,
  title = {Algorithms for Graphs Embeddable with Few Crossings Per Edge},
  author = {Alexander Grigoriev and Hans Leo Bodlaender},
  year = {2005},
  doi = {10.1007/11537311_33},
  url = {http://dx.doi.org/10.1007/11537311_33},
  tags = {graph-rewriting, rewriting},
  researchr = {https://researchr.org/publication/GrigorievB05},
  cites = {0},
  citedby = {0},
  pages = {378-387},
  booktitle = {fct},
}

@inproceedings{BodlaenderGT98,
  title = {Linear-Time Register Allocation for a Fixed Number of Registers},
  author = {Hans Leo Bodlaender and Jens Gustedt and Jan Arne Telle},
  year = {1998},
  researchr = {https://researchr.org/publication/BodlaenderGT98},
  cites = {0},
  citedby = {0},
  pages = {574-583},
  booktitle = {soda},
}

@inproceedings{AltBKRT07,
  title = {Wooden Geometric Puzzles: Design and Hardness Proofs},
  author = {Helmut Alt and Hans Leo Bodlaender and Marc J. van Kreveld and Günter Rote and Gerard Tel},
  year = {2007},
  doi = {10.1007/978-3-540-72914-3_4},
  url = {http://dx.doi.org/10.1007/978-3-540-72914-3_4},
  tags = {design},
  researchr = {https://researchr.org/publication/AltBKRT07},
  cites = {0},
  citedby = {0},
  pages = {16-29},
  booktitle = {fun},
}

@article{BodlaenderF01:0,
  title = {Parallel Algorithms for Series Parallel Graphs and Graphs with Treewidth Two},
  author = {Hans Leo Bodlaender and Babette van Antwerpen-de Fluiter},
  year = {2001},
  url = {http://link.springer.de/link/service/journals/00453/contents/00/10070/},
  tags = {graph-rewriting, rewriting},
  researchr = {https://researchr.org/publication/BodlaenderF01%3A0},
  cites = {0},
  citedby = {0},
  journal = {algorithmica},
  volume = {29},
  number = {4},
  pages = {534-559},
}

@article{ZantemaB02,
  title = {Sizes of Ordered Decision Trees},
  author = {Hans Zantema and Hans Leo Bodlaender},
  year = {2002},
  doi = {10.1142/S0129054102001205},
  url = {http://dx.doi.org/10.1142/S0129054102001205},
  researchr = {https://researchr.org/publication/ZantemaB02},
  cites = {0},
  citedby = {0},
  journal = {ijfcs},
  volume = {13},
  number = {3},
  pages = {445-458},
}

@inproceedings{Bodlaender93a,
  title = {Dynamic Algorithms for Graphs with Treewidth 2},
  author = {Hans Leo Bodlaender},
  year = {1993},
  tags = {graph-rewriting, rewriting},
  researchr = {https://researchr.org/publication/Bodlaender93a},
  cites = {0},
  citedby = {0},
  pages = {112-124},
  booktitle = {criwg},
}

@inproceedings{BodlaenderDFW94,
  title = {The Parameterized Complexity of Sequence Alignment and Consensus},
  author = {Hans Leo Bodlaender and Rodney G. Downey and Michael R. Fellows and Harold T. Wareham},
  year = {1994},
  researchr = {https://researchr.org/publication/BodlaenderDFW94},
  cites = {0},
  citedby = {0},
  pages = {15-30},
  booktitle = {cpm},
}

@inproceedings{Bodlaender07:0,
  title = {Treewidth: Structure and Algorithms},
  author = {Hans Leo Bodlaender},
  year = {2007},
  doi = {10.1007/978-3-540-72951-8_3},
  url = {http://dx.doi.org/10.1007/978-3-540-72951-8_3},
  researchr = {https://researchr.org/publication/Bodlaender07%3A0},
  cites = {0},
  citedby = {0},
  pages = {11-25},
  booktitle = {sirocco},
}

@article{Bodlaender94,
  title = {Improved Self-reduction Algorithms for Graphs with Bounded Treewidth},
  author = {Hans Leo Bodlaender},
  year = {1994},
  doi = {10.1016/0166-218X(94)90018-3},
  url = {http://dx.doi.org/10.1016/0166-218X(94)90018-3},
  tags = {graph-rewriting, rewriting},
  researchr = {https://researchr.org/publication/Bodlaender94},
  cites = {0},
  citedby = {0},
  journal = {DAM},
  volume = {54},
  number = {2-3},
  pages = {101-115},
}

@inproceedings{ThilikosSB01,
  title = {A Polynomial Time Algorithm for the Cutwidth of Bounded Degree Graphs with Small Treewidth},
  author = {Dimitrios M. Thilikos and Maria J. Serna and Hans Leo Bodlaender},
  year = {2001},
  url = {http://link.springer.de/link/service/series/0558/bibs/2161/21610380.htm},
  tags = {graph-rewriting, rewriting},
  researchr = {https://researchr.org/publication/ThilikosSB01},
  cites = {0},
  citedby = {0},
  pages = {380-390},
  booktitle = {esa},
}

@article{BodlaenderDFHW95,
  title = {Parameterized complexity analysis in computational biology},
  author = {Hans Leo Bodlaender and Rodney G. Downey and Michael R. Fellows and Michael T. Hallett and Harold T. Wareham},
  year = {1995},
  tags = {analysis},
  researchr = {https://researchr.org/publication/BodlaenderDFHW95},
  cites = {0},
  citedby = {0},
  journal = {bioinformatics},
  volume = {11},
  number = {1},
  pages = {49-57},
}

@article{KantB97,
  title = {Triangulating Planar Graphs while Minimizing the Maximum Degree},
  author = {Goos Kant and Hans Leo Bodlaender},
  year = {1997},
  tags = {planar graph, graph-rewriting, rewriting},
  researchr = {https://researchr.org/publication/KantB97},
  cites = {0},
  citedby = {0},
  journal = {iandc},
  volume = {135},
  number = {1},
  pages = {1-14},
}

@inproceedings{BodlaenderFGPSW06,
  title = {On the Minimum Corridor Connection Problem and Other Generalized Geometric Problems},
  author = {Hans Leo Bodlaender and Corinne Feremans and Alexander Grigoriev and Eelko Penninkx and René Sitters and Thomas Wolle},
  year = {2006},
  doi = {10.1007/11970125_6},
  url = {http://dx.doi.org/10.1007/11970125_6},
  researchr = {https://researchr.org/publication/BodlaenderFGPSW06},
  cites = {0},
  citedby = {0},
  pages = {69-82},
  booktitle = {waoa},
}

@inproceedings{BodlaenderFE96,
  title = {Finite-State Computability of Annotations of Strings and Trees},
  author = {Hans Leo Bodlaender and Michael R. Fellows and Patricia A. Evans},
  year = {1996},
  researchr = {https://researchr.org/publication/BodlaenderFE96},
  cites = {0},
  citedby = {0},
  pages = {384-391},
  booktitle = {cpm},
}

@inproceedings{BodlaenderF95,
  title = {Intervalizing k-Colored Graphs},
  author = {Hans Leo Bodlaender and Babette de Fluiter},
  year = {1995},
  tags = {graph-rewriting, rewriting},
  researchr = {https://researchr.org/publication/BodlaenderF95},
  cites = {0},
  citedby = {0},
  pages = {87-98},
  booktitle = {icalp},
}

@inproceedings{Bodlaender05,
  title = {Discovering Treewidth},
  author = {Hans Leo Bodlaender},
  year = {2005},
  url = {http://springerlink.metapress.com/openurl.asp?genre=article&issn=0302-9743&volume=3381&spage=1},
  researchr = {https://researchr.org/publication/Bodlaender05},
  cites = {0},
  citedby = {0},
  pages = {1-16},
  booktitle = {sofsem},
}

@article{Bodlaender91,
  title = {On the Complexity of Some Coloring Games},
  author = {Hans Leo Bodlaender},
  year = {1991},
  researchr = {https://researchr.org/publication/Bodlaender91},
  cites = {0},
  citedby = {0},
  journal = {ijfcs},
  volume = {2},
  number = {2},
  pages = {133-147},
}

@article{BodlaenderJ95,
  title = {Restrictions of Graph Partition Problems. Part I},
  author = {Hans Leo Bodlaender and Klaus Jansen},
  year = {1995},
  doi = {10.1016/0304-3975(95)00057-4},
  url = {http://dx.doi.org/10.1016/0304-3975(95)00057-4},
  tags = {graph-rewriting, rewriting, partitioning},
  researchr = {https://researchr.org/publication/BodlaenderJ95},
  cites = {0},
  citedby = {0},
  journal = {TCS},
  volume = {148},
  number = {1},
  pages = {93-109},
}

@inproceedings{BodlaenderF96:1,
  title = {Parallel Algorithms for Series Parallel Graphs},
  author = {Hans Leo Bodlaender and Babette de Fluiter},
  year = {1996},
  tags = {graph-rewriting, rewriting},
  researchr = {https://researchr.org/publication/BodlaenderF96%3A1},
  cites = {0},
  citedby = {0},
  pages = {277-289},
  booktitle = {esa},
}

@inproceedings{BodlaenderJ93,
  title = {On the Complexity of Scheduling Incompatible Jobs with Unit-Times},
  author = {Hans Leo Bodlaender and Klaus Jansen},
  year = {1993},
  researchr = {https://researchr.org/publication/BodlaenderJ93},
  cites = {0},
  citedby = {0},
  pages = {291-300},
  booktitle = {mfcs},
}

@article{Bodlaender00:0,
  title = {Introduction},
  author = {Hans Leo Bodlaender},
  year = {2000},
  url = {http://link.springer.de/link/service/journals/00453/contents/00/10015/},
  researchr = {https://researchr.org/publication/Bodlaender00%3A0},
  cites = {0},
  citedby = {0},
  journal = {algorithmica},
  volume = {27},
  number = {3},
  pages = {209-211},
}

@inproceedings{BodlaenderP08,
  title = {A Linear Kernel for Planar Feedback Vertex Set},
  author = {Hans Leo Bodlaender and Eelko Penninkx},
  year = {2008},
  doi = {10.1007/978-3-540-79723-4_16},
  url = {http://dx.doi.org/10.1007/978-3-540-79723-4_16},
  researchr = {https://researchr.org/publication/BodlaenderP08},
  cites = {0},
  citedby = {0},
  pages = {160-171},
  booktitle = {iwpec},
}

@inproceedings{Bodlaender88,
  title = {Dynamic Programming on Graphs with Bounded Treewidth},
  author = {Hans Leo Bodlaender},
  year = {1988},
  tags = {graph-rewriting, programming, rewriting},
  researchr = {https://researchr.org/publication/Bodlaender88},
  cites = {0},
  citedby = {0},
  pages = {105-118},
  booktitle = {icalp},
}

@inproceedings{BodlaenderFKKT06,
  title = {On Exact Algorithms for Treewidth},
  author = {Hans Leo Bodlaender and Fedor V. Fomin and Arie M. C. A. Koster and Dieter Kratsch and Dimitrios M. Thilikos},
  year = {2006},
  doi = {10.1007/11841036_60},
  url = {http://dx.doi.org/10.1007/11841036_60},
  tags = {C++},
  researchr = {https://researchr.org/publication/BodlaenderFKKT06},
  cites = {0},
  citedby = {0},
  pages = {672-683},
  booktitle = {esa},
}

@article{BodlaenderTY97,
  title = {It is Hard to Know when Greedy is Good for Finding Independent Sets},
  author = {Hans Leo Bodlaender and Dimitrios M. Thilikos and Koichi Yamazaki},
  year = {1997},
  doi = {10.1016/S0020-0190(96)00208-6},
  url = {http://dx.doi.org/10.1016/S0020-0190(96)00208-6},
  researchr = {https://researchr.org/publication/BodlaenderTY97},
  cites = {0},
  citedby = {0},
  journal = {ipl},
  volume = {61},
  number = {2},
  pages = {101-111},
}

@inproceedings{BodlaenderK04,
  title = {On the Maximum Cardinality Search Lower Bound for Treewidth},
  author = {Hans Leo Bodlaender and Arie M. C. A. Koster},
  year = {2004},
  url = {http://springerlink.metapress.com/openurl.asp?genre=article&issn=0302-9743&volume=3353&spage=81},
  tags = {C++, search},
  researchr = {https://researchr.org/publication/BodlaenderK04},
  cites = {0},
  citedby = {0},
  pages = {81-92},
  booktitle = {criwg},
}

@article{BodlaenderDFW95,
  title = {The Parameterized Complexity of Sequence Alignment and Consensus},
  author = {Hans Leo Bodlaender and Rodney G. Downey and Michael R. Fellows and Harold T. Wareham},
  year = {1995},
  doi = {10.1016/0304-3975(94)00251-D},
  url = {http://dx.doi.org/10.1016/0304-3975(94)00251-D},
  researchr = {https://researchr.org/publication/BodlaenderDFW95},
  cites = {0},
  citedby = {0},
  journal = {TCS},
  volume = {147},
  number = {1&2},
  pages = {31-54},
}

@inproceedings{BodlaenderTDL08,
  title = {Integer Maximum Flow in Wireless Sensor Networks with Energy Constraint},
  author = {Hans Leo Bodlaender and Richard B. Tan and Thomas C. van Dijk and Jan van Leeuwen},
  year = {2008},
  doi = {10.1007/978-3-540-69903-3_11},
  url = {http://dx.doi.org/10.1007/978-3-540-69903-3_11},
  tags = {wireless sensor networks, constraints, data-flow, C++},
  researchr = {https://researchr.org/publication/BodlaenderTDL08},
  cites = {0},
  citedby = {0},
  pages = {102-113},
  booktitle = {swat},
}

@article{BodlaenderT99,
  title = {Graphs with Branchwidth at Most Three},
  author = {Hans Leo Bodlaender and Dimitrios M. Thilikos},
  year = {1999},
  tags = {graph-rewriting, rewriting},
  researchr = {https://researchr.org/publication/BodlaenderT99},
  cites = {0},
  citedby = {0},
  journal = {jal},
  volume = {32},
  number = {2},
  pages = {167-194},
}

@article{Bodlaender93,
  title = {Complexity of Path-Forming Games},
  author = {Hans Leo Bodlaender},
  year = {1993},
  researchr = {https://researchr.org/publication/Bodlaender93},
  cites = {0},
  citedby = {0},
  journal = {TCS},
  volume = {110},
  number = {1},
  pages = {215-245},
}

@inproceedings{BodlaenderFLRRW07,
  title = {Quadratic Kernelization for Convex Recoloring of Trees},
  author = {Hans Leo Bodlaender and Michael R. Fellows and Michael A. Langston and Mark A. Ragan and Frances A. Rosamond and Mark Weyer},
  year = {2007},
  doi = {10.1007/978-3-540-73545-8_11},
  url = {http://dx.doi.org/10.1007/978-3-540-73545-8_11},
  researchr = {https://researchr.org/publication/BodlaenderFLRRW07},
  cites = {0},
  citedby = {0},
  pages = {86-96},
  booktitle = {cocoon},
}

@article{BodlaenderWK06,
  title = {Contraction and Treewidth Lower Bounds},
  author = {Hans Leo Bodlaender and Thomas Wolle and Arie M. C. A. Koster},
  year = {2006},
  url = {http://jgaa.info/accepted/2006/BodlaenderWolleKoster2006.10.1.pdf},
  tags = {C++},
  researchr = {https://researchr.org/publication/BodlaenderWK06},
  cites = {0},
  citedby = {0},
  journal = {jgaa},
  volume = {10},
  number = {1},
  pages = {5-49},
}

@inproceedings{BachooreB06,
  title = {A Branch and Bound Algorithm for Exact, Upper, and Lower Bounds on Treewidth},
  author = {Emgad H. Bachoore and Hans Leo Bodlaender},
  year = {2006},
  doi = {10.1007/11775096_24},
  url = {http://dx.doi.org/10.1007/11775096_24},
  researchr = {https://researchr.org/publication/BachooreB06},
  cites = {0},
  citedby = {0},
  pages = {255-266},
  booktitle = {AAIM},
}

@article{Bodlaender03,
  title = {Necessary Edges in k-Chordalisations of Graphs},
  author = {Hans Leo Bodlaender},
  year = {2003},
  doi = {10.1023/A:1027320705349},
  url = {http://dx.doi.org/10.1023/A:1027320705349},
  tags = {graph-rewriting, rewriting},
  researchr = {https://researchr.org/publication/Bodlaender03},
  cites = {0},
  citedby = {0},
  journal = {jco},
  volume = {7},
  number = {3},
  pages = {283-290},
}

@inproceedings{BodlaenderGK91,
  title = {Complexity Aspects of Map Compression},
  author = {Hans Leo Bodlaender and Teofilo F. Gonzalez and Ton Kloks},
  year = {1991},
  researchr = {https://researchr.org/publication/BodlaenderGK91},
  cites = {0},
  citedby = {0},
  pages = {287-296},
  booktitle = {dcc},
}

@article{BodlaenderH98,
  title = {Parallel Algorithms with Optimal Speedup for Bounded Treewidth},
  author = {Hans Leo Bodlaender and Torben Hagerup},
  year = {1998},
  url = {http://epubs.siam.org/sam-bin/dbq/article/28985},
  researchr = {https://researchr.org/publication/BodlaenderH98},
  cites = {0},
  citedby = {0},
  journal = {SICOMP},
  volume = {27},
  number = {6},
  pages = {1725-1746},
}

@article{BodlaenderT04,
  title = {A Note on Rectilinearity and Angular Resolution},
  author = {Hans Leo Bodlaender and Gerard Tel},
  year = {2004},
  url = {http://jgaa.info/accepted/2004/BodlaenderTel2004.8.1.pdf},
  researchr = {https://researchr.org/publication/BodlaenderT04},
  cites = {0},
  citedby = {0},
  journal = {jgaa},
  volume = {8},
  pages = {89-94},
}

@article{BodlaenderF05,
  title = {Equitable colorings of bounded treewidth graphs},
  author = {Hans Leo Bodlaender and Fedor V. Fomin},
  year = {2005},
  doi = {10.1016/j.tcs.2005.09.027},
  url = {http://dx.doi.org/10.1016/j.tcs.2005.09.027},
  tags = {graph-rewriting, rewriting},
  researchr = {https://researchr.org/publication/BodlaenderF05},
  cites = {0},
  citedby = {0},
  journal = {TCS},
  volume = {349},
  number = {1},
  pages = {22-30},
}

@article{KosterBH01,
  title = {Treewidth: Computational Experiments},
  author = {Arie M. C. A. Koster and Hans Leo Bodlaender and Stan P. M. van Hoesel},
  year = {2001},
  doi = {10.1016/S1571-0653(05)80078-2},
  url = {http://dx.doi.org/10.1016/S1571-0653(05)80078-2},
  tags = {C++},
  researchr = {https://researchr.org/publication/KosterBH01},
  cites = {0},
  citedby = {0},
  journal = {endm},
  volume = {8},
  pages = {54-57},
}

@inproceedings{Bodlaender88:2,
  title = {NC-Algorithms for Graphs with Small Treewidth},
  author = {Hans Leo Bodlaender},
  year = {1988},
  tags = {graph-rewriting, rewriting},
  researchr = {https://researchr.org/publication/Bodlaender88%3A2},
  cites = {0},
  citedby = {0},
  pages = {1-10},
  booktitle = {criwg},
}

@article{BodlaenderBKRS05,
  title = {On algorithms for (::::P::::::5::, gem)-free graphs},
  author = {Hans Leo Bodlaender and Andreas Brandstädt and Dieter Kratsch and Michaël Rao and Jeremy Spinrad},
  year = {2005},
  doi = {10.1016/j.tcs.2005.09.026},
  url = {http://dx.doi.org/10.1016/j.tcs.2005.09.026},
  tags = {graph-rewriting, rewriting},
  researchr = {https://researchr.org/publication/BodlaenderBKRS05},
  cites = {0},
  citedby = {0},
  journal = {TCS},
  volume = {349},
  number = {1},
  pages = {2-21},
}

@article{BodlaenderM93,
  title = {The Pathwidth and Treewidth of Cographs},
  author = {Hans Leo Bodlaender and Rolf H. Möhring},
  year = {1993},
  researchr = {https://researchr.org/publication/BodlaenderM93},
  cites = {0},
  citedby = {0},
  journal = {siamdm},
  volume = {6},
  number = {2},
  pages = {181-188},
}

@inproceedings{BodlaenderK04:0,
  title = {Safe Seperators for Treewidth},
  author = {Hans Leo Bodlaender and Arie M. C. A. Koster},
  year = {2004},
  tags = {C++},
  researchr = {https://researchr.org/publication/BodlaenderK04%3A0},
  cites = {0},
  citedby = {0},
  pages = {70-78},
  booktitle = {alenex},
}

@article{Bodlaender00,
  title = {The algorithmic theory of treewidth},
  author = {Hans Leo Bodlaender},
  year = {2000},
  doi = {10.1016/S1571-0653(05)80116-7},
  url = {http://dx.doi.org/10.1016/S1571-0653(05)80116-7},
  researchr = {https://researchr.org/publication/Bodlaender00},
  cites = {0},
  citedby = {0},
  journal = {endm},
  volume = {5},
  pages = {27-30},
}

@inproceedings{BodlaenderGKH91,
  title = {Approximating Treewidth, Pathwidth, and Minimum Elimination Tree Height},
  author = {Hans Leo Bodlaender and John R. Gilbert and Ton Kloks and Hjálmtyr Hafsteinsson},
  year = {1991},
  researchr = {https://researchr.org/publication/BodlaenderGKH91},
  cites = {0},
  citedby = {0},
  pages = {1-12},
  booktitle = {criwg},
}

@inproceedings{BodlaenderPT08,
  title = {A Linear Kernel for the k-Disjoint Cycle Problem on Planar Graphs},
  author = {Hans Leo Bodlaender and Eelko Penninkx and Richard B. Tan},
  year = {2008},
  doi = {10.1007/978-3-540-92182-0_29},
  url = {http://dx.doi.org/10.1007/978-3-540-92182-0_29},
  tags = {planar graph, graph-rewriting, rewriting},
  researchr = {https://researchr.org/publication/BodlaenderPT08},
  cites = {0},
  citedby = {0},
  pages = {306-317},
  booktitle = {isaac},
}

@article{BodlaenderFT09,
  title = {Derivation of algorithms for cutwidth and related graph layout parameters},
  author = {Hans Leo Bodlaender and Michael R. Fellows and Dimitrios M. Thilikos},
  year = {2009},
  doi = {10.1016/j.jcss.2008.10.003},
  url = {http://dx.doi.org/10.1016/j.jcss.2008.10.003},
  tags = {layout, graph-rewriting, rewriting},
  researchr = {https://researchr.org/publication/BodlaenderFT09},
  cites = {0},
  citedby = {0},
  journal = {jcss},
  volume = {75},
  number = {4},
  pages = {231-244},
}

@inproceedings{DornPBF05,
  title = {Efficient Exact Algorithms on Planar Graphs: Exploiting Sphere Cut Branch Decompositions},
  author = {Frederic Dorn and Eelko Penninkx and Hans Leo Bodlaender and Fedor V. Fomin},
  year = {2005},
  doi = {10.1007/11561071_11},
  url = {http://dx.doi.org/10.1007/11561071_11},
  tags = {planar graph, graph-rewriting, rewriting},
  researchr = {https://researchr.org/publication/DornPBF05},
  cites = {0},
  citedby = {0},
  pages = {95-106},
  booktitle = {esa},
}

@inproceedings{BodlaenderFW92,
  title = {Two Strikes Against Perfect Phylogeny},
  author = {Hans Leo Bodlaender and Michael R. Fellows and Tandy Warnow},
  year = {1992},
  researchr = {https://researchr.org/publication/BodlaenderFW92},
  cites = {0},
  citedby = {0},
  pages = {273-283},
  booktitle = {icalp},
}

@inproceedings{BodlaenderF02,
  title = {Tree Decompositions with Small Cost},
  author = {Hans Leo Bodlaender and Fedor V. Fomin},
  year = {2002},
  url = {http://link.springer.de/link/service/series/0558/bibs/2368/23680378.htm},
  researchr = {https://researchr.org/publication/BodlaenderF02},
  cites = {0},
  citedby = {0},
  pages = {378-387},
  booktitle = {swat},
}

@article{Bodlaender93:0,
  title = {A Tourist Guide through Treewidth},
  author = {Hans Leo Bodlaender},
  year = {1993},
  url = {http://www.inf.u-szeged.hu/kutatas/actacybernetica/vol11n12/bodlaen/bodlaen.xml},
  researchr = {https://researchr.org/publication/Bodlaender93%3A0},
  cites = {0},
  citedby = {0},
  journal = {actaC},
  volume = {11},
  number = {1-2},
  pages = {1-22},
}

@article{BodlaenderMW94,
  title = {The Distributed Bit Complexity of the Ring: From the Anonymous to the Non-anonymous Case},
  author = {Hans Leo Bodlaender and Shlomo Moran and Manfred K. Warmuth},
  year = {1994},
  month = {January},
  researchr = {https://researchr.org/publication/BodlaenderMW94},
  cites = {0},
  citedby = {0},
  journal = {iandc},
  volume = {108},
  number = {1},
  pages = {34-50},
}

@article{Bodlaender88:0,
  title = {A Better Lower Bound For Distributed Leader Finding in Bidirectional, Asynchronous Rings of Processors},
  author = {Hans Leo Bodlaender},
  year = {1988},
  researchr = {https://researchr.org/publication/Bodlaender88%3A0},
  cites = {0},
  citedby = {0},
  journal = {ipl},
  volume = {27},
  number = {6},
  pages = {287-290},
}

@article{BodlaenderDK02,
  title = {Relaxed Update and Partition Network Games},
  author = {Hans Leo Bodlaender and Michael J. Dinneen and Bakhadyr Khoussainov},
  year = {2002},
  tags = {case study, meta-model, relaxed update network games, graph-rewriting, Meta-Environment, rewriting, partitioning, process modeling, rewriting strategies},
  researchr = {https://researchr.org/publication/BodlaenderDK02},
  cites = {0},
  citedby = {0},
  journal = {FUIN},
  volume = {49},
  number = {4},
  pages = {301-312},
}

@article{BodlaenderKTL04,
  title = {Approximations for lambda-Colorings of Graphs},
  author = {Hans Leo Bodlaender and Ton Kloks and Richard B. Tan and Jan van Leeuwen},
  year = {2004},
  url = {http://www3.oup.co.uk/computer_journal/hdb/Volume_47/Issue_02/470193.sgm.abs.html},
  tags = {graph-rewriting, rewriting},
  researchr = {https://researchr.org/publication/BodlaenderKTL04},
  cites = {0},
  citedby = {0},
  journal = {cj},
  volume = {47},
  number = {2},
  pages = {193-204},
}

@article{BodlaenderK02,
  title = {Kayles and Nimbers},
  author = {Hans Leo Bodlaender and Dieter Kratsch},
  year = {2002},
  doi = {10.1006/jagm.2002.1215},
  url = {http://dx.doi.org/10.1006/jagm.2002.1215},
  researchr = {https://researchr.org/publication/BodlaenderK02},
  cites = {0},
  citedby = {0},
  journal = {jal},
  volume = {43},
  number = {1},
  pages = {106-119},
}

@article{Bodlaender89:1,
  title = {The Classification of Coverings of Processor Networks},
  author = {Hans Leo Bodlaender},
  year = {1989},
  tags = {classification},
  researchr = {https://researchr.org/publication/Bodlaender89%3A1},
  cites = {0},
  citedby = {0},
  journal = {jpdc},
  volume = {6},
  number = {1},
  pages = {166-182},
}

@inproceedings{BodlaenderF04,
  title = {Equitable Colorings of Bounded Treewidth Graphs},
  author = {Hans Leo Bodlaender and Fedor V. Fomin},
  year = {2004},
  url = {http://springerlink.metapress.com/openurl.asp?genre=article&issn=0302-9743&volume=3153&spage=180},
  tags = {graph-rewriting, rewriting},
  researchr = {https://researchr.org/publication/BodlaenderF04},
  cites = {0},
  citedby = {0},
  pages = {180-190},
  booktitle = {mfcs},
}

@article{Bodlaender99,
  title = {A note on domino treewidth},
  author = {Hans Leo Bodlaender},
  year = {1999},
  url = {http://dmtcs.loria.fr/volumes/abstracts/dm030401.abs.html},
  researchr = {https://researchr.org/publication/Bodlaender99},
  cites = {0},
  citedby = {0},
  journal = {dmtcs},
  volume = {3},
  number = {4},
  pages = {141-150},
}

@article{BodlaenderK92:0,
  title = {The Complexity of Coloring Games on Perfect Graphs},
  author = {Hans Leo Bodlaender and Dieter Kratsch},
  year = {1992},
  tags = {graph-rewriting, rewriting},
  researchr = {https://researchr.org/publication/BodlaenderK92%3A0},
  cites = {0},
  citedby = {0},
  journal = {TCS},
  volume = {106},
  number = {2},
  pages = {309-326},
}

@inproceedings{BodlaenderJW92,
  title = {Scheduling with Incompatible Jobs},
  author = {Hans Leo Bodlaender and Klaus Jansen and Gerhard J. Woeginger},
  year = {1992},
  researchr = {https://researchr.org/publication/BodlaenderJW92},
  cites = {0},
  citedby = {0},
  pages = {37-49},
  booktitle = {criwg},
}

@inproceedings{BodlaenderL85,
  title = {Simulation of Large Networks on Smaller Networks},
  author = {Hans Leo Bodlaender and Jan van Leeuwen},
  year = {1985},
  researchr = {https://researchr.org/publication/BodlaenderL85},
  cites = {0},
  citedby = {0},
  pages = {47-58},
  booktitle = {STACS},
}

@inproceedings{Bodlaender91:0,
  title = {On Disjoint Cycles},
  author = {Hans Leo Bodlaender},
  year = {1991},
  researchr = {https://researchr.org/publication/Bodlaender91%3A0},
  cites = {0},
  citedby = {0},
  pages = {230-238},
  booktitle = {criwg},
}

@inproceedings{BodlaenderFHMPR08,
  title = {Clustering with Partial Information},
  author = {Hans Leo Bodlaender and Michael R. Fellows and Pinar Heggernes and Federico Mancini and Charis Papadopoulos and Frances A. Rosamond},
  year = {2008},
  doi = {10.1007/978-3-540-85238-4_11},
  url = {http://dx.doi.org/10.1007/978-3-540-85238-4_11},
  researchr = {https://researchr.org/publication/BodlaenderFHMPR08},
  cites = {0},
  citedby = {0},
  pages = {144-155},
  booktitle = {mfcs},
}

@article{Bodlaender88a,
  title = {The Complexity of Finding Uniform Emulations on Fixed Graphs},
  author = {Hans Leo Bodlaender},
  year = {1988},
  tags = {graph-rewriting, rewriting},
  researchr = {https://researchr.org/publication/Bodlaender88a},
  cites = {0},
  citedby = {0},
  journal = {ipl},
  volume = {29},
  number = {3},
  pages = {137-141},
}

@article{abs-0802-2827,
  title = {Design by Measure and Conquer, A Faster Exact Algorithm for Dominating Set},
  author = {Johan M. M. van Rooij and Hans Leo Bodlaender},
  year = {2008},
  url = {http://arxiv.org/abs/0802.2827},
  tags = {design},
  researchr = {https://researchr.org/publication/abs-0802-2827},
  cites = {0},
  citedby = {0},
  journal = {corr},
  volume = {abs/0802.2827},
}

@article{BodlaenderF01,
  title = {Reduction Algorithms for Graphs of Small Treewidth},
  author = {Hans Leo Bodlaender and Babette van Antwerpen-de Fluiter},
  year = {2001},
  tags = {graph-rewriting, rewriting},
  researchr = {https://researchr.org/publication/BodlaenderF01},
  cites = {0},
  citedby = {0},
  journal = {iandc},
  volume = {167},
  number = {2},
  pages = {86-119},
}

@article{BodlaenderKK95,
  title = {Treewidth and Pathwidth of Permutation Graphs},
  author = {Hans Leo Bodlaender and Ton Kloks and Dieter Kratsch},
  year = {1995},
  url = {http://epubs.siam.org/sam-bin/dbq/article/23992},
  tags = {graph-rewriting, rewriting},
  researchr = {https://researchr.org/publication/BodlaenderKK95},
  cites = {0},
  citedby = {0},
  journal = {siamdm},
  volume = {8},
  number = {4},
  pages = {606-616},
}

@inproceedings{BodlaenderKK93,
  title = {Treewidth and Pathwidth of Permutation Graphs},
  author = {Hans Leo Bodlaender and Ton Kloks and Dieter Kratsch},
  year = {1993},
  tags = {graph-rewriting, rewriting},
  researchr = {https://researchr.org/publication/BodlaenderKK93},
  cites = {0},
  citedby = {0},
  pages = {114-125},
  booktitle = {icalp},
}

@inproceedings{BodlaenderGK05,
  title = {Treewidth Lower Bounds with Brambles},
  author = {Hans Leo Bodlaender and Alexander Grigoriev and Arie M. C. A. Koster},
  year = {2005},
  doi = {10.1007/11561071_36},
  url = {http://dx.doi.org/10.1007/11561071_36},
  tags = {C++},
  researchr = {https://researchr.org/publication/BodlaenderGK05},
  cites = {0},
  citedby = {0},
  pages = {391-402},
  booktitle = {esa},
}

@inproceedings{KantB91,
  title = {Planar Graph Augmentation Problems (Extended Abstract)},
  author = {Goos Kant and Hans Leo Bodlaender},
  year = {1991},
  tags = {planar graph, graph-rewriting, rewriting},
  researchr = {https://researchr.org/publication/KantB91},
  cites = {0},
  citedby = {0},
  pages = {286-298},
  booktitle = {wads},
}

@inproceedings{KwisthoutBT07,
  title = {Local Monotonicity in Probabilistic Networks},
  author = {Johan Kwisthout and Hans Leo Bodlaender and Gerard Tel},
  year = {2007},
  doi = {10.1007/978-3-540-75256-1_49},
  url = {http://dx.doi.org/10.1007/978-3-540-75256-1_49},
  researchr = {https://researchr.org/publication/KwisthoutBT07},
  cites = {0},
  citedby = {0},
  pages = {548-559},
  booktitle = {ecsqaru},
}

@article{AlberBFKN02,
  title = {Fixed Parameter Algorithms for DOMINATING SET and Related Problems on Planar Graphs},
  author = {Jochen Alber and Hans Leo Bodlaender and Henning Fernau and Ton Kloks and Rolf Niedermeier},
  year = {2002},
  url = {http://link.springer.de/link/service/journals/00453/contents/01/0116/index.html},
  tags = {planar graph, graph-rewriting, rewriting},
  researchr = {https://researchr.org/publication/AlberBFKN02},
  cites = {0},
  citedby = {0},
  journal = {algorithmica},
  volume = {33},
  number = {4},
  pages = {461-493},
}

@inproceedings{Bodlaender92,
  title = {Kayles on Special Classes of Graphs - An Application of Sprague-Grundy Theory},
  author = {Hans Leo Bodlaender},
  year = {1992},
  tags = {graph-rewriting, rewriting},
  researchr = {https://researchr.org/publication/Bodlaender92},
  cites = {0},
  citedby = {0},
  pages = {90-102},
  booktitle = {criwg},
}

@inproceedings{BodlaenderH98:0,
  title = {Tree Decompositions of Small Diameter},
  author = {Hans Leo Bodlaender and Torben Hagerup},
  year = {1998},
  url = {http://link.springer.de/link/service/series/0558/bibs/1450/14500702.htm},
  researchr = {https://researchr.org/publication/BodlaenderH98%3A0},
  cites = {0},
  citedby = {0},
  pages = {702-712},
  booktitle = {mfcs},
}

@inproceedings{KloksBMK93,
  title = {Computing Treewidth and Minimum Fill-In: All You Need are the Minimal Separators},
  author = {Ton Kloks and Hans Leo Bodlaender and Haiko Müller and Dieter Kratsch},
  year = {1993},
  researchr = {https://researchr.org/publication/KloksBMK93},
  cites = {0},
  citedby = {0},
  pages = {260-271},
  booktitle = {esa},
}

@inproceedings{Bodlaender89:0,
  title = {Improved Self-Reduction Algorithms for Graphs with Bounded Treewidth},
  author = {Hans Leo Bodlaender},
  year = {1989},
  tags = {graph-rewriting, rewriting},
  researchr = {https://researchr.org/publication/Bodlaender89%3A0},
  cites = {0},
  citedby = {0},
  pages = {232-244},
  booktitle = {criwg},
}

@inproceedings{YamazakiBFT97,
  title = {Isomorphism for Graphs of Bounded Distance Width},
  author = {Koichi Yamazaki and Hans Leo Bodlaender and Babette de Fluiter and Dimitrios M. Thilikos},
  year = {1997},
  tags = {graph-rewriting, rewriting},
  researchr = {https://researchr.org/publication/YamazakiBFT97},
  cites = {0},
  citedby = {0},
  pages = {276-287},
  booktitle = {ciac},
}

@inproceedings{Bodlaender97,
  title = {Treewidth: Algorithmoc Techniques and Results},
  author = {Hans Leo Bodlaender},
  year = {1997},
  researchr = {https://researchr.org/publication/Bodlaender97},
  cites = {0},
  citedby = {0},
  pages = {19-36},
  booktitle = {mfcs},
}

@inproceedings{BodlaenderDFH08,
  title = {On Problems without Polynomial Kernels (Extended Abstract)},
  author = {Hans Leo Bodlaender and Rodney G. Downey and Michael R. Fellows and Danny Hermelin},
  year = {2008},
  doi = {10.1007/978-3-540-70575-8_46},
  url = {http://dx.doi.org/10.1007/978-3-540-70575-8_46},
  researchr = {https://researchr.org/publication/BodlaenderDFH08},
  cites = {0},
  citedby = {0},
  pages = {563-574},
  booktitle = {icalp},
}

@inproceedings{BeameB89,
  title = {Distributed Computing on TRansitive Networks: The Thorus},
  author = {Paul Beame and Hans Leo Bodlaender},
  year = {1989},
  researchr = {https://researchr.org/publication/BeameB89},
  cites = {0},
  citedby = {0},
  pages = {294-303},
  booktitle = {STACS},
}

@article{BodlaenderF96,
  title = {On Intervalizing K-colored Graphs for DNA Physical Mapping},
  author = {Hans Leo Bodlaender and Babette van Antwerpen-de Fluiter},
  year = {1996},
  doi = {10.1016/S0166-218X(96)00057-1},
  url = {http://dx.doi.org/10.1016/S0166-218X(96)00057-1},
  tags = {graph-rewriting, rewriting},
  researchr = {https://researchr.org/publication/BodlaenderF96},
  cites = {0},
  citedby = {0},
  journal = {DAM},
  volume = {71},
  number = {1-3},
  pages = {55-77},
}

@article{KatrielB06,
  title = {Online topological ordering},
  author = {Irit Katriel and Hans Leo Bodlaender},
  year = {2006},
  doi = {10.1145/1159892.1159896},
  url = {http://doi.acm.org/10.1145/1159892.1159896},
  researchr = {https://researchr.org/publication/KatrielB06},
  cites = {0},
  citedby = {0},
  journal = {TALG},
  volume = {2},
  number = {3},
  pages = {364-379},
}

@article{BodlaenderK07,
  title = {On the maximum cardinality search lower bound for treewidth},
  author = {Hans Leo Bodlaender and Arie M. C. A. Koster},
  year = {2007},
  doi = {10.1016/j.dam.2007.02.004},
  url = {http://dx.doi.org/10.1016/j.dam.2007.02.004},
  tags = {C++, search},
  researchr = {https://researchr.org/publication/BodlaenderK07},
  cites = {0},
  citedby = {0},
  journal = {DAM},
  volume = {155},
  number = {11},
  pages = {1348-1372},
}

@article{BodlaenderL86:0,
  title = {Simulation of Large Networks on Smaller Networks},
  author = {Hans Leo Bodlaender and Jan van Leeuwen},
  year = {1986},
  month = {December},
  researchr = {https://researchr.org/publication/BodlaenderL86%3A0},
  cites = {0},
  citedby = {0},
  journal = {iandc},
  volume = {71},
  number = {3},
  pages = {143-180},
}

@article{ZantemaB00,
  title = {Finding Small Equivalent Decision Trees is Hard},
  author = {Hans Zantema and Hans Leo Bodlaender},
  year = {2000},
  researchr = {https://researchr.org/publication/ZantemaB00},
  cites = {0},
  citedby = {0},
  journal = {ijfcs},
  volume = {11},
  number = {2},
  pages = {343-354},
}

@article{BodlaenderT04:0,
  title = {Space-Efficient Construction Variants of Dynamic Programming},
  author = {Hans Leo Bodlaender and Jan Arne Telle},
  year = {2004},
  tags = {programming},
  researchr = {https://researchr.org/publication/BodlaenderT04%3A0},
  cites = {0},
  citedby = {0},
  journal = {njc},
  volume = {11},
  number = {4},
  pages = {374-385},
}

@inproceedings{Bodlaender88:1,
  title = {Polynomial Algorithms for Graph Isomorphism and Chromatic Index on Partial k-Trees},
  author = {Hans Leo Bodlaender},
  year = {1988},
  tags = {graph-rewriting, rewriting},
  researchr = {https://researchr.org/publication/Bodlaender88%3A1},
  cites = {0},
  citedby = {0},
  pages = {223-232},
  booktitle = {swat},
}

@inproceedings{BodlaenderGGH08,
  title = {The Valve Location Problem in Simple Network Topologies},
  author = {Hans Leo Bodlaender and Alexander Grigoriev and Nadejda V. Grigorieva and Albert Hendriks},
  year = {2008},
  doi = {10.1007/978-3-540-92248-3_6},
  url = {http://dx.doi.org/10.1007/978-3-540-92248-3_6},
  researchr = {https://researchr.org/publication/BodlaenderGGH08},
  cites = {0},
  citedby = {0},
  pages = {55-65},
  booktitle = {criwg},
}

@inproceedings{BachooreB05,
  title = {New Upper Bound Heuristics for Treewidth},
  author = {Emgad H. Bachoore and Hans Leo Bodlaender},
  year = {2005},
  doi = {10.1007/11427186_20},
  url = {http://dx.doi.org/10.1007/11427186_20},
  researchr = {https://researchr.org/publication/BachooreB05},
  cites = {0},
  citedby = {0},
  pages = {216-227},
  booktitle = {wea},
}

@inproceedings{BodlaenderM90,
  title = {The Pathwidth and Treewidth of Cographs},
  author = {Hans Leo Bodlaender and Rolf H. Möhring},
  year = {1990},
  researchr = {https://researchr.org/publication/BodlaenderM90},
  cites = {0},
  citedby = {0},
  pages = {301-309},
  booktitle = {swat},
}

@article{Bodlaender01,
  title = {A Generic NP-hardness Proof for a Variant of Graph Coloring},
  author = {Hans Leo Bodlaender},
  year = {2001},
  url = {http://www.jucs.org/jucs_7_12/a_generic_np_hardness},
  tags = {graph-rewriting, rewriting},
  researchr = {https://researchr.org/publication/Bodlaender01},
  cites = {0},
  citedby = {0},
  journal = {jucs},
  volume = {7},
  number = {12},
  pages = {1114-1124},
}

@inproceedings{BodlaenderBKRS03,
  title = {Linear Time Algorithms for Some NP-Complete Problems on (P::5::, Gem)-Free Graphs},
  author = {Hans Leo Bodlaender and Andreas Brandstädt and Dieter Kratsch and Michaël Rao and Jeremy Spinrad},
  year = {2003},
  url = {http://springerlink.metapress.com/openurl.asp?genre=article&issn=0302-9743&volume=2751&spage=61},
  tags = {completeness, graph-rewriting, rewriting},
  researchr = {https://researchr.org/publication/BodlaenderBKRS03},
  cites = {0},
  citedby = {0},
  pages = {61-72},
  booktitle = {fct},
}

@inproceedings{BodlaenderTTL95,
  title = {On Interval Routing Schemes and Treewidth},
  author = {Hans Leo Bodlaender and Richard B. Tan and Dimitrios M. Thilikos and Jan van Leeuwen},
  year = {1995},
  tags = {routing},
  researchr = {https://researchr.org/publication/BodlaenderTTL95},
  cites = {0},
  citedby = {0},
  pages = {181-196},
  booktitle = {criwg},
}

@inproceedings{BodlaenderDJKKMT94,
  title = {Ranking of Graphs},
  author = {Hans Leo Bodlaender and Jitender S. Deogun and Klaus Jansen and Ton Kloks and Dieter Kratsch and Haiko Müller and Zsolt Tuza},
  year = {1994},
  tags = {graph-rewriting, rewriting},
  researchr = {https://researchr.org/publication/BodlaenderDJKKMT94},
  cites = {0},
  citedby = {0},
  pages = {292-304},
  booktitle = {criwg},
}

@article{BodlaenderGK08,
  title = {Treewidth Lower Bounds with Brambles},
  author = {Hans Leo Bodlaender and Alexander Grigoriev and Arie M. C. A. Koster},
  year = {2008},
  doi = {10.1007/s00453-007-9056-z},
  url = {http://dx.doi.org/10.1007/s00453-007-9056-z},
  tags = {C++},
  researchr = {https://researchr.org/publication/BodlaenderGK08},
  cites = {0},
  citedby = {0},
  journal = {algorithmica},
  volume = {51},
  number = {1},
  pages = {81-98},
}

@inproceedings{Bodlaender90,
  title = {On the Complexity of Some Coloring Games},
  author = {Hans Leo Bodlaender},
  year = {1990},
  researchr = {https://researchr.org/publication/Bodlaender90},
  cites = {0},
  citedby = {0},
  pages = {30-40},
  booktitle = {criwg},
}

@inproceedings{BodlaenderFLRRW06,
  title = {Kernelization for Convex Recoloring},
  author = {Hans Leo Bodlaender and Michael R. Fellows and Michael A. Langston and Mark A. Ragan and Frances A. Rosamond and Mark Weyer},
  year = {2006},
  researchr = {https://researchr.org/publication/BodlaenderFLRRW06},
  cites = {0},
  citedby = {0},
  pages = {23-35},
  booktitle = {acid},
}

@inproceedings{BodlaenderE94,
  title = {Domino Treewith (Extended Abstract)},
  author = {Hans Leo Bodlaender and Joost Engelfriet},
  year = {1994},
  researchr = {https://researchr.org/publication/BodlaenderE94},
  cites = {0},
  citedby = {0},
  pages = {1-13},
  booktitle = {criwg},
}

@inproceedings{KosterWB05,
  title = {Degree-Based Treewidth Lower Bounds},
  author = {Arie M. C. A. Koster and Thomas Wolle and Hans Leo Bodlaender},
  year = {2005},
  doi = {10.1007/11427186_11},
  url = {http://dx.doi.org/10.1007/11427186_11},
  tags = {rule-based, C++},
  researchr = {https://researchr.org/publication/KosterWB05},
  cites = {0},
  citedby = {0},
  pages = {101-112},
  booktitle = {wea},
}

@article{ThilikosB97,
  title = {Fast Partitioning l-Apex Graphs with Application to Approximating Maximum Induced-Subgraph Problems},
  author = {Dimitrios M. Thilikos and Hans Leo Bodlaender},
  year = {1997},
  doi = {10.1016/S0020-0190(97)00024-0},
  url = {http://dx.doi.org/10.1016/S0020-0190(97)00024-0},
  tags = {graph-rewriting, rewriting, partitioning},
  researchr = {https://researchr.org/publication/ThilikosB97},
  cites = {0},
  citedby = {0},
  journal = {ipl},
  volume = {61},
  number = {5},
  pages = {227-232},
}

@inproceedings{KantB92,
  title = {Triangulating Planar Graphs While Minimizing the Maximum Degree},
  author = {Goos Kant and Hans Leo Bodlaender},
  year = {1992},
  tags = {planar graph, graph-rewriting, rewriting},
  researchr = {https://researchr.org/publication/KantB92},
  cites = {0},
  citedby = {0},
  pages = {258-271},
  booktitle = {swat},
}

@inproceedings{BodlaenderH95,
  title = {Parallel Algorithms with Optimal Speedup for Bounded Treewidth},
  author = {Hans Leo Bodlaender and Torben Hagerup},
  year = {1995},
  researchr = {https://researchr.org/publication/BodlaenderH95},
  cites = {0},
  citedby = {0},
  pages = {268-279},
  booktitle = {icalp},
}

@article{BodlaenderK96,
  title = {Efficient and Constructive Algorithms for the Pathwidth and Treewidth of Graphs},
  author = {Hans Leo Bodlaender and Ton Kloks},
  year = {1996},
  tags = {graph-rewriting, rewriting},
  researchr = {https://researchr.org/publication/BodlaenderK96},
  cites = {0},
  citedby = {0},
  journal = {jal},
  volume = {21},
  number = {2},
  pages = {358-402},
}

@inproceedings{FluiterB97,
  title = {Parallel Algorithms for Treewidth Two},
  author = {Babette de Fluiter and Hans Leo Bodlaender},
  year = {1997},
  researchr = {https://researchr.org/publication/FluiterB97},
  cites = {0},
  citedby = {0},
  pages = {157-170},
  booktitle = {criwg},
}

@inproceedings{SchooneBL86,
  title = {Improved Diameter Bounds for Altered Graphs},
  author = {Anneke A. Schoone and Hans Leo Bodlaender and Jan van Leeuwen},
  year = {1986},
  tags = {graph-rewriting, rewriting},
  researchr = {https://researchr.org/publication/SchooneBL86},
  cites = {0},
  citedby = {0},
  pages = {227-236},
  booktitle = {criwg},
}

@inproceedings{BodlaenderKTL00,
  title = {lambda-Coloring of Graphs},
  author = {Hans Leo Bodlaender and Ton Kloks and Richard B. Tan and Jan van Leeuwen},
  year = {2000},
  url = {http://link.springer.de/link/service/series/0558/bibs/1770/17700395.htm},
  tags = {graph-rewriting, rewriting},
  researchr = {https://researchr.org/publication/BodlaenderKTL00},
  cites = {0},
  citedby = {0},
  pages = {395-406},
  booktitle = {STACS},
}

@article{BodlaenderKKM98,
  title = {Treewidth and Minimum Fill-in on d-Trapezoid Graphs},
  author = {Hans Leo Bodlaender and Ton Kloks and Dieter Kratsch and Haiko Müller},
  year = {1998},
  url = {http://www.cs.brown.edu/publications/jgaa/accepted/98/Bodlaender+98.2.5.pdf},
  tags = {graph-rewriting, rewriting},
  researchr = {https://researchr.org/publication/BodlaenderKKM98},
  cites = {0},
  citedby = {0},
  journal = {jgaa},
  volume = {2},
  number = {2},
  pages = {1-23},
}

@inproceedings{BodlaenderHV08,
  title = {Faster Parameterized Algorithms for Minimum Fill-In},
  author = {Hans Leo Bodlaender and Pinar Heggernes and Yngve Villanger},
  year = {2008},
  doi = {10.1007/978-3-540-92182-0_27},
  url = {http://dx.doi.org/10.1007/978-3-540-92182-0_27},
  researchr = {https://researchr.org/publication/BodlaenderHV08},
  cites = {0},
  citedby = {0},
  pages = {282-293},
  booktitle = {isaac},
}

@article{Bodlaender90:0,
  title = {The Complexity of Finding Uniform Emulations on Paths and Ring Networks},
  author = {Hans Leo Bodlaender},
  year = {1990},
  month = {May},
  researchr = {https://researchr.org/publication/Bodlaender90%3A0},
  cites = {0},
  citedby = {0},
  journal = {iandc},
  volume = {86},
  number = {1},
  pages = {87-106},
}

@inproceedings{Bodlaender87,
  title = {New Lower Bounds for Distributed Leader Finding in Asynchronous Rings of Processors},
  author = {Hans Leo Bodlaender},
  year = {1987},
  researchr = {https://researchr.org/publication/Bodlaender87},
  cites = {0},
  citedby = {0},
  pages = {82-88},
  booktitle = {gi},
}

@article{YamazakiBFT99,
  title = {Isomorphism for Graphs of Bounded Distance Width},
  author = {Koichi Yamazaki and Hans Leo Bodlaender and Babette de Fluiter and Dimitrios M. Thilikos},
  year = {1999},
  url = {http://link.springer.de/link/service/journals/00453/bibs/24n2p105.html},
  tags = {graph-rewriting, rewriting},
  researchr = {https://researchr.org/publication/YamazakiBFT99},
  cites = {0},
  citedby = {0},
  journal = {algorithmica},
  volume = {24},
  number = {2},
  pages = {105-127},
}

@article{BodlaenderFHWW00,
  title = {The hardness of perfect phylogeny, feasible register assignment and other problems on thin colored graphs},
  author = {Hans Leo Bodlaender and Michael R. Fellows and Michael T. Hallett and Todd Wareham and Tandy Warnow},
  year = {2000},
  doi = {10.1016/S0304-3975(98)00342-9},
  url = {http://dx.doi.org/10.1016/S0304-3975(98)00342-9},
  tags = {graph-rewriting, rewriting},
  researchr = {https://researchr.org/publication/BodlaenderFHWW00},
  cites = {0},
  citedby = {0},
  journal = {TCS},
  volume = {244},
  number = {1-2},
  pages = {167-188},
}

@inproceedings{AlberBFN00,
  title = {Fixed Parameter Algorithms for PLANAR DOMINATING SET and Related Problems},
  author = {Jochen Alber and Hans Leo Bodlaender and Henning Fernau and Rolf Niedermeier},
  year = {2000},
  url = {http://link.springer.de/link/service/series/0558/bibs/1851/18510097.htm},
  researchr = {https://researchr.org/publication/AlberBFN00},
  cites = {0},
  citedby = {0},
  pages = {97-110},
  booktitle = {swat},
}

@article{BodlaenderLTT97,
  title = {On Interval Routing Schemes and Treewidth},
  author = {Hans Leo Bodlaender and Jan van Leeuwen and Richard B. Tan and Dimitrios M. Thilikos},
  year = {1997},
  tags = {routing},
  researchr = {https://researchr.org/publication/BodlaenderLTT97},
  cites = {0},
  citedby = {0},
  journal = {iandc},
  volume = {139},
  number = {1},
  pages = {92-109},
}

@article{BodlaenderJW94,
  title = {Scheduling with Incompatible Jobs},
  author = {Hans Leo Bodlaender and Klaus Jansen and Gerhard J. Woeginger},
  year = {1994},
  doi = {10.1016/0166-218X(94)90009-4},
  url = {http://dx.doi.org/10.1016/0166-218X(94)90009-4},
  researchr = {https://researchr.org/publication/BodlaenderJW94},
  cites = {0},
  citedby = {0},
  journal = {DAM},
  volume = {55},
  number = {3},
  pages = {219-232},
}

@inproceedings{BodlaenderR02,
  title = {Computing the Treewidth and the Minimum Fill-in with the Modular Decomposition},
  author = {Hans Leo Bodlaender and Udi Rotics},
  year = {2002},
  url = {http://link.springer.de/link/service/series/0558/bibs/2368/23680388.htm},
  researchr = {https://researchr.org/publication/BodlaenderR02},
  cites = {0},
  citedby = {0},
  pages = {388-397},
  booktitle = {swat},
}

@article{BodlaenderR03,
  title = {Computing the Treewidth and the Minimum Fill-In with the Modular Decomposition},
  author = {Hans Leo Bodlaender and Udi Rotics},
  year = {2003},
  doi = {10.1007/s00453-003-1026-5},
  url = {http://dx.doi.org/10.1007/s00453-003-1026-5},
  researchr = {https://researchr.org/publication/BodlaenderR03},
  cites = {0},
  citedby = {0},
  journal = {algorithmica},
  volume = {36},
  number = {4},
  pages = {375-408},
}

@inproceedings{KloksBMK94,
  title = {Erratum: Computing Treewidth and Minimum Fill-In: All You Need are the Minimal Separators},
  author = {Ton Kloks and Hans Leo Bodlaender and Haiko Müller and Dieter Kratsch},
  year = {1994},
  researchr = {https://researchr.org/publication/KloksBMK94},
  cites = {0},
  citedby = {0},
  pages = {508},
  booktitle = {esa},
}

@article{EijkhofBK07,
  title = {Safe Reduction Rules for Weighted Treewidth},
  author = {Frank van den Eijkhof and Hans Leo Bodlaender and Arie M. C. A. Koster},
  year = {2007},
  doi = {10.1007/s00453-006-1226-x},
  url = {http://dx.doi.org/10.1007/s00453-006-1226-x},
  tags = {rule-based, rules, C++},
  researchr = {https://researchr.org/publication/EijkhofBK07},
  cites = {0},
  citedby = {0},
  journal = {algorithmica},
  volume = {47},
  number = {2},
  pages = {139-158},
}

@inproceedings{BodlaenderT97,
  title = {Constructive Linear Time Algorithms for Branchwidth},
  author = {Hans Leo Bodlaender and Dimitrios M. Thilikos},
  year = {1997},
  researchr = {https://researchr.org/publication/BodlaenderT97},
  cites = {0},
  citedby = {0},
  pages = {627-637},
  booktitle = {icalp},
}

@inproceedings{BodlaenderK92,
  title = {A Simple Linear Time Algorithm for Triangulating Three-Colored Graphs},
  author = {Hans Leo Bodlaender and Ton Kloks},
  year = {1992},
  tags = {graph-rewriting, rewriting},
  researchr = {https://researchr.org/publication/BodlaenderK92},
  cites = {0},
  citedby = {0},
  pages = {415-423},
  booktitle = {STACS},
}

@article{GrigorievB07,
  title = {Algorithms for Graphs Embeddable with Few Crossings per Edge},
  author = {Alexander Grigoriev and Hans Leo Bodlaender},
  year = {2007},
  doi = {10.1007/s00453-007-0010-x},
  url = {http://dx.doi.org/10.1007/s00453-007-0010-x},
  tags = {graph-rewriting, rewriting},
  researchr = {https://researchr.org/publication/GrigorievB07},
  cites = {0},
  citedby = {0},
  journal = {algorithmica},
  volume = {49},
  number = {1},
  pages = {1-11},
}

@article{BodlaenderE97,
  title = {Domino Treewidth},
  author = {Hans Leo Bodlaender and Joost Engelfriet},
  year = {1997},
  researchr = {https://researchr.org/publication/BodlaenderE97},
  cites = {0},
  citedby = {0},
  journal = {jal},
  volume = {24},
  number = {1},
  pages = {94-123},
}

@inproceedings{HaverkortB99,
  title = {Finding a minimal tree in a polygon with its medial axis},
  author = {Herman J. Haverkort and Hans Leo Bodlaender},
  year = {1999},
  url = {http://www.cs.ubc.ca/conferences/CCCG/elec_proc/fp54.pdf},
  researchr = {https://researchr.org/publication/HaverkortB99},
  cites = {0},
  citedby = {0},
  booktitle = {cccg},
}

@inproceedings{BodlaenderKW04,
  title = {Contraction and Treewidth Lower Bounds},
  author = {Hans Leo Bodlaender and Arie M. C. A. Koster and Thomas Wolle},
  year = {2004},
  url = {http://springerlink.metapress.com/openurl.asp?genre=article&issn=0302-9743&volume=3221&spage=628},
  tags = {C++},
  researchr = {https://researchr.org/publication/BodlaenderKW04},
  cites = {0},
  citedby = {0},
  pages = {628-639},
  booktitle = {esa},
}

@inproceedings{BodlaenderKEG01,
  title = {Pre-processing for Triangulation of Probabilistic Networks},
  author = {Hans Leo Bodlaender and Arie M. C. A. Koster and Frank van den Eijkhof and Linda C. van der Gaag},
  year = {2001},
  url = {http://rome.exp.sis.pitt.edu/UAI/Abstract.asp?articleID=80&proceedingID=17},
  tags = {C++},
  researchr = {https://researchr.org/publication/BodlaenderKEG01},
  cites = {0},
  citedby = {0},
  pages = {32-39},
  booktitle = {uai},
}

@inproceedings{Bodlaender89,
  title = {On Linear Time Minor Tests and Depth First Search},
  author = {Hans Leo Bodlaender},
  year = {1989},
  tags = {testing, search},
  researchr = {https://researchr.org/publication/Bodlaender89},
  cites = {0},
  citedby = {0},
  pages = {577-590},
  booktitle = {wads},
}

@article{BodlaenderF05:0,
  title = {Tree decompositions with small cost},
  author = {Hans Leo Bodlaender and Fedor V. Fomin},
  year = {2005},
  doi = {10.1016/j.dam.2004.01.008},
  url = {http://dx.doi.org/10.1016/j.dam.2004.01.008},
  researchr = {https://researchr.org/publication/BodlaenderF05%3A0},
  cites = {0},
  citedby = {0},
  journal = {DAM},
  volume = {145},
  number = {2},
  pages = {143-154},
}

@inproceedings{BachooreB07,
  title = {Weighted Treewidth Algorithmic Techniques and Results},
  author = {Emgad H. Bachoore and Hans Leo Bodlaender},
  year = {2007},
  doi = {10.1007/978-3-540-77120-3_77},
  url = {http://dx.doi.org/10.1007/978-3-540-77120-3_77},
  researchr = {https://researchr.org/publication/BachooreB07},
  cites = {0},
  citedby = {0},
  pages = {893-903},
  booktitle = {isaac},
}

@inproceedings{BodlaenderFGKN04,
  title = {Simple Max-Cut for Split-Indifference Graphs and Graphs with Few P::4:: s},
  author = {Hans Leo Bodlaender and Celina M. Herrera de Figueiredo and Marisa Gutierrez and Ton Kloks and Rolf Niedermeier},
  year = {2004},
  url = {http://springerlink.metapress.com/openurl.asp?genre=article&issn=0302-9743&volume=3059&spage=87},
  tags = {graph-rewriting, rewriting},
  researchr = {https://researchr.org/publication/BodlaenderFGKN04},
  cites = {0},
  citedby = {0},
  pages = {87-99},
  booktitle = {wea},
}

@article{BodlaenderK93,
  title = {A Simple Linear Time Algorithm for Triangulating Three-Colored Graphs},
  author = {Hans Leo Bodlaender and Ton Kloks},
  year = {1993},
  tags = {graph-rewriting, rewriting},
  researchr = {https://researchr.org/publication/BodlaenderK93},
  cites = {0},
  citedby = {0},
  journal = {jal},
  volume = {15},
  number = {1},
  pages = {160-172},
}

@article{BodlaenderTL03,
  title = {Finding a bigtriangleup-regular supergraph of minimum order},
  author = {Hans Leo Bodlaender and Richard B. Tan and Jan van Leeuwen},
  year = {2003},
  doi = {10.1016/S0166-218X(02)00413-4},
  url = {http://dx.doi.org/10.1016/S0166-218X(02)00413-4},
  researchr = {https://researchr.org/publication/BodlaenderTL03},
  cites = {0},
  citedby = {0},
  journal = {DAM},
  volume = {131},
  number = {1},
  pages = {3-9},
}

@article{BodlaenderK08,
  title = {Combinatorial Optimization on Graphs of Bounded Treewidth},
  author = {Hans Leo Bodlaender and Arie M. C. A. Koster},
  year = {2008},
  doi = {10.1093/comjnl/bxm037},
  url = {http://dx.doi.org/10.1093/comjnl/bxm037},
  tags = {optimization, graph-rewriting, C++, rewriting},
  researchr = {https://researchr.org/publication/BodlaenderK08},
  cites = {0},
  citedby = {0},
  journal = {cj},
  volume = {51},
  number = {3},
  pages = {255-269},
}

@inproceedings{BodlaenderF96:0,
  title = {Reduction Algorithms for Constructing Solutions in Graphs with Small Treewidth},
  author = {Hans Leo Bodlaender and Babette de Fluiter},
  year = {1996},
  tags = {graph-rewriting, rewriting},
  researchr = {https://researchr.org/publication/BodlaenderF96%3A0},
  cites = {0},
  citedby = {0},
  pages = {199-208},
  booktitle = {cocoon},
}

@inproceedings{BodlaenderL86,
  title = {New Upperbounds for Decentralized Extrema-Finding in a Ring of Processors},
  author = {Hans Leo Bodlaender and Jan van Leeuwen},
  year = {1986},
  researchr = {https://researchr.org/publication/BodlaenderL86},
  cites = {0},
  citedby = {0},
  pages = {119-129},
  booktitle = {STACS},
}
@proceedings{iwpec:2006,
  title = {Parameterized and Exact Computation, Second International Workshop, IWPEC 2006, Zürich, Switzerland, September 13-15, 2006, Proceedings},
  year = {2006},
  researchr = {https://researchr.org/publication/iwpec%3A2006},
  cites = {0},
  citedby = {0},
  booktitle = {Parameterized and Exact Computation, Second International Workshop, IWPEC 2006, Zürich, Switzerland, September 13-15, 2006, Proceedings},
  conference = {iwpec},
  editor = {Hans Leo Bodlaender and Michael A. Langston},
  volume = {4169},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {3-540-39098-7},
}

@proceedings{wg:2003,
  title = {Graph-Theoretic Concepts in Computer Science, 29th International Workshop, WG 2003, Elspeet, The Netherlands, June 19-21, 2003, Revised Papers},
  year = {2003},
  tags = {graph-rewriting, e-science, rewriting},
  researchr = {https://researchr.org/publication/wg%3A2003},
  cites = {0},
  citedby = {0},
  booktitle = {Graph-Theoretic Concepts in Computer Science, 29th International Workshop, WG 2003, Elspeet, The Netherlands, June 19-21, 2003, Revised Papers},
  conference = {criwg},
  editor = {Hans Leo Bodlaender},
  volume = {2880},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {3-540-20452-0},
}