default search action
Search dblp for Publications
export results for "toc:db/conf/wg/wg2003.bht:"
@inproceedings{DBLP:conf/wg/ArbibFM03, author = {Claudio Arbib and Michele Flammini and Fabrizio Marinelli}, editor = {Hans L. Bodlaender}, title = {Minimum Flow Time Graph Ordering}, booktitle = {Graph-Theoretic Concepts in Computer Science, 29th International Workshop, {WG} 2003, Elspeet, The Netherlands, June 19-21, 2003, Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {2880}, pages = {23--33}, publisher = {Springer}, year = {2003}, url = {https://doi.org/10.1007/978-3-540-39890-5\_3}, doi = {10.1007/978-3-540-39890-5\_3}, timestamp = {Tue, 14 May 2019 10:00:40 +0200}, biburl = {https://dblp.org/rec/conf/wg/ArbibFM03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/BarriereFST03, author = {Lali Barri{\`{e}}re and Pierre Fraigniaud and Nicola Santoro and Dimitrios M. Thilikos}, editor = {Hans L. Bodlaender}, title = {Searching Is Not Jumping}, booktitle = {Graph-Theoretic Concepts in Computer Science, 29th International Workshop, {WG} 2003, Elspeet, The Netherlands, June 19-21, 2003, Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {2880}, pages = {34--45}, publisher = {Springer}, year = {2003}, url = {https://doi.org/10.1007/978-3-540-39890-5\_4}, doi = {10.1007/978-3-540-39890-5\_4}, timestamp = {Tue, 07 May 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/BarriereFST03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/BeckerW03, author = {Simon M. Becker and Bernhard Westfechtel}, editor = {Hans L. Bodlaender}, title = {Incremental Integration Tools for Chemical Engineering: An Industrial Application of Triple Graph Grammars}, booktitle = {Graph-Theoretic Concepts in Computer Science, 29th International Workshop, {WG} 2003, Elspeet, The Netherlands, June 19-21, 2003, Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {2880}, pages = {46--57}, publisher = {Springer}, year = {2003}, url = {https://doi.org/10.1007/978-3-540-39890-5\_5}, doi = {10.1007/978-3-540-39890-5\_5}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/BeckerW03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/BerryHS03, author = {Anne Berry and Pinar Heggernes and Genevi{\`{e}}ve Simonet}, editor = {Hans L. Bodlaender}, title = {The Minimum Degree Heuristic and the Minimal Triangulation Process}, booktitle = {Graph-Theoretic Concepts in Computer Science, 29th International Workshop, {WG} 2003, Elspeet, The Netherlands, June 19-21, 2003, Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {2880}, pages = {58--70}, publisher = {Springer}, year = {2003}, url = {https://doi.org/10.1007/978-3-540-39890-5\_6}, doi = {10.1007/978-3-540-39890-5\_6}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/BerryHS03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/BerthomeDF03, author = {Pascal Berthom{\'{e}} and Madiagne Diallo and Afonso Ferreira}, editor = {Hans L. Bodlaender}, title = {Generalized Parametric Multi-terminal Flows Problem}, booktitle = {Graph-Theoretic Concepts in Computer Science, 29th International Workshop, {WG} 2003, Elspeet, The Netherlands, June 19-21, 2003, Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {2880}, pages = {71--80}, publisher = {Springer}, year = {2003}, url = {https://doi.org/10.1007/978-3-540-39890-5\_7}, doi = {10.1007/978-3-540-39890-5\_7}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/BerthomeDF03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/BonichonGH03, author = {Nicolas Bonichon and Cyril Gavoille and Nicolas Hanusse}, editor = {Hans L. Bodlaender}, title = {Canonical Decomposition of Outerplanar Maps and Application to Enumeration, Coding, and Generation}, booktitle = {Graph-Theoretic Concepts in Computer Science, 29th International Workshop, {WG} 2003, Elspeet, The Netherlands, June 19-21, 2003, Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {2880}, pages = {81--92}, publisher = {Springer}, year = {2003}, url = {https://doi.org/10.1007/978-3-540-39890-5\_8}, doi = {10.1007/978-3-540-39890-5\_8}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/BonichonGH03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/Bonsma03, author = {Paul S. Bonsma}, editor = {Hans L. Bodlaender}, title = {The Complexity of the Matching-Cut Problem for Planar Graphs and Other Graph Classes}, booktitle = {Graph-Theoretic Concepts in Computer Science, 29th International Workshop, {WG} 2003, Elspeet, The Netherlands, June 19-21, 2003, Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {2880}, pages = {93--105}, publisher = {Springer}, year = {2003}, url = {https://doi.org/10.1007/978-3-540-39890-5\_9}, doi = {10.1007/978-3-540-39890-5\_9}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/Bonsma03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/Brandenburg03, author = {Franz{-}Josef Brandenburg}, editor = {Hans L. Bodlaender}, title = {Erratum: Cycles in Generalized Networks}, booktitle = {Graph-Theoretic Concepts in Computer Science, 29th International Workshop, {WG} 2003, Elspeet, The Netherlands, June 19-21, 2003, Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {2880}, pages = {383}, publisher = {Springer}, year = {2003}, url = {https://doi.org/10.1007/978-3-540-39890-5\_33}, doi = {10.1007/978-3-540-39890-5\_33}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/Brandenburg03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/BrandstadtDLLU03, author = {Andreas Brandst{\"{a}}dt and Feodor F. Dragan and Ho{\`{a}}ng{-}Oanh Le and Van Bang Le and Ryuhei Uehara}, editor = {Hans L. Bodlaender}, title = {Tree Spanners for Bipartite Graphs and Probe Interval Graphs}, booktitle = {Graph-Theoretic Concepts in Computer Science, 29th International Workshop, {WG} 2003, Elspeet, The Netherlands, June 19-21, 2003, Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {2880}, pages = {106--118}, publisher = {Springer}, year = {2003}, url = {https://doi.org/10.1007/978-3-540-39890-5\_10}, doi = {10.1007/978-3-540-39890-5\_10}, timestamp = {Tue, 29 Dec 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/wg/BrandstadtDLLU03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/BretscherCHP03, author = {Anna Bretscher and Derek G. Corneil and Michel Habib and Christophe Paul}, editor = {Hans L. Bodlaender}, title = {A Simple Linear Time LexBFS Cograph Recognition Algorithm}, booktitle = {Graph-Theoretic Concepts in Computer Science, 29th International Workshop, {WG} 2003, Elspeet, The Netherlands, June 19-21, 2003, Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {2880}, pages = {119--130}, publisher = {Springer}, year = {2003}, url = {https://doi.org/10.1007/978-3-540-39890-5\_11}, doi = {10.1007/978-3-540-39890-5\_11}, timestamp = {Thu, 14 Oct 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/BretscherCHP03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/BroersmaFGW03, author = {Hajo Broersma and Fedor V. Fomin and Petr A. Golovach and Gerhard J. Woeginger}, editor = {Hans L. Bodlaender}, title = {Backbone Colorings for Networks}, booktitle = {Graph-Theoretic Concepts in Computer Science, 29th International Workshop, {WG} 2003, Elspeet, The Netherlands, June 19-21, 2003, Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {2880}, pages = {131--142}, publisher = {Springer}, year = {2003}, url = {https://doi.org/10.1007/978-3-540-39890-5\_12}, doi = {10.1007/978-3-540-39890-5\_12}, timestamp = {Sat, 05 Sep 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/BroersmaFGW03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/CarmiEO03, author = {Paz Carmi and Thomas Erlebach and Yoshio Okamoto}, editor = {Hans L. Bodlaender}, title = {Greedy Edge-Disjoint Paths in Complete Graphs}, booktitle = {Graph-Theoretic Concepts in Computer Science, 29th International Workshop, {WG} 2003, Elspeet, The Netherlands, June 19-21, 2003, Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {2880}, pages = {143--155}, publisher = {Springer}, year = {2003}, url = {https://doi.org/10.1007/978-3-540-39890-5\_13}, doi = {10.1007/978-3-540-39890-5\_13}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/CarmiEO03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/CollbergKCT03, author = {Christian S. Collberg and Stephen G. Kobourov and Edward Carter and Clark D. Thomborson}, editor = {Hans L. Bodlaender}, title = {Graph-Based Approaches to Software Watermarking}, booktitle = {Graph-Theoretic Concepts in Computer Science, 29th International Workshop, {WG} 2003, Elspeet, The Netherlands, June 19-21, 2003, Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {2880}, pages = {156--167}, publisher = {Springer}, year = {2003}, url = {https://doi.org/10.1007/978-3-540-39890-5\_14}, doi = {10.1007/978-3-540-39890-5\_14}, timestamp = {Mon, 05 Jun 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/CollbergKCT03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/CornelsenW03, author = {Sabine Cornelsen and Dorothea Wagner}, editor = {Hans L. Bodlaender}, title = {Completely Connected Clustered Graphs}, booktitle = {Graph-Theoretic Concepts in Computer Science, 29th International Workshop, {WG} 2003, Elspeet, The Netherlands, June 19-21, 2003, Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {2880}, pages = {168--179}, publisher = {Springer}, year = {2003}, url = {https://doi.org/10.1007/978-3-540-39890-5\_15}, doi = {10.1007/978-3-540-39890-5\_15}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/CornelsenW03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/DehneFR03, author = {Frank K. H. A. Dehne and Michael R. Fellows and Frances A. Rosamond}, editor = {Hans L. Bodlaender}, title = {An {FPT} Algorithm for Set Splitting}, booktitle = {Graph-Theoretic Concepts in Computer Science, 29th International Workshop, {WG} 2003, Elspeet, The Netherlands, June 19-21, 2003, Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {2880}, pages = {180--191}, publisher = {Springer}, year = {2003}, url = {https://doi.org/10.1007/978-3-540-39890-5\_16}, doi = {10.1007/978-3-540-39890-5\_16}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/DehneFR03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/DujmovicW03, author = {Vida Dujmovic and David R. Wood}, editor = {Hans L. Bodlaender}, title = {Tree-Partitions of k-Trees with Applications in Graph Layout}, booktitle = {Graph-Theoretic Concepts in Computer Science, 29th International Workshop, {WG} 2003, Elspeet, The Netherlands, June 19-21, 2003, Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {2880}, pages = {205--217}, publisher = {Springer}, year = {2003}, url = {https://doi.org/10.1007/978-3-540-39890-5\_18}, doi = {10.1007/978-3-540-39890-5\_18}, timestamp = {Sun, 02 Jun 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/DujmovicW03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/ErlebachPPS03, author = {Thomas Erlebach and Aris Pagourtzis and Katerina Potika and Stamatis Stefanakos}, editor = {Hans L. Bodlaender}, title = {Resource Allocation Problems in Multifiber {WDM} Tree Networks}, booktitle = {Graph-Theoretic Concepts in Computer Science, 29th International Workshop, {WG} 2003, Elspeet, The Netherlands, June 19-21, 2003, Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {2880}, pages = {218--229}, publisher = {Springer}, year = {2003}, url = {https://doi.org/10.1007/978-3-540-39890-5\_19}, doi = {10.1007/978-3-540-39890-5\_19}, timestamp = {Fri, 04 Jun 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/ErlebachPPS03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/FariaFSV03, author = {Lu{\'{e}}rbio Faria and Celina M. H. de Figueiredo and Ondrej S{\'{y}}kora and Imrich Vrto}, editor = {Hans L. Bodlaender}, title = {An Improved Upper Bound on the Crossing Number of the Hypercube}, booktitle = {Graph-Theoretic Concepts in Computer Science, 29th International Workshop, {WG} 2003, Elspeet, The Netherlands, June 19-21, 2003, Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {2880}, pages = {230--236}, publisher = {Springer}, year = {2003}, url = {https://doi.org/10.1007/978-3-540-39890-5\_20}, doi = {10.1007/978-3-540-39890-5\_20}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/FariaFSV03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/Fellows03, author = {Michael R. Fellows}, editor = {Hans L. Bodlaender}, title = {Blow-Ups, Win/Win's, and Crown Rules: Some New Directions in {FPT}}, booktitle = {Graph-Theoretic Concepts in Computer Science, 29th International Workshop, {WG} 2003, Elspeet, The Netherlands, June 19-21, 2003, Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {2880}, pages = {1--12}, publisher = {Springer}, year = {2003}, url = {https://doi.org/10.1007/978-3-540-39890-5\_1}, doi = {10.1007/978-3-540-39890-5\_1}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/Fellows03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/GiacomoDLW03, author = {Emilio Di Giacomo and Walter Didimo and Giuseppe Liotta and Stephen K. Wismath}, editor = {Hans L. Bodlaender}, title = {Drawing Planar Graphs on a Curve}, booktitle = {Graph-Theoretic Concepts in Computer Science, 29th International Workshop, {WG} 2003, Elspeet, The Netherlands, June 19-21, 2003, Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {2880}, pages = {192--204}, publisher = {Springer}, year = {2003}, url = {https://doi.org/10.1007/978-3-540-39890-5\_17}, doi = {10.1007/978-3-540-39890-5\_17}, timestamp = {Mon, 05 Jun 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/GiacomoDLW03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/GliksonM03, author = {Alexander Glikson and Johann A. Makowsky}, editor = {Hans L. Bodlaender}, title = {{NCE} Graph Grammars and Clique-Width}, booktitle = {Graph-Theoretic Concepts in Computer Science, 29th International Workshop, {WG} 2003, Elspeet, The Netherlands, June 19-21, 2003, Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {2880}, pages = {237--248}, publisher = {Springer}, year = {2003}, url = {https://doi.org/10.1007/978-3-540-39890-5\_21}, doi = {10.1007/978-3-540-39890-5\_21}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/GliksonM03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/GolumbicL03, author = {Martin Charles Golumbic and Marina Lipshteyn}, editor = {Hans L. Bodlaender}, title = {Chordal Probe Graphs}, booktitle = {Graph-Theoretic Concepts in Computer Science, 29th International Workshop, {WG} 2003, Elspeet, The Netherlands, June 19-21, 2003, Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {2880}, pages = {249--260}, publisher = {Springer}, year = {2003}, url = {https://doi.org/10.1007/978-3-540-39890-5\_22}, doi = {10.1007/978-3-540-39890-5\_22}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/GolumbicL03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/GutwengerJLMPW03, author = {Carsten Gutwenger and Michael J{\"{u}}nger and Sebastian Leipert and Petra Mutzel and Merijam Percan and Ren{\'{e}} Weiskircher}, editor = {Hans L. Bodlaender}, title = {Subgraph Induced Planar Connectivity Augmentation: (Extended Abstract)}, booktitle = {Graph-Theoretic Concepts in Computer Science, 29th International Workshop, {WG} 2003, Elspeet, The Netherlands, June 19-21, 2003, Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {2880}, pages = {261--272}, publisher = {Springer}, year = {2003}, url = {https://doi.org/10.1007/978-3-540-39890-5\_23}, doi = {10.1007/978-3-540-39890-5\_23}, timestamp = {Tue, 29 Dec 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/wg/GutwengerJLMPW03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/KloksLLM03, author = {Ton Kloks and Chuan{-}Min Lee and Jiping Liu and Haiko M{\"{u}}ller}, editor = {Hans L. Bodlaender}, title = {On the Recognition of General Partition Graphs}, booktitle = {Graph-Theoretic Concepts in Computer Science, 29th International Workshop, {WG} 2003, Elspeet, The Netherlands, June 19-21, 2003, Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {2880}, pages = {273--283}, publisher = {Springer}, year = {2003}, url = {https://doi.org/10.1007/978-3-540-39890-5\_24}, doi = {10.1007/978-3-540-39890-5\_24}, timestamp = {Sun, 12 Nov 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/wg/KloksLLM03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/Kowalik03, author = {Lukasz Kowalik}, editor = {Hans L. Bodlaender}, title = {Short Cycles in Planar Graphs}, booktitle = {Graph-Theoretic Concepts in Computer Science, 29th International Workshop, {WG} 2003, Elspeet, The Netherlands, June 19-21, 2003, Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {2880}, pages = {284--296}, publisher = {Springer}, year = {2003}, url = {https://doi.org/10.1007/978-3-540-39890-5\_25}, doi = {10.1007/978-3-540-39890-5\_25}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/Kowalik03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/Kratochvil03, author = {Jan Kratochv{\'{\i}}l}, editor = {Hans L. Bodlaender}, title = {Complexity of Hypergraph Coloring and Seidel's Switching}, booktitle = {Graph-Theoretic Concepts in Computer Science, 29th International Workshop, {WG} 2003, Elspeet, The Netherlands, June 19-21, 2003, Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {2880}, pages = {297--308}, publisher = {Springer}, year = {2003}, url = {https://doi.org/10.1007/978-3-540-39890-5\_26}, doi = {10.1007/978-3-540-39890-5\_26}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/Kratochvil03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/KratschMT03, author = {Dieter Kratsch and Haiko M{\"{u}}ller and Ioan Todinca}, editor = {Hans L. Bodlaender}, title = {Feedback Vertex Set and Longest Induced Path on AT-Free Graphs}, booktitle = {Graph-Theoretic Concepts in Computer Science, 29th International Workshop, {WG} 2003, Elspeet, The Netherlands, June 19-21, 2003, Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {2880}, pages = {309--321}, publisher = {Springer}, year = {2003}, url = {https://doi.org/10.1007/978-3-540-39890-5\_27}, doi = {10.1007/978-3-540-39890-5\_27}, timestamp = {Sun, 12 Nov 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/wg/KratschMT03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/LevinPW03, author = {Asaf Levin and Dani{\"{e}}l Paulusma and Gerhard J. Woeginger}, editor = {Hans L. Bodlaender}, title = {The Complexity of Graph Contractions}, booktitle = {Graph-Theoretic Concepts in Computer Science, 29th International Workshop, {WG} 2003, Elspeet, The Netherlands, June 19-21, 2003, Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {2880}, pages = {322--333}, publisher = {Springer}, year = {2003}, url = {https://doi.org/10.1007/978-3-540-39890-5\_28}, doi = {10.1007/978-3-540-39890-5\_28}, timestamp = {Sun, 02 Oct 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/LevinPW03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/ManuelRRA03, author = {Paul D. Manuel and Bharati Rajan and Indra Rajasingh and Amutha Alaguvel}, editor = {Hans L. Bodlaender}, title = {Tree Spanners, Cayley Graphs, and Diametrically Uniform Graphs}, booktitle = {Graph-Theoretic Concepts in Computer Science, 29th International Workshop, {WG} 2003, Elspeet, The Netherlands, June 19-21, 2003, Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {2880}, pages = {334--345}, publisher = {Springer}, year = {2003}, url = {https://doi.org/10.1007/978-3-540-39890-5\_29}, doi = {10.1007/978-3-540-39890-5\_29}, timestamp = {Mon, 26 Jun 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/ManuelRRA03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/MuratP03, author = {C{\'{e}}cile Murat and Vangelis Th. Paschos}, editor = {Hans L. Bodlaender}, title = {The Probabilistic Minimum Coloring Problem}, booktitle = {Graph-Theoretic Concepts in Computer Science, 29th International Workshop, {WG} 2003, Elspeet, The Netherlands, June 19-21, 2003, Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {2880}, pages = {346--357}, publisher = {Springer}, year = {2003}, url = {https://doi.org/10.1007/978-3-540-39890-5\_30}, doi = {10.1007/978-3-540-39890-5\_30}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/MuratP03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/NikolopoulosP03, author = {Stavros D. Nikolopoulos and Leonidas Palios}, editor = {Hans L. Bodlaender}, title = {Recognizing Bipolarizable and {P} 4-Simplicial Graphs}, booktitle = {Graph-Theoretic Concepts in Computer Science, 29th International Workshop, {WG} 2003, Elspeet, The Netherlands, June 19-21, 2003, Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {2880}, pages = {358--369}, publisher = {Springer}, year = {2003}, url = {https://doi.org/10.1007/978-3-540-39890-5\_31}, doi = {10.1007/978-3-540-39890-5\_31}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/NikolopoulosP03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/Schrijver03, author = {Alexander Schrijver}, editor = {Hans L. Bodlaender}, title = {Matching, Edge-Colouring, and Dimers}, booktitle = {Graph-Theoretic Concepts in Computer Science, 29th International Workshop, {WG} 2003, Elspeet, The Netherlands, June 19-21, 2003, Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {2880}, pages = {13--22}, publisher = {Springer}, year = {2003}, url = {https://doi.org/10.1007/978-3-540-39890-5\_2}, doi = {10.1007/978-3-540-39890-5\_2}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/Schrijver03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/Todinca03, author = {Ioan Todinca}, editor = {Hans L. Bodlaender}, title = {Coloring Powers of Graphs of Bounded Clique-Width}, booktitle = {Graph-Theoretic Concepts in Computer Science, 29th International Workshop, {WG} 2003, Elspeet, The Netherlands, June 19-21, 2003, Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {2880}, pages = {370--382}, publisher = {Springer}, year = {2003}, url = {https://doi.org/10.1007/978-3-540-39890-5\_32}, doi = {10.1007/978-3-540-39890-5\_32}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/Todinca03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@proceedings{DBLP:conf/wg/2003, editor = {Hans L. Bodlaender}, title = {Graph-Theoretic Concepts in Computer Science, 29th International Workshop, {WG} 2003, Elspeet, The Netherlands, June 19-21, 2003, Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {2880}, publisher = {Springer}, year = {2003}, url = {https://doi.org/10.1007/b93953}, doi = {10.1007/B93953}, isbn = {3-540-20452-0}, timestamp = {Tue, 14 May 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/2003.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.