default search action
Search dblp for Publications
export results for "stream:conf/wg:"
more than 1000 matches, exporting first 1000 hits only!
@inproceedings{DBLP:conf/wg/AradS23, author = {Ilan Doron{-}Arad and Hadas Shachnai}, editor = {Dani{\"{e}}l Paulusma and Bernard Ries}, title = {Approximating Bin Packing with Conflict Graphs via Maximization Techniques}, booktitle = {Graph-Theoretic Concepts in Computer Science - 49th International Workshop, {WG} 2023, Fribourg, Switzerland, June 28-30, 2023, Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {14093}, pages = {261--275}, publisher = {Springer}, year = {2023}, url = {https://doi.org/10.1007/978-3-031-43380-1\_19}, doi = {10.1007/978-3-031-43380-1\_19}, timestamp = {Tue, 27 Aug 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/AradS23.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/BandyapadhyayFIS23, author = {Sayan Bandyapadhyay and Fedor V. Fomin and Tanmay Inamdar and Kirill Simonov}, editor = {Dani{\"{e}}l Paulusma and Bernard Ries}, title = {Proportionally Fair Matching with Multiple Groups}, booktitle = {Graph-Theoretic Concepts in Computer Science - 49th International Workshop, {WG} 2023, Fribourg, Switzerland, June 28-30, 2023, Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {14093}, pages = {1--15}, publisher = {Springer}, year = {2023}, url = {https://doi.org/10.1007/978-3-031-43380-1\_1}, doi = {10.1007/978-3-031-43380-1\_1}, timestamp = {Sat, 14 Oct 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/BandyapadhyayFIS23.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/BastideCEGKMV23, author = {Paul Bastide and Linda Cook and Jeff Erickson and Carla Groenland and Marc J. van Kreveld and Isja Mannens and Jordi L. Vermeulen}, editor = {Dani{\"{e}}l Paulusma and Bernard Ries}, title = {Reconstructing Graphs from Connected Triples}, booktitle = {Graph-Theoretic Concepts in Computer Science - 49th International Workshop, {WG} 2023, Fribourg, Switzerland, June 28-30, 2023, Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {14093}, pages = {16--29}, publisher = {Springer}, year = {2023}, url = {https://doi.org/10.1007/978-3-031-43380-1\_2}, doi = {10.1007/978-3-031-43380-1\_2}, timestamp = {Wed, 27 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/BastideCEGKMV23.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/BaumannPR23, author = {Jakob Baumann and Matthias Pfretzschner and Ignaz Rutter}, editor = {Dani{\"{e}}l Paulusma and Bernard Ries}, title = {Parameterized Complexity of Vertex Splitting to Pathwidth at Most 1}, booktitle = {Graph-Theoretic Concepts in Computer Science - 49th International Workshop, {WG} 2023, Fribourg, Switzerland, June 28-30, 2023, Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {14093}, pages = {30--43}, publisher = {Springer}, year = {2023}, url = {https://doi.org/10.1007/978-3-031-43380-1\_3}, doi = {10.1007/978-3-031-43380-1\_3}, timestamp = {Sat, 14 Oct 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/BaumannPR23.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/BelmonteHKM23, author = {R{\'{e}}my Belmonte and Ararat Harutyunyan and Noleen K{\"{o}}hler and Nikolaos Melissinos}, editor = {Dani{\"{e}}l Paulusma and Bernard Ries}, title = {Odd Chromatic Number of Graph Classes}, booktitle = {Graph-Theoretic Concepts in Computer Science - 49th International Workshop, {WG} 2023, Fribourg, Switzerland, June 28-30, 2023, Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {14093}, pages = {44--58}, publisher = {Springer}, year = {2023}, url = {https://doi.org/10.1007/978-3-031-43380-1\_4}, doi = {10.1007/978-3-031-43380-1\_4}, timestamp = {Fri, 27 Oct 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/BelmonteHKM23.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/BensmailCMNS23, author = {Julien Bensmail and Victor A. Campos and Ana Karolinna Maia and Nicolas Nisse and Ana Silva}, editor = {Dani{\"{e}}l Paulusma and Bernard Ries}, title = {Deciding the Erd{\H{o}}s-P{\'{o}}sa Property in 3-Connected Digraphs}, booktitle = {Graph-Theoretic Concepts in Computer Science - 49th International Workshop, {WG} 2023, Fribourg, Switzerland, June 28-30, 2023, Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {14093}, pages = {59--71}, publisher = {Springer}, year = {2023}, url = {https://doi.org/10.1007/978-3-031-43380-1\_5}, doi = {10.1007/978-3-031-43380-1\_5}, timestamp = {Wed, 27 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/BensmailCMNS23.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/BergougnouxKR23, author = {Benjamin Bergougnoux and Tuukka Korhonen and Igor Razgon}, editor = {Dani{\"{e}}l Paulusma and Bernard Ries}, title = {New Width Parameters for Independent Set: One-Sided-Mim-Width and Neighbor-Depth}, booktitle = {Graph-Theoretic Concepts in Computer Science - 49th International Workshop, {WG} 2023, Fribourg, Switzerland, June 28-30, 2023, Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {14093}, pages = {72--85}, publisher = {Springer}, year = {2023}, url = {https://doi.org/10.1007/978-3-031-43380-1\_6}, doi = {10.1007/978-3-031-43380-1\_6}, timestamp = {Sat, 14 Oct 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/BergougnouxKR23.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/BinucciBDHKLMT23, author = {Carla Binucci and Giuseppe Di Battista and Walter Didimo and Seok{-}Hee Hong and Michael Kaufmann and Giuseppe Liotta and Pat Morin and Alessandra Tappini}, editor = {Dani{\"{e}}l Paulusma and Bernard Ries}, title = {Nonplanar Graph Drawings with k Vertices per Face}, booktitle = {Graph-Theoretic Concepts in Computer Science - 49th International Workshop, {WG} 2023, Fribourg, Switzerland, June 28-30, 2023, Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {14093}, pages = {86--100}, publisher = {Springer}, year = {2023}, url = {https://doi.org/10.1007/978-3-031-43380-1\_7}, doi = {10.1007/978-3-031-43380-1\_7}, timestamp = {Sat, 14 Oct 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/BinucciBDHKLMT23.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/BokFJKS23, author = {Jan Bok and Jir{\'{\i}} Fiala and Nikola Jedlickov{\'{a}} and Jan Kratochv{\'{\i}}l and Michaela Seifrtov{\'{a}}}, editor = {Dani{\"{e}}l Paulusma and Bernard Ries}, title = {Computational Complexity of Covering Colored Mixed Multigraphs with Degree Partition Equivalence Classes of Size at Most Two (Extended Abstract)}, booktitle = {Graph-Theoretic Concepts in Computer Science - 49th International Workshop, {WG} 2023, Fribourg, Switzerland, June 28-30, 2023, Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {14093}, pages = {101--115}, publisher = {Springer}, year = {2023}, url = {https://doi.org/10.1007/978-3-031-43380-1\_8}, doi = {10.1007/978-3-031-43380-1\_8}, timestamp = {Sat, 14 Oct 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/BokFJKS23.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/BonnetCD23, author = {{\'{E}}douard Bonnet and Dibyayan Chakraborty and Julien Duron}, editor = {Dani{\"{e}}l Paulusma and Bernard Ries}, title = {Cutting Barnette Graphs Perfectly is Hard}, booktitle = {Graph-Theoretic Concepts in Computer Science - 49th International Workshop, {WG} 2023, Fribourg, Switzerland, June 28-30, 2023, Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {14093}, pages = {116--129}, publisher = {Springer}, year = {2023}, url = {https://doi.org/10.1007/978-3-031-43380-1\_9}, doi = {10.1007/978-3-031-43380-1\_9}, timestamp = {Sat, 14 Oct 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/BonnetCD23.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/BousquetDP23, author = {Nicolas Bousquet and Quentin Deschamps and Aline Parreau}, editor = {Dani{\"{e}}l Paulusma and Bernard Ries}, title = {Metric Dimension Parameterized by Treewidth in Chordal Graphs}, booktitle = {Graph-Theoretic Concepts in Computer Science - 49th International Workshop, {WG} 2023, Fribourg, Switzerland, June 28-30, 2023, Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {14093}, pages = {130--142}, publisher = {Springer}, year = {2023}, url = {https://doi.org/10.1007/978-3-031-43380-1\_10}, doi = {10.1007/978-3-031-43380-1\_10}, timestamp = {Wed, 27 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/BousquetDP23.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/CaselFINZ23, author = {Katrin Casel and Tobias Friedrich and Davis Issac and Aikaterini Niklanovits and Ziena Zeif}, editor = {Dani{\"{e}}l Paulusma and Bernard Ries}, title = {Efficient Constructions for the Gy{\H{o}}ri-Lov{\'{a}}sz Theorem on Almost Chordal Graphs}, booktitle = {Graph-Theoretic Concepts in Computer Science - 49th International Workshop, {WG} 2023, Fribourg, Switzerland, June 28-30, 2023, Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {14093}, pages = {143--156}, publisher = {Springer}, year = {2023}, url = {https://doi.org/10.1007/978-3-031-43380-1\_11}, doi = {10.1007/978-3-031-43380-1\_11}, timestamp = {Sat, 14 Oct 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/CaselFINZ23.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/CervenyS23, author = {Radovan Cerven{\'{y}} and Ondrej Such{\'{y}}}, editor = {Dani{\"{e}}l Paulusma and Bernard Ries}, title = {Generating Faster Algorithms for d-Path Vertex Cover}, booktitle = {Graph-Theoretic Concepts in Computer Science - 49th International Workshop, {WG} 2023, Fribourg, Switzerland, June 28-30, 2023, Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {14093}, pages = {157--171}, publisher = {Springer}, year = {2023}, url = {https://doi.org/10.1007/978-3-031-43380-1\_12}, doi = {10.1007/978-3-031-43380-1\_12}, timestamp = {Sat, 14 Oct 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/CervenyS23.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/ChangKL23, author = {Yeonsu Chang and O{-}joung Kwon and Myounghwan Lee}, editor = {Dani{\"{e}}l Paulusma and Bernard Ries}, title = {A New Width Parameter of Graphs Based on Edge Cuts: {\(\alpha\)}-Edge-Crossing Width}, booktitle = {Graph-Theoretic Concepts in Computer Science - 49th International Workshop, {WG} 2023, Fribourg, Switzerland, June 28-30, 2023, Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {14093}, pages = {172--186}, publisher = {Springer}, year = {2023}, url = {https://doi.org/10.1007/978-3-031-43380-1\_13}, doi = {10.1007/978-3-031-43380-1\_13}, timestamp = {Sun, 06 Oct 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/ChangKL23.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/ChaplickKMMS23, author = {Steven Chaplick and Steven Kelk and Ruben Meuwese and Mat{\'{u}}s Mihal{\'{a}}k and Georgios Stamoulis}, editor = {Dani{\"{e}}l Paulusma and Bernard Ries}, title = {Snakes and Ladders: {A} Treewidth Story}, booktitle = {Graph-Theoretic Concepts in Computer Science - 49th International Workshop, {WG} 2023, Fribourg, Switzerland, June 28-30, 2023, Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {14093}, pages = {187--200}, publisher = {Springer}, year = {2023}, url = {https://doi.org/10.1007/978-3-031-43380-1\_14}, doi = {10.1007/978-3-031-43380-1\_14}, timestamp = {Mon, 05 Feb 2024 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/wg/ChaplickKMMS23.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/ChaudharyZ23, author = {Juhi Chaudhary and Meirav Zehavi}, editor = {Dani{\"{e}}l Paulusma and Bernard Ries}, title = {Parameterized Results on Acyclic Matchings with Implications for Related Problems}, booktitle = {Graph-Theoretic Concepts in Computer Science - 49th International Workshop, {WG} 2023, Fribourg, Switzerland, June 28-30, 2023, Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {14093}, pages = {201--216}, publisher = {Springer}, year = {2023}, url = {https://doi.org/10.1007/978-3-031-43380-1\_15}, doi = {10.1007/978-3-031-43380-1\_15}, timestamp = {Mon, 05 Feb 2024 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/wg/ChaudharyZ23.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/ChaudharyZ23a, author = {Juhi Chaudhary and Meirav Zehavi}, editor = {Dani{\"{e}}l Paulusma and Bernard Ries}, title = {\emph{P}-Matchings Parameterized by Treewidth}, booktitle = {Graph-Theoretic Concepts in Computer Science - 49th International Workshop, {WG} 2023, Fribourg, Switzerland, June 28-30, 2023, Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {14093}, pages = {217--231}, publisher = {Springer}, year = {2023}, url = {https://doi.org/10.1007/978-3-031-43380-1\_16}, doi = {10.1007/978-3-031-43380-1\_16}, timestamp = {Mon, 05 Feb 2024 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/wg/ChaudharyZ23a.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/DaillyFH23, author = {Antoine Dailly and Florent Foucaud and Anni Hakanen}, editor = {Dani{\"{e}}l Paulusma and Bernard Ries}, title = {Algorithms and Hardness for Metric Dimension on Digraphs}, booktitle = {Graph-Theoretic Concepts in Computer Science - 49th International Workshop, {WG} 2023, Fribourg, Switzerland, June 28-30, 2023, Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {14093}, pages = {232--245}, publisher = {Springer}, year = {2023}, url = {https://doi.org/10.1007/978-3-031-43380-1\_17}, doi = {10.1007/978-3-031-43380-1\_17}, timestamp = {Wed, 27 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/DaillyFH23.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/DavotIRT23, author = {Tom Davot and Lucas Isenmann and Sanjukta Roy and Jocelyn Thiebaut}, editor = {Dani{\"{e}}l Paulusma and Bernard Ries}, title = {Degreewidth: {A} New Parameter for Solving Problems on Tournaments}, booktitle = {Graph-Theoretic Concepts in Computer Science - 49th International Workshop, {WG} 2023, Fribourg, Switzerland, June 28-30, 2023, Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {14093}, pages = {246--260}, publisher = {Springer}, year = {2023}, url = {https://doi.org/10.1007/978-3-031-43380-1\_18}, doi = {10.1007/978-3-031-43380-1\_18}, timestamp = {Sat, 14 Oct 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/DavotIRT23.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/DraganD23, author = {Feodor F. Dragan and Guillaume Ducoffe}, editor = {Dani{\"{e}}l Paulusma and Bernard Ries}, title = {{\(\alpha\)} \({}_{\mbox{i}}\)-Metric Graphs: Radius, Diameter and all Eccentricities}, booktitle = {Graph-Theoretic Concepts in Computer Science - 49th International Workshop, {WG} 2023, Fribourg, Switzerland, June 28-30, 2023, Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {14093}, pages = {276--290}, publisher = {Springer}, year = {2023}, url = {https://doi.org/10.1007/978-3-031-43380-1\_20}, doi = {10.1007/978-3-031-43380-1\_20}, timestamp = {Wed, 27 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/DraganD23.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/DvorakFOPSV23, author = {Pavel Dvor{\'{a}}k and Luk'av{s} Folwarczn'y and Michal Opler and Pavel Pudl{\'{a}}k and Robert S{\'{a}}mal and Tung Anh Vu}, editor = {Dani{\"{e}}l Paulusma and Bernard Ries}, title = {Bounds on Functionality and Symmetric Difference - Two Intriguing Graph Parameters}, booktitle = {Graph-Theoretic Concepts in Computer Science - 49th International Workshop, {WG} 2023, Fribourg, Switzerland, June 28-30, 2023, Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {14093}, pages = {305--318}, publisher = {Springer}, year = {2023}, url = {https://doi.org/10.1007/978-3-031-43380-1\_22}, doi = {10.1007/978-3-031-43380-1\_22}, timestamp = {Wed, 24 Jan 2024 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/wg/DvorakFOPSV23.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/DvorakL23, author = {Zdenek Dvor{\'{a}}k and Abhiruk Lahiri}, editor = {Dani{\"{e}}l Paulusma and Bernard Ries}, title = {Maximum Edge Colouring Problem On Graphs That Exclude a Fixed Minor}, booktitle = {Graph-Theoretic Concepts in Computer Science - 49th International Workshop, {WG} 2023, Fribourg, Switzerland, June 28-30, 2023, Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {14093}, pages = {291--304}, publisher = {Springer}, year = {2023}, url = {https://doi.org/10.1007/978-3-031-43380-1\_21}, doi = {10.1007/978-3-031-43380-1\_21}, timestamp = {Fri, 01 Dec 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/wg/DvorakL23.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/EnrightMPS23, author = {Jessica A. Enright and Kitty Meeks and William Pettersson and John Sylvester}, editor = {Dani{\"{e}}l Paulusma and Bernard Ries}, title = {Cops and Robbers on Multi-Layer Graphs}, booktitle = {Graph-Theoretic Concepts in Computer Science - 49th International Workshop, {WG} 2023, Fribourg, Switzerland, June 28-30, 2023, Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {14093}, pages = {319--333}, publisher = {Springer}, year = {2023}, url = {https://doi.org/10.1007/978-3-031-43380-1\_23}, doi = {10.1007/978-3-031-43380-1\_23}, timestamp = {Sat, 14 Oct 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/EnrightMPS23.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/FominFG23, author = {Fedor V. Fomin and Pierre Fraigniaud and Petr A. Golovach}, editor = {Dani{\"{e}}l Paulusma and Bernard Ries}, title = {Parameterized Complexity of Broadcasting in Graphs}, booktitle = {Graph-Theoretic Concepts in Computer Science - 49th International Workshop, {WG} 2023, Fribourg, Switzerland, June 28-30, 2023, Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {14093}, pages = {334--347}, publisher = {Springer}, year = {2023}, url = {https://doi.org/10.1007/978-3-031-43380-1\_24}, doi = {10.1007/978-3-031-43380-1\_24}, timestamp = {Wed, 27 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/FominFG23.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/FominGSS23, author = {Fedor V. Fomin and Petr A. Golovach and Danil Sagunov and Kirill Simonov}, editor = {Dani{\"{e}}l Paulusma and Bernard Ries}, title = {Tur{\'{a}}n's Theorem Through Algorithmic Lens}, booktitle = {Graph-Theoretic Concepts in Computer Science - 49th International Workshop, {WG} 2023, Fribourg, Switzerland, June 28-30, 2023, Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {14093}, pages = {348--362}, publisher = {Springer}, year = {2023}, url = {https://doi.org/10.1007/978-3-031-43380-1\_25}, doi = {10.1007/978-3-031-43380-1\_25}, timestamp = {Wed, 27 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/FominGSS23.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/GoedgebeurMR23, author = {Jan Goedgebeur and Edita M{\'{a}}cajov{\'{a}} and Jarne Renders}, editor = {Dani{\"{e}}l Paulusma and Bernard Ries}, title = {On the Frank Number and Nowhere-Zero Flows on Graphs}, booktitle = {Graph-Theoretic Concepts in Computer Science - 49th International Workshop, {WG} 2023, Fribourg, Switzerland, June 28-30, 2023, Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {14093}, pages = {363--375}, publisher = {Springer}, year = {2023}, url = {https://doi.org/10.1007/978-3-031-43380-1\_26}, doi = {10.1007/978-3-031-43380-1\_26}, timestamp = {Fri, 27 Oct 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/GoedgebeurMR23.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/HavetPR23, author = {Fr{\'{e}}d{\'{e}}ric Havet and Lucas Picasarri{-}Arrieta and Cl{\'{e}}ment Rambaud}, editor = {Dani{\"{e}}l Paulusma and Bernard Ries}, title = {On the Minimum Number of Arcs in 4-Dicritical Oriented Graphs}, booktitle = {Graph-Theoretic Concepts in Computer Science - 49th International Workshop, {WG} 2023, Fribourg, Switzerland, June 28-30, 2023, Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {14093}, pages = {376--387}, publisher = {Springer}, year = {2023}, url = {https://doi.org/10.1007/978-3-031-43380-1\_27}, doi = {10.1007/978-3-031-43380-1\_27}, timestamp = {Wed, 27 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/HavetPR23.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/HegerfeldK23, author = {Falko Hegerfeld and Stefan Kratsch}, editor = {Dani{\"{e}}l Paulusma and Bernard Ries}, title = {Tight Algorithms for Connectivity Problems Parameterized by Modular-Treewidth}, booktitle = {Graph-Theoretic Concepts in Computer Science - 49th International Workshop, {WG} 2023, Fribourg, Switzerland, June 28-30, 2023, Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {14093}, pages = {388--402}, publisher = {Springer}, year = {2023}, url = {https://doi.org/10.1007/978-3-031-43380-1\_28}, doi = {10.1007/978-3-031-43380-1\_28}, timestamp = {Sat, 14 Oct 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/HegerfeldK23.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/JungeblutSU23, author = {Paul Jungeblut and Samuel Schneider and Torsten Ueckerdt}, editor = {Dani{\"{e}}l Paulusma and Bernard Ries}, title = {Cops and Robber - When Capturing Is Not Surrounding}, booktitle = {Graph-Theoretic Concepts in Computer Science - 49th International Workshop, {WG} 2023, Fribourg, Switzerland, June 28-30, 2023, Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {14093}, pages = {403--416}, publisher = {Springer}, year = {2023}, url = {https://doi.org/10.1007/978-3-031-43380-1\_29}, doi = {10.1007/978-3-031-43380-1\_29}, timestamp = {Sat, 14 Oct 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/JungeblutSU23.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/LeL23, author = {Ho{\`{a}}ng{-}Oanh Le and Van Bang Le}, editor = {Dani{\"{e}}l Paulusma and Bernard Ries}, title = {Complexity Results for Matching Cut Problems in Graphs Without Long Induced Paths}, booktitle = {Graph-Theoretic Concepts in Computer Science - 49th International Workshop, {WG} 2023, Fribourg, Switzerland, June 28-30, 2023, Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {14093}, pages = {417--431}, publisher = {Springer}, year = {2023}, url = {https://doi.org/10.1007/978-3-031-43380-1\_30}, doi = {10.1007/978-3-031-43380-1\_30}, timestamp = {Wed, 27 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/LeL23.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/MilanicU23, author = {Martin Milanic and Yushi Uno}, editor = {Dani{\"{e}}l Paulusma and Bernard Ries}, title = {Upper Clique Transversals in Graphs}, booktitle = {Graph-Theoretic Concepts in Computer Science - 49th International Workshop, {WG} 2023, Fribourg, Switzerland, June 28-30, 2023, Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {14093}, pages = {432--446}, publisher = {Springer}, year = {2023}, url = {https://doi.org/10.1007/978-3-031-43380-1\_31}, doi = {10.1007/978-3-031-43380-1\_31}, timestamp = {Sat, 14 Oct 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/MilanicU23.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/NasreNR23, author = {Meghana Nasre and Prajakta Nimbhorkar and Keshav Ranjan}, editor = {Dani{\"{e}}l Paulusma and Bernard Ries}, title = {Critical Relaxed Stable Matchings with Two-Sided Ties}, booktitle = {Graph-Theoretic Concepts in Computer Science - 49th International Workshop, {WG} 2023, Fribourg, Switzerland, June 28-30, 2023, Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {14093}, pages = {447--461}, publisher = {Springer}, year = {2023}, url = {https://doi.org/10.1007/978-3-031-43380-1\_32}, doi = {10.1007/978-3-031-43380-1\_32}, timestamp = {Wed, 27 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/NasreNR23.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/Scheffler23, author = {Robert Scheffler}, editor = {Dani{\"{e}}l Paulusma and Bernard Ries}, title = {Graph Search Trees and Their Leaves}, booktitle = {Graph-Theoretic Concepts in Computer Science - 49th International Workshop, {WG} 2023, Fribourg, Switzerland, June 28-30, 2023, Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {14093}, pages = {462--476}, publisher = {Springer}, year = {2023}, url = {https://doi.org/10.1007/978-3-031-43380-1\_33}, doi = {10.1007/978-3-031-43380-1\_33}, timestamp = {Sat, 14 Oct 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/Scheffler23.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@proceedings{DBLP:conf/wg/2023, editor = {Dani{\"{e}}l Paulusma and Bernard Ries}, title = {Graph-Theoretic Concepts in Computer Science - 49th International Workshop, {WG} 2023, Fribourg, Switzerland, June 28-30, 2023, Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {14093}, publisher = {Springer}, year = {2023}, url = {https://doi.org/10.1007/978-3-031-43380-1}, doi = {10.1007/978-3-031-43380-1}, isbn = {978-3-031-43379-5}, timestamp = {Wed, 27 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/2023.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/Abu-KhzamFM22, author = {Faisal N. Abu{-}Khzam and Henning Fernau and Kevin Mann}, editor = {Michael A. Bekos and Michael Kaufmann}, title = {Minimal Roman Dominating Functions: Extensions and Enumeration}, booktitle = {Graph-Theoretic Concepts in Computer Science - 48th International Workshop, {WG} 2022, T{\"{u}}bingen, Germany, June 22-24, 2022, Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {13453}, pages = {1--15}, publisher = {Springer}, year = {2022}, url = {https://doi.org/10.1007/978-3-031-15914-5\_1}, doi = {10.1007/978-3-031-15914-5\_1}, timestamp = {Tue, 18 Oct 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/Abu-KhzamFM22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/AichholzerOPPTV22, author = {Oswin Aichholzer and Julia Obmann and Pavel Pat{\'{a}}k and Daniel Perz and Josef Tkadlec and Birgit Vogtenhuber}, editor = {Michael A. Bekos and Michael Kaufmann}, title = {Disjoint Compatibility via Graph Classes}, booktitle = {Graph-Theoretic Concepts in Computer Science - 48th International Workshop, {WG} 2022, T{\"{u}}bingen, Germany, June 22-24, 2022, Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {13453}, pages = {16--28}, publisher = {Springer}, year = {2022}, url = {https://doi.org/10.1007/978-3-031-15914-5\_2}, doi = {10.1007/978-3-031-15914-5\_2}, timestamp = {Sat, 30 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/AichholzerOPPTV22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/ArvindNPZ22, author = {Vikraman Arvind and Roman Nedela and Ilia Ponomarenko and Peter Zeman}, editor = {Michael A. Bekos and Michael Kaufmann}, title = {Testing Isomorphism of Chordal Graphs of Bounded Leafage is Fixed-Parameter Tractable (Extended Abstract)}, booktitle = {Graph-Theoretic Concepts in Computer Science - 48th International Workshop, {WG} 2022, T{\"{u}}bingen, Germany, June 22-24, 2022, Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {13453}, pages = {29--42}, publisher = {Springer}, year = {2022}, url = {https://doi.org/10.1007/978-3-031-15914-5\_3}, doi = {10.1007/978-3-031-15914-5\_3}, timestamp = {Fri, 07 Oct 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/ArvindNPZ22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/BalabanHJ22, author = {Jakub Balab{\'{a}}n and Petr Hlinen{\'{y}} and Jan Jedelsk{\'{y}}}, editor = {Michael A. Bekos and Michael Kaufmann}, title = {Twin-Width and Transductions of Proper k-Mixed-Thin Graphs}, booktitle = {Graph-Theoretic Concepts in Computer Science - 48th International Workshop, {WG} 2022, T{\"{u}}bingen, Germany, June 22-24, 2022, Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {13453}, pages = {43--55}, publisher = {Springer}, year = {2022}, url = {https://doi.org/10.1007/978-3-031-15914-5\_4}, doi = {10.1007/978-3-031-15914-5\_4}, timestamp = {Mon, 05 Dec 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/wg/BalabanHJ22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/BartierBHMS22, author = {Valentin Bartier and Nicolas Bousquet and Jihad Hanna and Amer E. Mouawad and Sebastian Siebertz}, editor = {Michael A. Bekos and Michael Kaufmann}, title = {Token Sliding on Graphs of Girth Five}, booktitle = {Graph-Theoretic Concepts in Computer Science - 48th International Workshop, {WG} 2022, T{\"{u}}bingen, Germany, June 22-24, 2022, Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {13453}, pages = {56--69}, publisher = {Springer}, year = {2022}, url = {https://doi.org/10.1007/978-3-031-15914-5\_5}, doi = {10.1007/978-3-031-15914-5\_5}, timestamp = {Tue, 18 Oct 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/BartierBHMS22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/BergougnouxHTV22, author = {Benjamin Bergougnoux and Svein H{\o}gemo and Jan Arne Telle and Martin Vatshelle}, editor = {Michael A. Bekos and Michael Kaufmann}, title = {Recognition of Linear and Star Variants of Leaf Powers is in {P}}, booktitle = {Graph-Theoretic Concepts in Computer Science - 48th International Workshop, {WG} 2022, T{\"{u}}bingen, Germany, June 22-24, 2022, Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {13453}, pages = {70--83}, publisher = {Springer}, year = {2022}, url = {https://doi.org/10.1007/978-3-031-15914-5\_6}, doi = {10.1007/978-3-031-15914-5\_6}, timestamp = {Fri, 07 Oct 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/BergougnouxHTV22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/BodlaenderCW22, author = {Hans L. Bodlaender and Gunther Cornelissen and Marieke van der Wegen}, editor = {Michael A. Bekos and Michael Kaufmann}, title = {Problems Hard for Treewidth but Easy for Stable Gonality}, booktitle = {Graph-Theoretic Concepts in Computer Science - 48th International Workshop, {WG} 2022, T{\"{u}}bingen, Germany, June 22-24, 2022, Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {13453}, pages = {84--97}, publisher = {Springer}, year = {2022}, url = {https://doi.org/10.1007/978-3-031-15914-5\_7}, doi = {10.1007/978-3-031-15914-5\_7}, timestamp = {Tue, 18 Oct 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/BodlaenderCW22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/BrandCGHK22, author = {Cornelius Brand and Esra Ceylan and Robert Ganian and Christian Hatschka and Viktoriia Korchemna}, editor = {Michael A. Bekos and Michael Kaufmann}, title = {Edge-Cut Width: An Algorithmically Driven Analogue of Treewidth Based on Edge Cuts}, booktitle = {Graph-Theoretic Concepts in Computer Science - 48th International Workshop, {WG} 2022, T{\"{u}}bingen, Germany, June 22-24, 2022, Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {13453}, pages = {98--113}, publisher = {Springer}, year = {2022}, url = {https://doi.org/10.1007/978-3-031-15914-5\_8}, doi = {10.1007/978-3-031-15914-5\_8}, timestamp = {Tue, 18 Oct 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/BrandCGHK22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/BulteauDKOP22, author = {Laurent Bulteau and Konrad K. Dabrowski and Noleen K{\"{o}}hler and Sebastian Ordyniak and Dani{\"{e}}l Paulusma}, editor = {Michael A. Bekos and Michael Kaufmann}, title = {An Algorithmic Framework for Locally Constrained Homomorphisms}, booktitle = {Graph-Theoretic Concepts in Computer Science - 48th International Workshop, {WG} 2022, T{\"{u}}bingen, Germany, June 22-24, 2022, Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {13453}, pages = {114--128}, publisher = {Springer}, year = {2022}, url = {https://doi.org/10.1007/978-3-031-15914-5\_9}, doi = {10.1007/978-3-031-15914-5\_9}, timestamp = {Mon, 05 Dec 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/wg/BulteauDKOP22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/ChakrabortyCPP22, author = {Dibyayan Chakraborty and L. Sunil Chandran and Sajith Padinhatteeri and Raji R. Pillai}, editor = {Michael A. Bekos and Michael Kaufmann}, title = {s-Club Cluster Vertex Deletion on Interval and Well-Partitioned Chordal Graphs}, booktitle = {Graph-Theoretic Concepts in Computer Science - 48th International Workshop, {WG} 2022, T{\"{u}}bingen, Germany, June 22-24, 2022, Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {13453}, pages = {129--143}, publisher = {Springer}, year = {2022}, url = {https://doi.org/10.1007/978-3-031-15914-5\_10}, doi = {10.1007/978-3-031-15914-5\_10}, timestamp = {Tue, 18 Oct 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/ChakrabortyCPP22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/ChekanU22, author = {Vera Chekan and Torsten Ueckerdt}, editor = {Michael A. Bekos and Michael Kaufmann}, title = {Polychromatic Colorings of Unions of Geometric Hypergraphs}, booktitle = {Graph-Theoretic Concepts in Computer Science - 48th International Workshop, {WG} 2022, T{\"{u}}bingen, Germany, June 22-24, 2022, Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {13453}, pages = {144--157}, publisher = {Springer}, year = {2022}, url = {https://doi.org/10.1007/978-3-031-15914-5\_11}, doi = {10.1007/978-3-031-15914-5\_11}, timestamp = {Tue, 18 Oct 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/ChekanU22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/DekkerJ22, author = {David Dekker and Bart M. P. Jansen}, editor = {Michael A. Bekos and Michael Kaufmann}, title = {Kernelization for Feedback Vertex Set via Elimination Distance to a Forest}, booktitle = {Graph-Theoretic Concepts in Computer Science - 48th International Workshop, {WG} 2022, T{\"{u}}bingen, Germany, June 22-24, 2022, Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {13453}, pages = {158--172}, publisher = {Springer}, year = {2022}, url = {https://doi.org/10.1007/978-3-031-15914-5\_12}, doi = {10.1007/978-3-031-15914-5\_12}, timestamp = {Mon, 24 Oct 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/DekkerJ22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/DonkersJK22, author = {Huib Donkers and Bart M. P. Jansen and Jari J. H. de Kroon}, editor = {Michael A. Bekos and Michael Kaufmann}, title = {Finding k-Secluded Trees Faster}, booktitle = {Graph-Theoretic Concepts in Computer Science - 48th International Workshop, {WG} 2022, T{\"{u}}bingen, Germany, June 22-24, 2022, Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {13453}, pages = {173--186}, publisher = {Springer}, year = {2022}, url = {https://doi.org/10.1007/978-3-031-15914-5\_13}, doi = {10.1007/978-3-031-15914-5\_13}, timestamp = {Mon, 24 Oct 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/DonkersJK22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/DuarteS22, author = {Gabriel L. Duarte and U{\'{e}}verton S. Souza}, editor = {Michael A. Bekos and Michael Kaufmann}, title = {On the Minimum Cycle Cover Problem on Graphs with Bounded Co-degeneracy}, booktitle = {Graph-Theoretic Concepts in Computer Science - 48th International Workshop, {WG} 2022, T{\"{u}}bingen, Germany, June 22-24, 2022, Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {13453}, pages = {187--200}, publisher = {Springer}, year = {2022}, url = {https://doi.org/10.1007/978-3-031-15914-5\_14}, doi = {10.1007/978-3-031-15914-5\_14}, timestamp = {Fri, 07 Oct 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/DuarteS22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/EibenMR22, author = {Eduard Eiben and Diptapriyo Majumdar and M. S. Ramanujan}, editor = {Michael A. Bekos and Michael Kaufmann}, title = {On the Lossy Kernelization for Connected Treedepth Deletion Set}, booktitle = {Graph-Theoretic Concepts in Computer Science - 48th International Workshop, {WG} 2022, T{\"{u}}bingen, Germany, June 22-24, 2022, Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {13453}, pages = {201--214}, publisher = {Springer}, year = {2022}, url = {https://doi.org/10.1007/978-3-031-15914-5\_15}, doi = {10.1007/978-3-031-15914-5\_15}, timestamp = {Tue, 18 Oct 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/EibenMR22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/FeldmannV22, author = {Andreas Emil Feldmann and Tung Anh Vu}, editor = {Michael A. Bekos and Michael Kaufmann}, title = {Generalized k-Center: Distinguishing Doubling and Highway Dimension}, booktitle = {Graph-Theoretic Concepts in Computer Science - 48th International Workshop, {WG} 2022, T{\"{u}}bingen, Germany, June 22-24, 2022, Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {13453}, pages = {215--229}, publisher = {Springer}, year = {2022}, url = {https://doi.org/10.1007/978-3-031-15914-5\_16}, doi = {10.1007/978-3-031-15914-5\_16}, timestamp = {Tue, 18 Oct 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/FeldmannV22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/FialaRSZ22, author = {Jir{\'{\i}} Fiala and Ignaz Rutter and Peter Stumpf and Peter Zeman}, editor = {Michael A. Bekos and Michael Kaufmann}, title = {Extending Partial Representations of Circular-Arc Graphs}, booktitle = {Graph-Theoretic Concepts in Computer Science - 48th International Workshop, {WG} 2022, T{\"{u}}bingen, Germany, June 22-24, 2022, Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {13453}, pages = {230--243}, publisher = {Springer}, year = {2022}, url = {https://doi.org/10.1007/978-3-031-15914-5\_17}, doi = {10.1007/978-3-031-15914-5\_17}, timestamp = {Tue, 18 Oct 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/FialaRSZ22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/FrancisMM22, author = {Mathew C. Francis and Atrayee Majumder and Rogers Mathew}, editor = {Michael A. Bekos and Michael Kaufmann}, title = {Bounding Threshold Dimension: Realizing Graphic Boolean Functions as the {AND} of Majority Gates}, booktitle = {Graph-Theoretic Concepts in Computer Science - 48th International Workshop, {WG} 2022, T{\"{u}}bingen, Germany, June 22-24, 2022, Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {13453}, pages = {244--256}, publisher = {Springer}, year = {2022}, url = {https://doi.org/10.1007/978-3-031-15914-5\_18}, doi = {10.1007/978-3-031-15914-5\_18}, timestamp = {Tue, 18 Oct 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/FrancisMM22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/GalbyMSST22, author = {Esther Galby and D{\'{a}}niel Marx and Philipp Schepper and Roohani Sharma and Prafullkumar Tale}, editor = {Michael A. Bekos and Michael Kaufmann}, title = {Parameterized Complexity of Weighted Multicut in Trees}, booktitle = {Graph-Theoretic Concepts in Computer Science - 48th International Workshop, {WG} 2022, T{\"{u}}bingen, Germany, June 22-24, 2022, Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {13453}, pages = {257--270}, publisher = {Springer}, year = {2022}, url = {https://doi.org/10.1007/978-3-031-15914-5\_19}, doi = {10.1007/978-3-031-15914-5\_19}, timestamp = {Sat, 30 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/GalbyMSST22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/GoessmannKKKKKW22, author = {Ina Goe{\ss}mann and Jonathan Klawitter and Boris Klemz and Felix Klesen and Stephen G. Kobourov and Myroslav Kryven and Alexander Wolff and Johannes Zink}, editor = {Michael A. Bekos and Michael Kaufmann}, title = {The Segment Number: Algorithms and Universal Lower Bounds for Some Classes of Planar Graphs}, booktitle = {Graph-Theoretic Concepts in Computer Science - 48th International Workshop, {WG} 2022, T{\"{u}}bingen, Germany, June 22-24, 2022, Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {13453}, pages = {271--286}, publisher = {Springer}, year = {2022}, url = {https://doi.org/10.1007/978-3-031-15914-5\_20}, doi = {10.1007/978-3-031-15914-5\_20}, timestamp = {Wed, 14 Feb 2024 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/wg/GoessmannKKKKKW22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/JacobP22, author = {Hugo Jacob and Marcin Pilipczuk}, editor = {Michael A. Bekos and Michael Kaufmann}, title = {Bounding Twin-Width for Bounded-Treewidth Graphs, Planar Graphs, and Bipartite Graphs}, booktitle = {Graph-Theoretic Concepts in Computer Science - 48th International Workshop, {WG} 2022, T{\"{u}}bingen, Germany, June 22-24, 2022, Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {13453}, pages = {287--299}, publisher = {Springer}, year = {2022}, url = {https://doi.org/10.1007/978-3-031-15914-5\_21}, doi = {10.1007/978-3-031-15914-5\_21}, timestamp = {Tue, 24 Oct 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/JacobP22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/KiselevKVZ22, author = {Sergei Kiselev and Andrey Kupavskii and Oleg Verbitsky and Maksim Zhukovskii}, editor = {Michael A. Bekos and Michael Kaufmann}, title = {On Anti-stochastic Properties of Unlabeled Graphs}, booktitle = {Graph-Theoretic Concepts in Computer Science - 48th International Workshop, {WG} 2022, T{\"{u}}bingen, Germany, June 22-24, 2022, Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {13453}, pages = {300--312}, publisher = {Springer}, year = {2022}, url = {https://doi.org/10.1007/978-3-031-15914-5\_22}, doi = {10.1007/978-3-031-15914-5\_22}, timestamp = {Thu, 04 Apr 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/KiselevKVZ22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/Kisfaludi-BakOR22, author = {S{\'{a}}ndor Kisfaludi{-}Bak and Karolina Okrasa and Pawel Rzazewski}, editor = {Michael A. Bekos and Michael Kaufmann}, title = {Computing List Homomorphisms in Geometric Intersection Graphs}, booktitle = {Graph-Theoretic Concepts in Computer Science - 48th International Workshop, {WG} 2022, T{\"{u}}bingen, Germany, June 22-24, 2022, Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {13453}, pages = {313--327}, publisher = {Springer}, year = {2022}, url = {https://doi.org/10.1007/978-3-031-15914-5\_23}, doi = {10.1007/978-3-031-15914-5\_23}, timestamp = {Tue, 18 Oct 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/Kisfaludi-BakOR22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/KluteK22, author = {Fabian Klute and Marc J. van Kreveld}, editor = {Michael A. Bekos and Michael Kaufmann}, title = {On Fully Diverse Sets of Geometric Objects and Graphs}, booktitle = {Graph-Theoretic Concepts in Computer Science - 48th International Workshop, {WG} 2022, T{\"{u}}bingen, Germany, June 22-24, 2022, Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {13453}, pages = {328--341}, publisher = {Springer}, year = {2022}, url = {https://doi.org/10.1007/978-3-031-15914-5\_24}, doi = {10.1007/978-3-031-15914-5\_24}, timestamp = {Tue, 18 Oct 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/KluteK22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/KobayashiKW22, author = {Yasuaki Kobayashi and Kazuhiro Kurita and Kunihiro Wasa}, editor = {Michael A. Bekos and Michael Kaufmann}, title = {Polynomial-Delay and Polynomial-Space Enumeration of Large Maximal Matchings}, booktitle = {Graph-Theoretic Concepts in Computer Science - 48th International Workshop, {WG} 2022, T{\"{u}}bingen, Germany, June 22-24, 2022, Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {13453}, pages = {342--355}, publisher = {Springer}, year = {2022}, url = {https://doi.org/10.1007/978-3-031-15914-5\_25}, doi = {10.1007/978-3-031-15914-5\_25}, timestamp = {Tue, 18 Oct 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/KobayashiKW22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/KrithikaST22, author = {R. Krithika and Roohani Sharma and Prafullkumar Tale}, editor = {Michael A. Bekos and Michael Kaufmann}, title = {The Complexity of Contracting Bipartite Graphs into Small Cycles}, booktitle = {Graph-Theoretic Concepts in Computer Science - 48th International Workshop, {WG} 2022, T{\"{u}}bingen, Germany, June 22-24, 2022, Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {13453}, pages = {356--369}, publisher = {Springer}, year = {2022}, url = {https://doi.org/10.1007/978-3-031-15914-5\_26}, doi = {10.1007/978-3-031-15914-5\_26}, timestamp = {Sun, 06 Oct 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/KrithikaST22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/LangloisMRV22, author = {H{\'{e}}l{\`{e}}ne Langlois and Fr{\'{e}}d{\'{e}}ric Meunier and Romeo Rizzi and St{\'{e}}phane Vialette}, editor = {Michael A. Bekos and Michael Kaufmann}, title = {Algorithmic Aspects of Small Quasi-Kernels}, booktitle = {Graph-Theoretic Concepts in Computer Science - 48th International Workshop, {WG} 2022, T{\"{u}}bingen, Germany, June 22-24, 2022, Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {13453}, pages = {370--382}, publisher = {Springer}, year = {2022}, url = {https://doi.org/10.1007/978-3-031-15914-5\_27}, doi = {10.1007/978-3-031-15914-5\_27}, timestamp = {Mon, 05 Dec 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/wg/LangloisMRV22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/LiottaRT22, author = {Giuseppe Liotta and Ignaz Rutter and Alessandra Tappini}, editor = {Michael A. Bekos and Michael Kaufmann}, title = {Parameterized Complexity of Graph Planarity with Restricted Cyclic Orders}, booktitle = {Graph-Theoretic Concepts in Computer Science - 48th International Workshop, {WG} 2022, T{\"{u}}bingen, Germany, June 22-24, 2022, Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {13453}, pages = {383--397}, publisher = {Springer}, year = {2022}, url = {https://doi.org/10.1007/978-3-031-15914-5\_28}, doi = {10.1007/978-3-031-15914-5\_28}, timestamp = {Tue, 18 Oct 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/LiottaRT22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/MartinPSL22, author = {Barnaby Martin and Dani{\"{e}}l Paulusma and Siani Smith and Erik Jan van Leeuwen}, editor = {Michael A. Bekos and Michael Kaufmann}, title = {Induced Disjoint Paths and Connected Subgraphs for H-Free Graphs}, booktitle = {Graph-Theoretic Concepts in Computer Science - 48th International Workshop, {WG} 2022, T{\"{u}}bingen, Germany, June 22-24, 2022, Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {13453}, pages = {398--411}, publisher = {Springer}, year = {2022}, url = {https://doi.org/10.1007/978-3-031-15914-5\_29}, doi = {10.1007/978-3-031-15914-5\_29}, timestamp = {Mon, 05 Dec 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/wg/MartinPSL22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/PaesaniPR22, author = {Giacomo Paesani and Dani{\"{e}}l Paulusma and Pawel Rzazewski}, editor = {Michael A. Bekos and Michael Kaufmann}, title = {Classifying Subset Feedback Vertex Set for H-Free Graphs}, booktitle = {Graph-Theoretic Concepts in Computer Science - 48th International Workshop, {WG} 2022, T{\"{u}}bingen, Germany, June 22-24, 2022, Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {13453}, pages = {412--424}, publisher = {Springer}, year = {2022}, url = {https://doi.org/10.1007/978-3-031-15914-5\_30}, doi = {10.1007/978-3-031-15914-5\_30}, timestamp = {Mon, 05 Dec 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/wg/PaesaniPR22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/Scheffler22, author = {Robert Scheffler}, editor = {Michael A. Bekos and Michael Kaufmann}, title = {Linearizing Partial Search Orders}, booktitle = {Graph-Theoretic Concepts in Computer Science - 48th International Workshop, {WG} 2022, T{\"{u}}bingen, Germany, June 22-24, 2022, Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {13453}, pages = {425--438}, publisher = {Springer}, year = {2022}, url = {https://doi.org/10.1007/978-3-031-15914-5\_31}, doi = {10.1007/978-3-031-15914-5\_31}, timestamp = {Tue, 18 Oct 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/Scheffler22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/Toth22, author = {Csaba D. T{\'{o}}th}, editor = {Michael A. Bekos and Michael Kaufmann}, title = {Minimum Weight Euclidean (1+{\(\epsilon\)} )-Spanners}, booktitle = {Graph-Theoretic Concepts in Computer Science - 48th International Workshop, {WG} 2022, T{\"{u}}bingen, Germany, June 22-24, 2022, Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {13453}, pages = {439--452}, publisher = {Springer}, year = {2022}, url = {https://doi.org/10.1007/978-3-031-15914-5\_32}, doi = {10.1007/978-3-031-15914-5\_32}, timestamp = {Tue, 18 Oct 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/Toth22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@proceedings{DBLP:conf/wg/2022, editor = {Michael A. Bekos and Michael Kaufmann}, title = {Graph-Theoretic Concepts in Computer Science - 48th International Workshop, {WG} 2022, T{\"{u}}bingen, Germany, June 22-24, 2022, Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {13453}, publisher = {Springer}, year = {2022}, url = {https://doi.org/10.1007/978-3-031-15914-5}, doi = {10.1007/978-3-031-15914-5}, isbn = {978-3-031-15913-8}, timestamp = {Fri, 07 Oct 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/2022.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/AhmedBHKS21, author = {Abu Reyan Ahmed and Greg Bodwin and Keaton Hamm and Stephen G. Kobourov and Richard Spence}, editor = {Lukasz Kowalik and Michal Pilipczuk and Pawel Rzazewski}, title = {On Additive Spanners in Weighted Graphs with Local Error}, booktitle = {Graph-Theoretic Concepts in Computer Science - 47th International Workshop, {WG} 2021, Warsaw, Poland, June 23-25, 2021, Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {12911}, pages = {361--373}, publisher = {Springer}, year = {2021}, url = {https://doi.org/10.1007/978-3-030-86838-3\_28}, doi = {10.1007/978-3-030-86838-3\_28}, timestamp = {Sat, 30 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/AhmedBHKS21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/AngeliniBMP21, author = {Patrizio Angelini and Michael A. Bekos and Fabrizio Montecchiani and Maximilian Pfister}, editor = {Lukasz Kowalik and Michal Pilipczuk and Pawel Rzazewski}, title = {On Morphing 1-Planar Drawings}, booktitle = {Graph-Theoretic Concepts in Computer Science - 47th International Workshop, {WG} 2021, Warsaw, Poland, June 23-25, 2021, Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {12911}, pages = {270--282}, publisher = {Springer}, year = {2021}, url = {https://doi.org/10.1007/978-3-030-86838-3\_21}, doi = {10.1007/978-3-030-86838-3\_21}, timestamp = {Tue, 05 Oct 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/AngeliniBMP21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/AntonyGPSSS21, author = {Dhanyamol Antony and Jay Garchar and Sagartanu Pal and R. B. Sandeep and Sagnik Sen and R. Subashini}, editor = {Lukasz Kowalik and Michal Pilipczuk and Pawel Rzazewski}, title = {On Subgraph Complementation to H-free Graphs}, booktitle = {Graph-Theoretic Concepts in Computer Science - 47th International Workshop, {WG} 2021, Warsaw, Poland, June 23-25, 2021, Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {12911}, pages = {118--129}, publisher = {Springer}, year = {2021}, url = {https://doi.org/10.1007/978-3-030-86838-3\_9}, doi = {10.1007/978-3-030-86838-3\_9}, timestamp = {Sun, 06 Oct 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/AntonyGPSSS21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/BandyapadhyayBB21, author = {Sayan Bandyapadhyay and Aritra Banik and Sujoy Bhore}, editor = {Lukasz Kowalik and Michal Pilipczuk and Pawel Rzazewski}, title = {On Fair Covering and Hitting Problems}, booktitle = {Graph-Theoretic Concepts in Computer Science - 47th International Workshop, {WG} 2021, Warsaw, Poland, June 23-25, 2021, Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {12911}, pages = {39--51}, publisher = {Springer}, year = {2021}, url = {https://doi.org/10.1007/978-3-030-86838-3\_4}, doi = {10.1007/978-3-030-86838-3\_4}, timestamp = {Tue, 21 Sep 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/BandyapadhyayBB21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/BensmailFIN21, author = {Julien Bensmail and Foivos Fioravantes and Fionn Mc Inerney and Nicolas Nisse}, editor = {Lukasz Kowalik and Michal Pilipczuk and Pawel Rzazewski}, title = {The Largest Connected Subgraph Game}, booktitle = {Graph-Theoretic Concepts in Computer Science - 47th International Workshop, {WG} 2021, Warsaw, Poland, June 23-25, 2021, Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {12911}, pages = {296--307}, publisher = {Springer}, year = {2021}, url = {https://doi.org/10.1007/978-3-030-86838-3\_23}, doi = {10.1007/978-3-030-86838-3\_23}, timestamp = {Tue, 21 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/wg/BensmailFIN21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/BentertKN21, author = {Matthias Bentert and Tomohiro Koana and Rolf Niedermeier}, editor = {Lukasz Kowalik and Michal Pilipczuk and Pawel Rzazewski}, title = {The Complexity of Gerrymandering over Graphs: Paths and Trees}, booktitle = {Graph-Theoretic Concepts in Computer Science - 47th International Workshop, {WG} 2021, Warsaw, Poland, June 23-25, 2021, Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {12911}, pages = {195--206}, publisher = {Springer}, year = {2021}, url = {https://doi.org/10.1007/978-3-030-86838-3\_15}, doi = {10.1007/978-3-030-86838-3\_15}, timestamp = {Tue, 21 Sep 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/BentertKN21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/BlazejDO21, author = {V{\'{a}}clav Blazej and Pavel Dvor{\'{a}}k and Michal Opler}, editor = {Lukasz Kowalik and Michal Pilipczuk and Pawel Rzazewski}, title = {Bears with Hats and Independence Polynomials}, booktitle = {Graph-Theoretic Concepts in Computer Science - 47th International Workshop, {WG} 2021, Warsaw, Poland, June 23-25, 2021, Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {12911}, pages = {283--295}, publisher = {Springer}, year = {2021}, url = {https://doi.org/10.1007/978-3-030-86838-3\_22}, doi = {10.1007/978-3-030-86838-3\_22}, timestamp = {Fri, 13 May 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/BlazejDO21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/Bodlaender21, author = {Hans L. Bodlaender}, editor = {Lukasz Kowalik and Michal Pilipczuk and Pawel Rzazewski}, title = {Parameterized Complexity of Bandwidth of Caterpillars and Weighted Path Emulation}, booktitle = {Graph-Theoretic Concepts in Computer Science - 47th International Workshop, {WG} 2021, Warsaw, Poland, June 23-25, 2021, Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {12911}, pages = {15--27}, publisher = {Springer}, year = {2021}, url = {https://doi.org/10.1007/978-3-030-86838-3\_2}, doi = {10.1007/978-3-030-86838-3\_2}, timestamp = {Mon, 03 Jan 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/wg/Bodlaender21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/BrauseGMPS21, author = {Christoph Brause and Petr A. Golovach and Barnaby Martin and Dani{\"{e}}l Paulusma and Siani Smith}, editor = {Lukasz Kowalik and Michal Pilipczuk and Pawel Rzazewski}, title = {Acyclic, Star, and Injective Colouring: Bounding the Diameter}, booktitle = {Graph-Theoretic Concepts in Computer Science - 47th International Workshop, {WG} 2021, Warsaw, Poland, June 23-25, 2021, Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {12911}, pages = {336--348}, publisher = {Springer}, year = {2021}, url = {https://doi.org/10.1007/978-3-030-86838-3\_26}, doi = {10.1007/978-3-030-86838-3\_26}, timestamp = {Sun, 12 Nov 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/wg/BrauseGMPS21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/CaceresCMRT21, author = {Manuel C{\'{a}}ceres and Massimo Cairo and Brendan Mumey and Romeo Rizzi and Alexandru I. Tomescu}, editor = {Lukasz Kowalik and Michal Pilipczuk and Pawel Rzazewski}, title = {A Linear-Time Parameterized Algorithm for Computing the Width of a {DAG}}, booktitle = {Graph-Theoretic Concepts in Computer Science - 47th International Workshop, {WG} 2021, Warsaw, Poland, June 23-25, 2021, Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {12911}, pages = {257--269}, publisher = {Springer}, year = {2021}, url = {https://doi.org/10.1007/978-3-030-86838-3\_20}, doi = {10.1007/978-3-030-86838-3\_20}, timestamp = {Sat, 30 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/CaceresCMRT21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/CaoW21, author = {Yixin Cao and Shenghua Wang}, editor = {Lukasz Kowalik and Michal Pilipczuk and Pawel Rzazewski}, title = {Complementation in T-perfect Graphs}, booktitle = {Graph-Theoretic Concepts in Computer Science - 47th International Workshop, {WG} 2021, Warsaw, Poland, June 23-25, 2021, Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {12911}, pages = {106--117}, publisher = {Springer}, year = {2021}, url = {https://doi.org/10.1007/978-3-030-86838-3\_8}, doi = {10.1007/978-3-030-86838-3\_8}, timestamp = {Tue, 05 Oct 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/CaoW21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/CavallaroF21, author = {Dario Cavallaro and Till Fluschnik}, editor = {Lukasz Kowalik and Michal Pilipczuk and Pawel Rzazewski}, title = {Feedback Vertex Set on Hamiltonian Graphs}, booktitle = {Graph-Theoretic Concepts in Computer Science - 47th International Workshop, {WG} 2021, Warsaw, Poland, June 23-25, 2021, Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {12911}, pages = {207--218}, publisher = {Springer}, year = {2021}, url = {https://doi.org/10.1007/978-3-030-86838-3\_16}, doi = {10.1007/978-3-030-86838-3\_16}, timestamp = {Tue, 05 Oct 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/CavallaroF21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/CelaKLOWW21, author = {Eranda {\c{C}}ela and Bettina Klinz and Stefan Lendl and James B. Orlin and Gerhard J. Woeginger and Lasse Wulf}, editor = {Lukasz Kowalik and Michal Pilipczuk and Pawel Rzazewski}, title = {Linearizable Special Cases of the Quadratic Shortest Path Problem}, booktitle = {Graph-Theoretic Concepts in Computer Science - 47th International Workshop, {WG} 2021, Warsaw, Poland, June 23-25, 2021, Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {12911}, pages = {245--256}, publisher = {Springer}, year = {2021}, url = {https://doi.org/10.1007/978-3-030-86838-3\_19}, doi = {10.1007/978-3-030-86838-3\_19}, timestamp = {Sun, 04 Aug 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/CelaKLOWW21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/CrespelleGP21, author = {Christophe Crespelle and Benjamin Gras and Anthony Perez}, editor = {Lukasz Kowalik and Michal Pilipczuk and Pawel Rzazewski}, title = {Completion to Chordal Distance-Hereditary Graphs: {A} Quartic Vertex-Kernel}, booktitle = {Graph-Theoretic Concepts in Computer Science - 47th International Workshop, {WG} 2021, Warsaw, Poland, June 23-25, 2021, Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {12911}, pages = {156--168}, publisher = {Springer}, year = {2021}, url = {https://doi.org/10.1007/978-3-030-86838-3\_12}, doi = {10.1007/978-3-030-86838-3\_12}, timestamp = {Tue, 21 Sep 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/CrespelleGP21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/DasKMS21, author = {Avinandan Das and Lawqueen Kanesh and Jayakrishnan Madathil and Saket Saurabh}, editor = {Lukasz Kowalik and Michal Pilipczuk and Pawel Rzazewski}, title = {Odd Cycle Transversal in Mixed Graphs}, booktitle = {Graph-Theoretic Concepts in Computer Science - 47th International Workshop, {WG} 2021, Warsaw, Poland, June 23-25, 2021, Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {12911}, pages = {130--142}, publisher = {Springer}, year = {2021}, url = {https://doi.org/10.1007/978-3-030-86838-3\_10}, doi = {10.1007/978-3-030-86838-3\_10}, timestamp = {Tue, 21 Sep 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/DasKMS21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/DinerGST21, author = {{\"{O}}znur Yasar Diner and Archontia C. Giannopoulou and Giannos Stamoulis and Dimitrios M. Thilikos}, editor = {Lukasz Kowalik and Michal Pilipczuk and Pawel Rzazewski}, title = {Block Elimination Distance}, booktitle = {Graph-Theoretic Concepts in Computer Science - 47th International Workshop, {WG} 2021, Warsaw, Poland, June 23-25, 2021, Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {12911}, pages = {28--38}, publisher = {Springer}, year = {2021}, url = {https://doi.org/10.1007/978-3-030-86838-3\_3}, doi = {10.1007/978-3-030-86838-3\_3}, timestamp = {Wed, 07 Dec 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/wg/DinerGST21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/DonkersJ21, author = {Huib Donkers and Bart M. P. Jansen}, editor = {Lukasz Kowalik and Michal Pilipczuk and Pawel Rzazewski}, title = {Preprocessing to Reduce the Search Space: Antler Structures for Feedback Vertex Set}, booktitle = {Graph-Theoretic Concepts in Computer Science - 47th International Workshop, {WG} 2021, Warsaw, Poland, June 23-25, 2021, Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {12911}, pages = {1--14}, publisher = {Springer}, year = {2021}, url = {https://doi.org/10.1007/978-3-030-86838-3\_1}, doi = {10.1007/978-3-030-86838-3\_1}, timestamp = {Sat, 08 Jun 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/DonkersJ21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/Ducoffe21, author = {Guillaume Ducoffe}, editor = {Lukasz Kowalik and Michal Pilipczuk and Pawel Rzazewski}, title = {Beyond Helly Graphs: The Diameter Problem on Absolute Retracts}, booktitle = {Graph-Theoretic Concepts in Computer Science - 47th International Workshop, {WG} 2021, Warsaw, Poland, June 23-25, 2021, Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {12911}, pages = {321--335}, publisher = {Springer}, year = {2021}, url = {https://doi.org/10.1007/978-3-030-86838-3\_25}, doi = {10.1007/978-3-030-86838-3\_25}, timestamp = {Tue, 05 Oct 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/Ducoffe21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/Eppstein21, author = {David Eppstein}, editor = {Lukasz Kowalik and Michal Pilipczuk and Pawel Rzazewski}, title = {The Graphs of Stably Matchable Pairs}, booktitle = {Graph-Theoretic Concepts in Computer Science - 47th International Workshop, {WG} 2021, Warsaw, Poland, June 23-25, 2021, Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {12911}, pages = {349--360}, publisher = {Springer}, year = {2021}, url = {https://doi.org/10.1007/978-3-030-86838-3\_27}, doi = {10.1007/978-3-030-86838-3\_27}, timestamp = {Tue, 21 Sep 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/Eppstein21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/FominGT21, author = {Fedor V. Fomin and Petr A. Golovach and Dimitrios M. Thilikos}, editor = {Lukasz Kowalik and Michal Pilipczuk and Pawel Rzazewski}, title = {Can Romeo and Juliet Meet? or Rendezvous Games with Adversaries on Graphs}, booktitle = {Graph-Theoretic Concepts in Computer Science - 47th International Workshop, {WG} 2021, Warsaw, Poland, June 23-25, 2021, Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {12911}, pages = {308--320}, publisher = {Springer}, year = {2021}, url = {https://doi.org/10.1007/978-3-030-86838-3\_24}, doi = {10.1007/978-3-030-86838-3\_24}, timestamp = {Sun, 12 Nov 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/wg/FominGT21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/GaneshHNP21, author = {Aadityan Ganesh and Vishwa Prakash HV and Prajakta Nimbhorkar and Geevarghese Philip}, editor = {Lukasz Kowalik and Michal Pilipczuk and Pawel Rzazewski}, title = {Disjoint Stable Matchings in Linear Time}, booktitle = {Graph-Theoretic Concepts in Computer Science - 47th International Workshop, {WG} 2021, Warsaw, Poland, June 23-25, 2021, Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {12911}, pages = {94--105}, publisher = {Springer}, year = {2021}, url = {https://doi.org/10.1007/978-3-030-86838-3\_7}, doi = {10.1007/978-3-030-86838-3\_7}, timestamp = {Mon, 03 Jan 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/wg/GaneshHNP21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/GruttemeierKMS21, author = {Niels Gr{\"{u}}ttemeier and Christian Komusiewicz and Nils Morawietz and Frank Sommer}, editor = {Lukasz Kowalik and Michal Pilipczuk and Pawel Rzazewski}, title = {Preventing Small (s,t)Cuts by Protecting Edges}, booktitle = {Graph-Theoretic Concepts in Computer Science - 47th International Workshop, {WG} 2021, Warsaw, Poland, June 23-25, 2021, Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {12911}, pages = {143--155}, publisher = {Springer}, year = {2021}, url = {https://doi.org/10.1007/978-3-030-86838-3\_11}, doi = {10.1007/978-3-030-86838-3\_11}, timestamp = {Thu, 31 Aug 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/GruttemeierKMS21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/JansenK21, author = {Bart M. P. Jansen and Jari J. H. de Kroon}, editor = {Lukasz Kowalik and Michal Pilipczuk and Pawel Rzazewski}, title = {{FPT} Algorithms to Compute the Elimination Distance to Bipartite Graphs and More}, booktitle = {Graph-Theoretic Concepts in Computer Science - 47th International Workshop, {WG} 2021, Warsaw, Poland, June 23-25, 2021, Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {12911}, pages = {80--93}, publisher = {Springer}, year = {2021}, url = {https://doi.org/10.1007/978-3-030-86838-3\_6}, doi = {10.1007/978-3-030-86838-3\_6}, timestamp = {Sat, 08 Jun 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/JansenK21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/JelinekKMNP21, author = {V{\'{\i}}t Jel{\'{\i}}nek and Tereza Klimosov{\'{a}} and Tom{\'{a}}s Masar{\'{\i}}k and Jana Novotn{\'{a}} and Aneta Pokorn{\'{a}}}, editor = {Lukasz Kowalik and Michal Pilipczuk and Pawel Rzazewski}, title = {On 3-Coloring of (2P\({}_{\mbox{4, C\({}_{\mbox{5)}}\)}}\)-Free Graphs}, booktitle = {Graph-Theoretic Concepts in Computer Science - 47th International Workshop, {WG} 2021, Warsaw, Poland, June 23-25, 2021, Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {12911}, pages = {388--401}, publisher = {Springer}, year = {2021}, url = {https://doi.org/10.1007/978-3-030-86838-3\_30}, doi = {10.1007/978-3-030-86838-3\_30}, timestamp = {Sat, 09 Apr 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/JelinekKMNP21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/KriskoM21, author = {Colin Krisko and Avery Miller}, editor = {Lukasz Kowalik and Michal Pilipczuk and Pawel Rzazewski}, title = {Labeling Schemes for Deterministic Radio Multi-broadcast}, booktitle = {Graph-Theoretic Concepts in Computer Science - 47th International Workshop, {WG} 2021, Warsaw, Poland, June 23-25, 2021, Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {12911}, pages = {374--387}, publisher = {Springer}, year = {2021}, url = {https://doi.org/10.1007/978-3-030-86838-3\_29}, doi = {10.1007/978-3-030-86838-3\_29}, timestamp = {Tue, 05 Oct 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/KriskoM21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/LeT21, author = {Van Bang Le and Jan Arne Telle}, editor = {Lukasz Kowalik and Michal Pilipczuk and Pawel Rzazewski}, title = {The Perfect Matching Cut Problem Revisited}, booktitle = {Graph-Theoretic Concepts in Computer Science - 47th International Workshop, {WG} 2021, Warsaw, Poland, June 23-25, 2021, Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {12911}, pages = {182--194}, publisher = {Springer}, year = {2021}, url = {https://doi.org/10.1007/978-3-030-86838-3\_14}, doi = {10.1007/978-3-030-86838-3\_14}, timestamp = {Tue, 21 Sep 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/LeT21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/MannensNSS21, author = {Isja Mannens and Jesper Nederlof and C{\'{e}}line M. F. Swennenhuis and Krisztina Szil{\'{a}}gyi}, editor = {Lukasz Kowalik and Michal Pilipczuk and Pawel Rzazewski}, title = {On the Parameterized Complexity of the Connected Flow and Many Visits {TSP} Problem}, booktitle = {Graph-Theoretic Concepts in Computer Science - 47th International Workshop, {WG} 2021, Warsaw, Poland, June 23-25, 2021, Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {12911}, pages = {52--79}, publisher = {Springer}, year = {2021}, url = {https://doi.org/10.1007/978-3-030-86838-3\_5}, doi = {10.1007/978-3-030-86838-3\_5}, timestamp = {Sun, 02 Oct 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/MannensNSS21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/RymarMNN21, author = {Maciej Rymar and Hendrik Molter and Andr{\'{e}} Nichterlein and Rolf Niedermeier}, editor = {Lukasz Kowalik and Michal Pilipczuk and Pawel Rzazewski}, title = {Towards Classifying the Polynomial-Time Solvability of Temporal Betweenness Centrality}, booktitle = {Graph-Theoretic Concepts in Computer Science - 47th International Workshop, {WG} 2021, Warsaw, Poland, June 23-25, 2021, Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {12911}, pages = {219--231}, publisher = {Springer}, year = {2021}, url = {https://doi.org/10.1007/978-3-030-86838-3\_17}, doi = {10.1007/978-3-030-86838-3\_17}, timestamp = {Tue, 21 Sep 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/RymarMNN21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/SwatK21, author = {Sylwester Swat and Marta Kasprzak}, editor = {Lukasz Kowalik and Michal Pilipczuk and Pawel Rzazewski}, title = {A Heuristic Approach to the Treedepth Decomposition Problem for Large Graphs}, booktitle = {Graph-Theoretic Concepts in Computer Science - 47th International Workshop, {WG} 2021, Warsaw, Poland, June 23-25, 2021, Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {12911}, pages = {169--181}, publisher = {Springer}, year = {2021}, url = {https://doi.org/10.1007/978-3-030-86838-3\_13}, doi = {10.1007/978-3-030-86838-3\_13}, timestamp = {Mon, 28 Aug 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/SwatK21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/VortmeierK21, author = {Nils Vortmeier and Ioannis Kokkinis}, editor = {Lukasz Kowalik and Michal Pilipczuk and Pawel Rzazewski}, title = {The Dynamic Complexity of Acyclic Hypergraph Homomorphisms}, booktitle = {Graph-Theoretic Concepts in Computer Science - 47th International Workshop, {WG} 2021, Warsaw, Poland, June 23-25, 2021, Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {12911}, pages = {232--244}, publisher = {Springer}, year = {2021}, url = {https://doi.org/10.1007/978-3-030-86838-3\_18}, doi = {10.1007/978-3-030-86838-3\_18}, timestamp = {Tue, 21 Sep 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/VortmeierK21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@proceedings{DBLP:conf/wg/2021, editor = {Lukasz Kowalik and Michal Pilipczuk and Pawel Rzazewski}, title = {Graph-Theoretic Concepts in Computer Science - 47th International Workshop, {WG} 2021, Warsaw, Poland, June 23-25, 2021, Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {12911}, publisher = {Springer}, year = {2021}, url = {https://doi.org/10.1007/978-3-030-86838-3}, doi = {10.1007/978-3-030-86838-3}, isbn = {978-3-030-86837-6}, timestamp = {Tue, 21 Sep 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/2021.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/AhmedBSKS20, author = {Abu Reyan Ahmed and Greg Bodwin and Faryad Darabi Sahneh and Stephen G. Kobourov and Richard Spence}, editor = {Isolde Adler and Haiko M{\"{u}}ller}, title = {Weighted Additive Spanners}, booktitle = {Graph-Theoretic Concepts in Computer Science - 46th International Workshop, {WG} 2020, Leeds, UK, June 24-26, 2020, Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {12301}, pages = {401--413}, publisher = {Springer}, year = {2020}, url = {https://doi.org/10.1007/978-3-030-60440-0\_32}, doi = {10.1007/978-3-030-60440-0\_32}, timestamp = {Sat, 30 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/AhmedBSKS20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/AhnJKL20, author = {Jungho Ahn and Lars Jaffke and O{-}joung Kwon and Paloma T. Lima}, editor = {Isolde Adler and Haiko M{\"{u}}ller}, title = {Well-Partitioned Chordal Graphs: Obstruction Set and Disjoint Paths}, booktitle = {Graph-Theoretic Concepts in Computer Science - 46th International Workshop, {WG} 2020, Leeds, UK, June 24-26, 2020, Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {12301}, pages = {148--160}, publisher = {Springer}, year = {2020}, url = {https://doi.org/10.1007/978-3-030-60440-0\_12}, doi = {10.1007/978-3-030-60440-0\_12}, timestamp = {Sat, 14 Nov 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/wg/AhnJKL20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/AichholzerBBCFM20, author = {Oswin Aichholzer and Manuel Borrazzo and Prosenjit Bose and Jean Cardinal and Fabrizio Frati and Pat Morin and Birgit Vogtenhuber}, editor = {Isolde Adler and Haiko M{\"{u}}ller}, title = {Drawing Graphs as Spanners}, booktitle = {Graph-Theoretic Concepts in Computer Science - 46th International Workshop, {WG} 2020, Leeds, UK, June 24-26, 2020, Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {12301}, pages = {310--324}, publisher = {Springer}, year = {2020}, url = {https://doi.org/10.1007/978-3-030-60440-0\_25}, doi = {10.1007/978-3-030-60440-0\_25}, timestamp = {Tue, 07 May 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/AichholzerBBCFM20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/AngeliniBFG20, author = {Patrizio Angelini and Michael A. Bekos and Henry F{\"{o}}rster and Martin Gronemann}, editor = {Isolde Adler and Haiko M{\"{u}}ller}, title = {Bitonic st-Orderings for Upward Planar Graphs: The Variable Embedding Setting}, booktitle = {Graph-Theoretic Concepts in Computer Science - 46th International Workshop, {WG} 2020, Leeds, UK, June 24-26, 2020, Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {12301}, pages = {339--351}, publisher = {Springer}, year = {2020}, url = {https://doi.org/10.1007/978-3-030-60440-0\_27}, doi = {10.1007/978-3-030-60440-0\_27}, timestamp = {Sat, 14 Nov 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/wg/AngeliniBFG20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/ArroyoKPSVW20, author = {Alan Arroyo and Fabian Klute and Irene Parada and Raimund Seidel and Birgit Vogtenhuber and Tilo Wiedera}, editor = {Isolde Adler and Haiko M{\"{u}}ller}, title = {Inserting One Edge into a Simple Drawing Is Hard}, booktitle = {Graph-Theoretic Concepts in Computer Science - 46th International Workshop, {WG} 2020, Leeds, UK, June 24-26, 2020, Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {12301}, pages = {325--338}, publisher = {Springer}, year = {2020}, url = {https://doi.org/10.1007/978-3-030-60440-0\_26}, doi = {10.1007/978-3-030-60440-0\_26}, timestamp = {Sat, 14 Nov 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/wg/ArroyoKPSVW20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/BasavarajuBFP20, author = {Manu Basavaraju and Arijit Bishnu and Mathew C. Francis and Drimit Pattanayak}, editor = {Isolde Adler and Haiko M{\"{u}}ller}, title = {The Linear Arboricity Conjecture for 3-Degenerate Graphs}, booktitle = {Graph-Theoretic Concepts in Computer Science - 46th International Workshop, {WG} 2020, Leeds, UK, June 24-26, 2020, Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {12301}, pages = {376--387}, publisher = {Springer}, year = {2020}, url = {https://doi.org/10.1007/978-3-030-60440-0\_30}, doi = {10.1007/978-3-030-60440-0\_30}, timestamp = {Thu, 22 Oct 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/BasavarajuBFP20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/BeisegelCKKMPSS20, author = {Jesse Beisegel and Nina Chiarelli and Ekkehard K{\"{o}}hler and Matjaz Krnc and Martin Milanic and Nevena Pivac and Robert Scheffler and Martin Strehler}, editor = {Isolde Adler and Haiko M{\"{u}}ller}, title = {Edge Elimination and Weighted Graph Classes}, booktitle = {Graph-Theoretic Concepts in Computer Science - 46th International Workshop, {WG} 2020, Leeds, UK, June 24-26, 2020, Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {12301}, pages = {134--147}, publisher = {Springer}, year = {2020}, url = {https://doi.org/10.1007/978-3-030-60440-0\_11}, doi = {10.1007/978-3-030-60440-0\_11}, timestamp = {Mon, 04 Jul 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/BeisegelCKKMPSS20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/BelmonteS20, author = {R{\'{e}}my Belmonte and Ignasi Sau}, editor = {Isolde Adler and Haiko M{\"{u}}ller}, title = {On the Complexity of Finding Large Odd Induced Subgraphs and Odd Colorings}, booktitle = {Graph-Theoretic Concepts in Computer Science - 46th International Workshop, {WG} 2020, Leeds, UK, June 24-26, 2020, Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {12301}, pages = {67--79}, publisher = {Springer}, year = {2020}, url = {https://doi.org/10.1007/978-3-030-60440-0\_6}, doi = {10.1007/978-3-030-60440-0\_6}, timestamp = {Tue, 29 Dec 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/wg/BelmonteS20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/BergougnouxPT20, author = {Benjamin Bergougnoux and Charis Papadopoulos and Jan Arne Telle}, editor = {Isolde Adler and Haiko M{\"{u}}ller}, title = {Node Multiway Cut and Subset Feedback Vertex Set on Graphs of Bounded Mim-width}, booktitle = {Graph-Theoretic Concepts in Computer Science - 46th International Workshop, {WG} 2020, Leeds, UK, June 24-26, 2020, Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {12301}, pages = {388--400}, publisher = {Springer}, year = {2020}, url = {https://doi.org/10.1007/978-3-030-60440-0\_31}, doi = {10.1007/978-3-030-60440-0\_31}, timestamp = {Fri, 09 Apr 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/BergougnouxPT20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/BhyravarapuK20, author = {Sriram Bhyravarapu and Subrahmanyam Kalyanasundaram}, editor = {Isolde Adler and Haiko M{\"{u}}ller}, title = {Combinatorial Bounds for Conflict-Free Coloring on Open Neighborhoods}, booktitle = {Graph-Theoretic Concepts in Computer Science - 46th International Workshop, {WG} 2020, Leeds, UK, June 24-26, 2020, Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {12301}, pages = {1--13}, publisher = {Springer}, year = {2020}, url = {https://doi.org/10.1007/978-3-030-60440-0\_1}, doi = {10.1007/978-3-030-60440-0\_1}, timestamp = {Tue, 21 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/wg/BhyravarapuK20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/BiedlK20, author = {Therese Biedl and Fabian Klute}, editor = {Isolde Adler and Haiko M{\"{u}}ller}, title = {Finding Large Matchings in 1-Planar Graphs of Minimum Degree 3}, booktitle = {Graph-Theoretic Concepts in Computer Science - 46th International Workshop, {WG} 2020, Leeds, UK, June 24-26, 2020, Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {12301}, pages = {248--260}, publisher = {Springer}, year = {2020}, url = {https://doi.org/10.1007/978-3-030-60440-0\_20}, doi = {10.1007/978-3-030-60440-0\_20}, timestamp = {Thu, 11 Aug 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/BiedlK20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/BodlaenderBFG20, author = {Hans L. Bodlaender and Benjamin A. Burton and Fedor V. Fomin and Alexander Grigoriev}, editor = {Isolde Adler and Haiko M{\"{u}}ller}, title = {Knot Diagrams of Treewidth Two}, booktitle = {Graph-Theoretic Concepts in Computer Science - 46th International Workshop, {WG} 2020, Leeds, UK, June 24-26, 2020, Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {12301}, pages = {80--91}, publisher = {Springer}, year = {2020}, url = {https://doi.org/10.1007/978-3-030-60440-0\_7}, doi = {10.1007/978-3-030-60440-0\_7}, timestamp = {Tue, 07 May 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/BodlaenderBFG20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/BrettellJPP20, author = {Nick Brettell and Matthew Johnson and Giacomo Paesani and Dani{\"{e}}l Paulusma}, editor = {Isolde Adler and Haiko M{\"{u}}ller}, title = {Computing Subset Transversals in H-Free Graphs}, booktitle = {Graph-Theoretic Concepts in Computer Science - 46th International Workshop, {WG} 2020, Leeds, UK, June 24-26, 2020, Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {12301}, pages = {187--199}, publisher = {Springer}, year = {2020}, url = {https://doi.org/10.1007/978-3-030-60440-0\_15}, doi = {10.1007/978-3-030-60440-0\_15}, timestamp = {Tue, 07 May 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/BrettellJPP20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/CagiriciHPS20, author = {Onur {\c{C}}agirici and Petr Hlinen{\'{y}} and Filip Pokr{\'{y}}vka and Abhisekh Sankaran}, editor = {Isolde Adler and Haiko M{\"{u}}ller}, title = {Clique-Width of Point Configurations}, booktitle = {Graph-Theoretic Concepts in Computer Science - 46th International Workshop, {WG} 2020, Leeds, UK, June 24-26, 2020, Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {12301}, pages = {54--66}, publisher = {Springer}, year = {2020}, url = {https://doi.org/10.1007/978-3-030-60440-0\_5}, doi = {10.1007/978-3-030-60440-0\_5}, timestamp = {Sat, 14 Nov 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/wg/CagiriciHPS20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/CaoRW20, author = {Yixin Cao and Guozhen Rong and Jianxin Wang}, editor = {Isolde Adler and Haiko M{\"{u}}ller}, title = {Characterization and Linear-Time Recognition of Paired Threshold Graphs}, booktitle = {Graph-Theoretic Concepts in Computer Science - 46th International Workshop, {WG} 2020, Leeds, UK, June 24-26, 2020, Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {12301}, pages = {298--309}, publisher = {Springer}, year = {2020}, url = {https://doi.org/10.1007/978-3-030-60440-0\_24}, doi = {10.1007/978-3-030-60440-0\_24}, timestamp = {Thu, 18 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/wg/CaoRW20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/ChalermsookJO20, author = {Parinya Chalermsook and Wanchote Po Jiamjitrak and Ly Orgo}, editor = {Isolde Adler and Haiko M{\"{u}}ller}, title = {On Finding Balanced Bicliques via Matchings}, booktitle = {Graph-Theoretic Concepts in Computer Science - 46th International Workshop, {WG} 2020, Leeds, UK, June 24-26, 2020, Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {12301}, pages = {238--247}, publisher = {Springer}, year = {2020}, url = {https://doi.org/10.1007/978-3-030-60440-0\_19}, doi = {10.1007/978-3-030-60440-0\_19}, timestamp = {Sat, 30 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/ChalermsookJO20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/ChiarelliMMMM20, author = {Nina Chiarelli and Berenice Mart{\'{\i}}nez{-}Barona and Martin Milanic and J{\'{e}}r{\^{o}}me Monnot and Peter Mursic}, editor = {Isolde Adler and Haiko M{\"{u}}ller}, title = {Strong Cliques in Diamond-Free Graphs}, booktitle = {Graph-Theoretic Concepts in Computer Science - 46th International Workshop, {WG} 2020, Leeds, UK, June 24-26, 2020, Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {12301}, pages = {261--273}, publisher = {Springer}, year = {2020}, url = {https://doi.org/10.1007/978-3-030-60440-0\_21}, doi = {10.1007/978-3-030-60440-0\_21}, timestamp = {Thu, 22 Oct 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/ChiarelliMMMM20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/DabrowskiMNPR20, author = {Konrad K. Dabrowski and Tom{\'{a}}s Masar{\'{\i}}k and Jana Novotn{\'{a}} and Dani{\"{e}}l Paulusma and Pawel Rzazewski}, editor = {Isolde Adler and Haiko M{\"{u}}ller}, title = {Clique-Width: Harnessing the Power of Atoms}, booktitle = {Graph-Theoretic Concepts in Computer Science - 46th International Workshop, {WG} 2020, Leeds, UK, June 24-26, 2020, Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {12301}, pages = {119--133}, publisher = {Springer}, year = {2020}, url = {https://doi.org/10.1007/978-3-030-60440-0\_10}, doi = {10.1007/978-3-030-60440-0\_10}, timestamp = {Sat, 14 Nov 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/wg/DabrowskiMNPR20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/DallardMS20, author = {Cl{\'{e}}ment Dallard and Martin Milanic and Kenny Storgel}, editor = {Isolde Adler and Haiko M{\"{u}}ller}, title = {Treewidth Versus Clique Number in Graph Classes with a Forbidden Structure}, booktitle = {Graph-Theoretic Concepts in Computer Science - 46th International Workshop, {WG} 2020, Leeds, UK, June 24-26, 2020, Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {12301}, pages = {92--105}, publisher = {Springer}, year = {2020}, url = {https://doi.org/10.1007/978-3-030-60440-0\_8}, doi = {10.1007/978-3-030-60440-0\_8}, timestamp = {Fri, 09 Apr 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/DallardMS20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/DvorakFRR20, author = {Pavel Dvor{\'{a}}k and Andreas Emil Feldmann and Ashutosh Rai and Pawel Rzazewski}, editor = {Isolde Adler and Haiko M{\"{u}}ller}, title = {Parameterized Inapproximability of Independent Set in H-Free Graphs}, booktitle = {Graph-Theoretic Concepts in Computer Science - 46th International Workshop, {WG} 2020, Leeds, UK, June 24-26, 2020, Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {12301}, pages = {40--53}, publisher = {Springer}, year = {2020}, url = {https://doi.org/10.1007/978-3-030-60440-0\_4}, doi = {10.1007/978-3-030-60440-0\_4}, timestamp = {Tue, 21 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/wg/DvorakFRR20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/FelsnerKU20, author = {Stefan Felsner and Kolja Knauer and Torsten Ueckerdt}, editor = {Isolde Adler and Haiko M{\"{u}}ller}, title = {Plattenbauten: Touching Rectangles in Space}, booktitle = {Graph-Theoretic Concepts in Computer Science - 46th International Workshop, {WG} 2020, Leeds, UK, June 24-26, 2020, Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {12301}, pages = {161--173}, publisher = {Springer}, year = {2020}, url = {https://doi.org/10.1007/978-3-030-60440-0\_13}, doi = {10.1007/978-3-030-60440-0\_13}, timestamp = {Thu, 22 Oct 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/FelsnerKU20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/FrancisNR20, author = {Mathew C. Francis and Rian Neogi and Venkatesh Raman}, editor = {Isolde Adler and Haiko M{\"{u}}ller}, title = {Recognizing k-Clique Extendible Orderings}, booktitle = {Graph-Theoretic Concepts in Computer Science - 46th International Workshop, {WG} 2020, Leeds, UK, June 24-26, 2020, Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {12301}, pages = {274--285}, publisher = {Springer}, year = {2020}, url = {https://doi.org/10.1007/978-3-030-60440-0\_22}, doi = {10.1007/978-3-030-60440-0\_22}, timestamp = {Fri, 27 Nov 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/wg/FrancisNR20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/FratiHT20, author = {Fabrizio Frati and Michael Hoffmann and Csaba D. T{\'{o}}th}, editor = {Isolde Adler and Haiko M{\"{u}}ller}, title = {Universal Geometric Graphs}, booktitle = {Graph-Theoretic Concepts in Computer Science - 46th International Workshop, {WG} 2020, Leeds, UK, June 24-26, 2020, Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {12301}, pages = {174--186}, publisher = {Springer}, year = {2020}, url = {https://doi.org/10.1007/978-3-030-60440-0\_14}, doi = {10.1007/978-3-030-60440-0\_14}, timestamp = {Fri, 09 Apr 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/FratiHT20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/FriezeTS20, author = {Alan M. Frieze and Krzysztof Turowski and Wojciech Szpankowski}, editor = {Isolde Adler and Haiko M{\"{u}}ller}, title = {Degree Distribution for Duplication-Divergence Graphs: Large Deviations}, booktitle = {Graph-Theoretic Concepts in Computer Science - 46th International Workshop, {WG} 2020, Leeds, UK, June 24-26, 2020, Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {12301}, pages = {226--237}, publisher = {Springer}, year = {2020}, url = {https://doi.org/10.1007/978-3-030-60440-0\_18}, doi = {10.1007/978-3-030-60440-0\_18}, timestamp = {Sat, 14 Nov 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/wg/FriezeTS20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/FujitaPS20, author = {Shinya Fujita and Boram Park and Tadashi Sakuma}, editor = {Isolde Adler and Haiko M{\"{u}}ller}, title = {Stable Structure on Safe Set Problems in Vertex-Weighted Graphs {II} -Recognition and Complexity-}, booktitle = {Graph-Theoretic Concepts in Computer Science - 46th International Workshop, {WG} 2020, Leeds, UK, June 24-26, 2020, Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {12301}, pages = {364--375}, publisher = {Springer}, year = {2020}, url = {https://doi.org/10.1007/978-3-030-60440-0\_29}, doi = {10.1007/978-3-030-60440-0\_29}, timestamp = {Sat, 14 Nov 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/wg/FujitaPS20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/HaagMNR20, author = {Roman Haag and Hendrik Molter and Rolf Niedermeier and Malte Renken}, editor = {Isolde Adler and Haiko M{\"{u}}ller}, title = {Feedback Edge Sets in Temporal Graphs}, booktitle = {Graph-Theoretic Concepts in Computer Science - 46th International Workshop, {WG} 2020, Leeds, UK, June 24-26, 2020, Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {12301}, pages = {200--212}, publisher = {Springer}, year = {2020}, url = {https://doi.org/10.1007/978-3-030-60440-0\_16}, doi = {10.1007/978-3-030-60440-0\_16}, timestamp = {Sat, 14 Nov 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/wg/HaagMNR20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/HeinrichHSS20, author = {Irene Heinrich and Till Heller and Eva Schmidt and Manuel Streicher}, editor = {Isolde Adler and Haiko M{\"{u}}ller}, title = {2.5-Connectivity: Unique Components, Critical Graphs, and Applications}, booktitle = {Graph-Theoretic Concepts in Computer Science - 46th International Workshop, {WG} 2020, Leeds, UK, June 24-26, 2020, Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {12301}, pages = {352--363}, publisher = {Springer}, year = {2020}, url = {https://doi.org/10.1007/978-3-030-60440-0\_28}, doi = {10.1007/978-3-030-60440-0\_28}, timestamp = {Sat, 14 Nov 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/wg/HeinrichHSS20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/JungeblutU20, author = {Paul Jungeblut and Torsten Ueckerdt}, editor = {Isolde Adler and Haiko M{\"{u}}ller}, title = {Guarding Quadrangulations and Stacked Triangulations with Edges}, booktitle = {Graph-Theoretic Concepts in Computer Science - 46th International Workshop, {WG} 2020, Leeds, UK, June 24-26, 2020, Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {12301}, pages = {14--26}, publisher = {Springer}, year = {2020}, url = {https://doi.org/10.1007/978-3-030-60440-0\_2}, doi = {10.1007/978-3-030-60440-0\_2}, timestamp = {Thu, 14 Oct 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/JungeblutU20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/KlavikKZ20, author = {Pavel Klav{\'{\i}}k and Dusan Knop and Peter Zeman}, editor = {Isolde Adler and Haiko M{\"{u}}ller}, title = {Graph Isomorphism Restricted by Lists}, booktitle = {Graph-Theoretic Concepts in Computer Science - 46th International Workshop, {WG} 2020, Leeds, UK, June 24-26, 2020, Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {12301}, pages = {106--118}, publisher = {Springer}, year = {2020}, url = {https://doi.org/10.1007/978-3-030-60440-0\_9}, doi = {10.1007/978-3-030-60440-0\_9}, timestamp = {Thu, 22 Oct 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/KlavikKZ20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/KobayashiOOU20, author = {Yusuke Kobayashi and Yoshio Okamoto and Yota Otachi and Yushi Uno}, editor = {Isolde Adler and Haiko M{\"{u}}ller}, title = {Linear-Time Recognition of Double-Threshold Graphs}, booktitle = {Graph-Theoretic Concepts in Computer Science - 46th International Workshop, {WG} 2020, Leeds, UK, June 24-26, 2020, Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {12301}, pages = {286--297}, publisher = {Springer}, year = {2020}, url = {https://doi.org/10.1007/978-3-030-60440-0\_23}, doi = {10.1007/978-3-030-60440-0\_23}, timestamp = {Sat, 14 Nov 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/wg/KobayashiOOU20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/MilichMP20, author = {Marcel Milich and Torsten M{\"{u}}tze and Martin Pergel}, editor = {Isolde Adler and Haiko M{\"{u}}ller}, title = {On Flips in Planar Matchings}, booktitle = {Graph-Theoretic Concepts in Computer Science - 46th International Workshop, {WG} 2020, Leeds, UK, June 24-26, 2020, Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {12301}, pages = {213--225}, publisher = {Springer}, year = {2020}, url = {https://doi.org/10.1007/978-3-030-60440-0\_17}, doi = {10.1007/978-3-030-60440-0\_17}, timestamp = {Tue, 21 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/wg/MilichMP20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/NederlofPSW20, author = {Jesper Nederlof and Michal Pilipczuk and C{\'{e}}line M. F. Swennenhuis and Karol Wegrzycki}, editor = {Isolde Adler and Haiko M{\"{u}}ller}, title = {Hamiltonian Cycle Parameterized by Treedepth in Single Exponential Time and Polynomial Space}, booktitle = {Graph-Theoretic Concepts in Computer Science - 46th International Workshop, {WG} 2020, Leeds, UK, June 24-26, 2020, Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {12301}, pages = {27--39}, publisher = {Springer}, year = {2020}, url = {https://doi.org/10.1007/978-3-030-60440-0\_3}, doi = {10.1007/978-3-030-60440-0\_3}, timestamp = {Sat, 14 Nov 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/wg/NederlofPSW20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@proceedings{DBLP:conf/wg/2020, editor = {Isolde Adler and Haiko M{\"{u}}ller}, title = {Graph-Theoretic Concepts in Computer Science - 46th International Workshop, {WG} 2020, Leeds, UK, June 24-26, 2020, Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {12301}, publisher = {Springer}, year = {2020}, url = {https://doi.org/10.1007/978-3-030-60440-0}, doi = {10.1007/978-3-030-60440-0}, isbn = {978-3-030-60439-4}, timestamp = {Thu, 22 Oct 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/2020.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/AichholzerCHKMS19, author = {Oswin Aichholzer and Jean Cardinal and Tony Huynh and Kolja Knauer and Torsten M{\"{u}}tze and Raphael Steiner and Birgit Vogtenhuber}, editor = {Ignasi Sau and Dimitrios M. Thilikos}, title = {Flip Distances Between Graph Orientations}, booktitle = {Graph-Theoretic Concepts in Computer Science - 45th International Workshop, {WG} 2019, Vall de N{\'{u}}ria, Spain, June 19-21, 2019, Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {11789}, pages = {120--134}, publisher = {Springer}, year = {2019}, url = {https://doi.org/10.1007/978-3-030-30786-8\_10}, doi = {10.1007/978-3-030-30786-8\_10}, timestamp = {Tue, 29 Dec 2020 18:38:49 +0100}, biburl = {https://dblp.org/rec/conf/wg/AichholzerCHKMS19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/AlecuAL19, author = {Bogdan Alecu and Aistis Atminas and Vadim V. Lozin}, editor = {Ignasi Sau and Dimitrios M. Thilikos}, title = {Graph Functionality}, booktitle = {Graph-Theoretic Concepts in Computer Science - 45th International Workshop, {WG} 2019, Vall de N{\'{u}}ria, Spain, June 19-21, 2019, Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {11789}, pages = {135--147}, publisher = {Springer}, year = {2019}, url = {https://doi.org/10.1007/978-3-030-30786-8\_11}, doi = {10.1007/978-3-030-30786-8\_11}, timestamp = {Fri, 09 Apr 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/AlecuAL19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/AngeliniBGS19, author = {Patrizio Angelini and Michael A. Bekos and Martin Gronemann and Antonios Symvonis}, editor = {Ignasi Sau and Dimitrios M. Thilikos}, title = {Geometric Representations of Dichotomous Ordinal Data}, booktitle = {Graph-Theoretic Concepts in Computer Science - 45th International Workshop, {WG} 2019, Vall de N{\'{u}}ria, Spain, June 19-21, 2019, Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {11789}, pages = {205--217}, publisher = {Springer}, year = {2019}, url = {https://doi.org/10.1007/978-3-030-30786-8\_16}, doi = {10.1007/978-3-030-30786-8\_16}, timestamp = {Mon, 03 Jan 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/wg/AngeliniBGS19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/BamasE19, author = {{\'{E}}tienne Bamas and Louis Esperet}, editor = {Ignasi Sau and Dimitrios M. Thilikos}, title = {Local Approximation of the Maximum Cut in Regular Graphs}, booktitle = {Graph-Theoretic Concepts in Computer Science - 45th International Workshop, {WG} 2019, Vall de N{\'{u}}ria, Spain, June 19-21, 2019, Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {11789}, pages = {66--78}, publisher = {Springer}, year = {2019}, url = {https://doi.org/10.1007/978-3-030-30786-8\_6}, doi = {10.1007/978-3-030-30786-8\_6}, timestamp = {Mon, 23 Sep 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/BamasE19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/BelmonteHLOO19, author = {R{\'{e}}my Belmonte and Tesshu Hanaka and Michael Lampis and Hirotaka Ono and Yota Otachi}, editor = {Ignasi Sau and Dimitrios M. Thilikos}, title = {Independent Set Reconfiguration Parameterized by Modular-Width}, booktitle = {Graph-Theoretic Concepts in Computer Science - 45th International Workshop, {WG} 2019, Vall de N{\'{u}}ria, Spain, June 19-21, 2019, Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {11789}, pages = {285--297}, publisher = {Springer}, year = {2019}, url = {https://doi.org/10.1007/978-3-030-30786-8\_22}, doi = {10.1007/978-3-030-30786-8\_22}, timestamp = {Fri, 29 Dec 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/wg/BelmonteHLOO19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/BergeMRT19, author = {Pierre Berg{\'{e}} and Benjamin Mouscadet and Arpad Rimmel and Joanna Tomasik}, editor = {Ignasi Sau and Dimitrios M. Thilikos}, title = {Fixed-Parameter Tractability of Counting Small Minimum (S, T)-Cuts}, booktitle = {Graph-Theoretic Concepts in Computer Science - 45th International Workshop, {WG} 2019, Vall de N{\'{u}}ria, Spain, June 19-21, 2019, Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {11789}, pages = {79--92}, publisher = {Springer}, year = {2019}, url = {https://doi.org/10.1007/978-3-030-30786-8\_7}, doi = {10.1007/978-3-030-30786-8\_7}, timestamp = {Tue, 17 Sep 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/BergeMRT19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/BiedlBIJKL19, author = {Therese Biedl and Ahmad Biniaz and Veronika Irvine and Kshitij Jain and Philipp Kindermann and Anna Lubiw}, editor = {Ignasi Sau and Dimitrios M. Thilikos}, title = {Maximum Matchings and Minimum Blocking Sets in {\textbackslash}varTheta {\_}6 -Graphs}, booktitle = {Graph-Theoretic Concepts in Computer Science - 45th International Workshop, {WG} 2019, Vall de N{\'{u}}ria, Spain, June 19-21, 2019, Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {11789}, pages = {258--270}, publisher = {Springer}, year = {2019}, url = {https://doi.org/10.1007/978-3-030-30786-8\_20}, doi = {10.1007/978-3-030-30786-8\_20}, timestamp = {Sat, 30 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/BiedlBIJKL19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/BliznetsS19, author = {Ivan Bliznets and Danil Sagunov}, editor = {Ignasi Sau and Dimitrios M. Thilikos}, title = {On Happy Colorings, Cuts, and Structural Parameterizations}, booktitle = {Graph-Theoretic Concepts in Computer Science - 45th International Workshop, {WG} 2019, Vall de N{\'{u}}ria, Spain, June 19-21, 2019, Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {11789}, pages = {148--161}, publisher = {Springer}, year = {2019}, url = {https://doi.org/10.1007/978-3-030-30786-8\_12}, doi = {10.1007/978-3-030-30786-8\_12}, timestamp = {Fri, 27 Dec 2019 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/wg/BliznetsS19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/Boker19, author = {Jan B{\"{o}}ker}, editor = {Ignasi Sau and Dimitrios M. Thilikos}, title = {Color Refinement, Homomorphisms, and Hypergraphs}, booktitle = {Graph-Theoretic Concepts in Computer Science - 45th International Workshop, {WG} 2019, Vall de N{\'{u}}ria, Spain, June 19-21, 2019, Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {11789}, pages = {338--350}, publisher = {Springer}, year = {2019}, url = {https://doi.org/10.1007/978-3-030-30786-8\_26}, doi = {10.1007/978-3-030-30786-8\_26}, timestamp = {Mon, 23 Sep 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/Boker19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/BousquetHIM19, author = {Nicolas Bousquet and Tatsuhiko Hatanaka and Takehiro Ito and Moritz M{\"{u}}hlenthaler}, editor = {Ignasi Sau and Dimitrios M. Thilikos}, title = {Shortest Reconfiguration of Matchings}, booktitle = {Graph-Theoretic Concepts in Computer Science - 45th International Workshop, {WG} 2019, Vall de N{\'{u}}ria, Spain, June 19-21, 2019, Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {11789}, pages = {162--174}, publisher = {Springer}, year = {2019}, url = {https://doi.org/10.1007/978-3-030-30786-8\_13}, doi = {10.1007/978-3-030-30786-8\_13}, timestamp = {Sat, 05 Sep 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/BousquetHIM19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/Chakraborty0M19, author = {Dibyayan Chakraborty and Sandip Das and Joydeep Mukherjee}, editor = {Ignasi Sau and Dimitrios M. Thilikos}, title = {Approximating Minimum Dominating Set on String Graphs}, booktitle = {Graph-Theoretic Concepts in Computer Science - 45th International Workshop, {WG} 2019, Vall de N{\'{u}}ria, Spain, June 19-21, 2019, Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {11789}, pages = {232--243}, publisher = {Springer}, year = {2019}, url = {https://doi.org/10.1007/978-3-030-30786-8\_18}, doi = {10.1007/978-3-030-30786-8\_18}, timestamp = {Sat, 30 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/Chakraborty0M19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/Chaplick19, author = {Steven Chaplick}, editor = {Ignasi Sau and Dimitrios M. Thilikos}, title = {Intersection Graphs of Non-crossing Paths}, booktitle = {Graph-Theoretic Concepts in Computer Science - 45th International Workshop, {WG} 2019, Vall de N{\'{u}}ria, Spain, June 19-21, 2019, Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {11789}, pages = {311--324}, publisher = {Springer}, year = {2019}, url = {https://doi.org/10.1007/978-3-030-30786-8\_24}, doi = {10.1007/978-3-030-30786-8\_24}, timestamp = {Mon, 23 Sep 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/Chaplick19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/ChenCD19, author = {Hubie Chen and Radu Curticapean and Holger Dell}, editor = {Ignasi Sau and Dimitrios M. Thilikos}, title = {The Exponential-Time Complexity of Counting (Quantum) Graph Homomorphisms}, booktitle = {Graph-Theoretic Concepts in Computer Science - 45th International Workshop, {WG} 2019, Vall de N{\'{u}}ria, Spain, June 19-21, 2019, Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {11789}, pages = {364--378}, publisher = {Springer}, year = {2019}, url = {https://doi.org/10.1007/978-3-030-30786-8\_28}, doi = {10.1007/978-3-030-30786-8\_28}, timestamp = {Tue, 17 Sep 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/ChenCD19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/DisserFKK19, author = {Yann Disser and Andreas Emil Feldmann and Max Klimm and Jochen K{\"{o}}nemann}, editor = {Ignasi Sau and Dimitrios M. Thilikos}, title = {Travelling on Graphs with Small Highway Dimension}, booktitle = {Graph-Theoretic Concepts in Computer Science - 45th International Workshop, {WG} 2019, Vall de N{\'{u}}ria, Spain, June 19-21, 2019, Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {11789}, pages = {175--189}, publisher = {Springer}, year = {2019}, url = {https://doi.org/10.1007/978-3-030-30786-8\_14}, doi = {10.1007/978-3-030-30786-8\_14}, timestamp = {Tue, 21 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/wg/DisserFKK19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/DonkersJ19, author = {Huib Donkers and Bart M. P. Jansen}, editor = {Ignasi Sau and Dimitrios M. Thilikos}, title = {A Turing Kernelization Dichotomy for Structural Parameterizations of {\(\mathscr{F}\)} -Minor-Free Deletion}, booktitle = {Graph-Theoretic Concepts in Computer Science - 45th International Workshop, {WG} 2019, Vall de N{\'{u}}ria, Spain, June 19-21, 2019, Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {11789}, pages = {106--119}, publisher = {Springer}, year = {2019}, url = {https://doi.org/10.1007/978-3-030-30786-8\_9}, doi = {10.1007/978-3-030-30786-8\_9}, timestamp = {Mon, 23 Sep 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/DonkersJ19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/Ducoffe19, author = {Guillaume Ducoffe}, editor = {Ignasi Sau and Dimitrios M. Thilikos}, title = {The 4-Steiner Root Problem}, booktitle = {Graph-Theoretic Concepts in Computer Science - 45th International Workshop, {WG} 2019, Vall de N{\'{u}}ria, Spain, June 19-21, 2019, Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {11789}, pages = {14--26}, publisher = {Springer}, year = {2019}, url = {https://doi.org/10.1007/978-3-030-30786-8\_2}, doi = {10.1007/978-3-030-30786-8\_2}, timestamp = {Tue, 17 Sep 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/Ducoffe19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/DyerGM19, author = {Martin E. Dyer and Catherine S. Greenhill and Haiko M{\"{u}}ller}, editor = {Ignasi Sau and Dimitrios M. Thilikos}, title = {Counting Independent Sets in Graphs with Bounded Bipartite Pathwidth}, booktitle = {Graph-Theoretic Concepts in Computer Science - 45th International Workshop, {WG} 2019, Vall de N{\'{u}}ria, Spain, June 19-21, 2019, Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {11789}, pages = {298--310}, publisher = {Springer}, year = {2019}, url = {https://doi.org/10.1007/978-3-030-30786-8\_23}, doi = {10.1007/978-3-030-30786-8\_23}, timestamp = {Sun, 12 Nov 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/wg/DyerGM19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/GanianO19, author = {Robert Ganian and Sebastian Ordyniak}, editor = {Ignasi Sau and Dimitrios M. Thilikos}, title = {The Power of Cut-Based Parameters for Computing Edge Disjoint Paths}, booktitle = {Graph-Theoretic Concepts in Computer Science - 45th International Workshop, {WG} 2019, Vall de N{\'{u}}ria, Spain, June 19-21, 2019, Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {11789}, pages = {190--204}, publisher = {Springer}, year = {2019}, url = {https://doi.org/10.1007/978-3-030-30786-8\_15}, doi = {10.1007/978-3-030-30786-8\_15}, timestamp = {Tue, 17 Sep 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/GanianO19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/Goncalves19, author = {Daniel Gon{\c{c}}alves}, editor = {Ignasi Sau and Dimitrios M. Thilikos}, title = {3-Colorable Planar Graphs Have an Intersection Segment Representation Using 3 Slopes}, booktitle = {Graph-Theoretic Concepts in Computer Science - 45th International Workshop, {WG} 2019, Vall de N{\'{u}}ria, Spain, June 19-21, 2019, Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {11789}, pages = {351--363}, publisher = {Springer}, year = {2019}, url = {https://doi.org/10.1007/978-3-030-30786-8\_27}, doi = {10.1007/978-3-030-30786-8\_27}, timestamp = {Sat, 30 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/Goncalves19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/Hagerup19, author = {Torben Hagerup}, editor = {Ignasi Sau and Dimitrios M. Thilikos}, title = {Fast Breadth-First Search in Still Less Space}, booktitle = {Graph-Theoretic Concepts in Computer Science - 45th International Workshop, {WG} 2019, Vall de N{\'{u}}ria, Spain, June 19-21, 2019, Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {11789}, pages = {93--105}, publisher = {Springer}, year = {2019}, url = {https://doi.org/10.1007/978-3-030-30786-8\_8}, doi = {10.1007/978-3-030-30786-8\_8}, timestamp = {Mon, 23 Sep 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/Hagerup19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/HarutyunyanLLM19, author = {Ararat Harutyunyan and Michael Lampis and Vadim V. Lozin and J{\'{e}}r{\^{o}}me Monnot}, editor = {Ignasi Sau and Dimitrios M. Thilikos}, title = {Maximum Independent Sets in Subcubic Graphs: New Results}, booktitle = {Graph-Theoretic Concepts in Computer Science - 45th International Workshop, {WG} 2019, Vall de N{\'{u}}ria, Spain, June 19-21, 2019, Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {11789}, pages = {40--52}, publisher = {Springer}, year = {2019}, url = {https://doi.org/10.1007/978-3-030-30786-8\_4}, doi = {10.1007/978-3-030-30786-8\_4}, timestamp = {Tue, 17 Sep 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/HarutyunyanLLM19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/HatzelRW19, author = {Meike Hatzel and Roman Rabinovich and Sebastian Wiederrecht}, editor = {Ignasi Sau and Dimitrios M. Thilikos}, title = {Cyclewidth and the Grid Theorem for Perfect Matching Width of Bipartite Graphs}, booktitle = {Graph-Theoretic Concepts in Computer Science - 45th International Workshop, {WG} 2019, Vall de N{\'{u}}ria, Spain, June 19-21, 2019, Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {11789}, pages = {53--65}, publisher = {Springer}, year = {2019}, url = {https://doi.org/10.1007/978-3-030-30786-8\_5}, doi = {10.1007/978-3-030-30786-8\_5}, timestamp = {Mon, 05 Feb 2024 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/wg/HatzelRW19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/HogemoTV19, author = {Svein H{\o}gemo and Jan Arne Telle and Erlend Raa V{\aa}gset}, editor = {Ignasi Sau and Dimitrios M. Thilikos}, title = {Linear MIM-Width of Trees}, booktitle = {Graph-Theoretic Concepts in Computer Science - 45th International Workshop, {WG} 2019, Vall de N{\'{u}}ria, Spain, June 19-21, 2019, Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {11789}, pages = {218--231}, publisher = {Springer}, year = {2019}, url = {https://doi.org/10.1007/978-3-030-30786-8\_17}, doi = {10.1007/978-3-030-30786-8\_17}, timestamp = {Sun, 02 Oct 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/HogemoTV19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/HusicM19, author = {Edin Husic and Martin Milanic}, editor = {Ignasi Sau and Dimitrios M. Thilikos}, title = {A Polynomial-Time Algorithm for the Independent Set Problem in P{\_}10, C{\_}4, C{\_}6 -Free Graphs}, booktitle = {Graph-Theoretic Concepts in Computer Science - 45th International Workshop, {WG} 2019, Vall de N{\'{u}}ria, Spain, June 19-21, 2019, Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {11789}, pages = {271--284}, publisher = {Springer}, year = {2019}, url = {https://doi.org/10.1007/978-3-030-30786-8\_21}, doi = {10.1007/978-3-030-30786-8\_21}, timestamp = {Thu, 14 Oct 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/HusicM19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/Jansen0N19, author = {Bart M. P. Jansen and L{\'{a}}szl{\'{o}} Kozma and Jesper Nederlof}, editor = {Ignasi Sau and Dimitrios M. Thilikos}, title = {Hamiltonicity Below Dirac's Condition}, booktitle = {Graph-Theoretic Concepts in Computer Science - 45th International Workshop, {WG} 2019, Vall de N{\'{u}}ria, Spain, June 19-21, 2019, Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {11789}, pages = {27--39}, publisher = {Springer}, year = {2019}, url = {https://doi.org/10.1007/978-3-030-30786-8\_3}, doi = {10.1007/978-3-030-30786-8\_3}, timestamp = {Sat, 30 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/Jansen0N19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/MilanicP19, author = {Martin Milanic and Nevena Pivac}, editor = {Ignasi Sau and Dimitrios M. Thilikos}, title = {Minimal Separators in Graph Classes Defined by Small Forbidden Induced Subgraphs}, booktitle = {Graph-Theoretic Concepts in Computer Science - 45th International Workshop, {WG} 2019, Vall de N{\'{u}}ria, Spain, June 19-21, 2019, Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {11789}, pages = {379--391}, publisher = {Springer}, year = {2019}, url = {https://doi.org/10.1007/978-3-030-30786-8\_29}, doi = {10.1007/978-3-030-30786-8\_29}, timestamp = {Tue, 17 Sep 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/MilanicP19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/NasreNP19, author = {Meghana Nasre and Prajakta Nimbhorkar and Nada Pulath}, editor = {Ignasi Sau and Dimitrios M. Thilikos}, title = {Classified Rank-Maximal Matchings and Popular Matchings - Algorithms and Hardness}, booktitle = {Graph-Theoretic Concepts in Computer Science - 45th International Workshop, {WG} 2019, Vall de N{\'{u}}ria, Spain, June 19-21, 2019, Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {11789}, pages = {244--257}, publisher = {Springer}, year = {2019}, url = {https://doi.org/10.1007/978-3-030-30786-8\_19}, doi = {10.1007/978-3-030-30786-8\_19}, timestamp = {Mon, 03 Jan 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/wg/NasreNP19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/NishatW19, author = {Rahnuma Islam Nishat and Sue Whitesides}, editor = {Ignasi Sau and Dimitrios M. Thilikos}, title = {Reconfiguring Hamiltonian Cycles in L-Shaped Grid Graphs}, booktitle = {Graph-Theoretic Concepts in Computer Science - 45th International Workshop, {WG} 2019, Vall de N{\'{u}}ria, Spain, June 19-21, 2019, Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {11789}, pages = {325--337}, publisher = {Springer}, year = {2019}, url = {https://doi.org/10.1007/978-3-030-30786-8\_25}, doi = {10.1007/978-3-030-30786-8\_25}, timestamp = {Sun, 02 Oct 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/NishatW19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/OkrasaR19, author = {Karolina Okrasa and Pawel Rzazewski}, editor = {Ignasi Sau and Dimitrios M. Thilikos}, title = {Subexponential Algorithms for Variants of Homomorphism Problem in String Graphs}, booktitle = {Graph-Theoretic Concepts in Computer Science - 45th International Workshop, {WG} 2019, Vall de N{\'{u}}ria, Spain, June 19-21, 2019, Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {11789}, pages = {1--13}, publisher = {Springer}, year = {2019}, url = {https://doi.org/10.1007/978-3-030-30786-8\_1}, doi = {10.1007/978-3-030-30786-8\_1}, timestamp = {Mon, 03 Jan 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/wg/OkrasaR19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@proceedings{DBLP:conf/wg/2019, editor = {Ignasi Sau and Dimitrios M. Thilikos}, title = {Graph-Theoretic Concepts in Computer Science - 45th International Workshop, {WG} 2019, Vall de N{\'{u}}ria, Spain, June 19-21, 2019, Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {11789}, publisher = {Springer}, year = {2019}, url = {https://doi.org/10.1007/978-3-030-30786-8}, doi = {10.1007/978-3-030-30786-8}, isbn = {978-3-030-30785-1}, timestamp = {Tue, 29 Dec 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/wg/2019.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/0002PP18, author = {Matthew Johnson and Giacomo Paesani and Dani{\"{e}}l Paulusma}, editor = {Andreas Brandst{\"{a}}dt and Ekkehard K{\"{o}}hler and Klaus Meer}, title = {Connected Vertex Cover for (sP{\_}1+P{\_}5) {(} s {P} 1 + {P} 5 {)} -Free Graphs}, booktitle = {Graph-Theoretic Concepts in Computer Science - 44th International Workshop, {WG} 2018, Cottbus, Germany, June 27-29, 2018, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {11159}, pages = {279--291}, publisher = {Springer}, year = {2018}, url = {https://doi.org/10.1007/978-3-030-00256-5\_23}, doi = {10.1007/978-3-030-00256-5\_23}, timestamp = {Tue, 07 May 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/0002PP18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/AlamBG0P18, author = {Jawaherul Md. Alam and Michael A. Bekos and Martin Gronemann and Michael Kaufmann and Sergey Pupyrev}, editor = {Andreas Brandst{\"{a}}dt and Ekkehard K{\"{o}}hler and Klaus Meer}, title = {On Dispersable Book Embeddings}, booktitle = {Graph-Theoretic Concepts in Computer Science - 44th International Workshop, {WG} 2018, Cottbus, Germany, June 27-29, 2018, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {11159}, pages = {1--14}, publisher = {Springer}, year = {2018}, url = {https://doi.org/10.1007/978-3-030-00256-5\_1}, doi = {10.1007/978-3-030-00256-5\_1}, timestamp = {Mon, 03 Sep 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/AlamBG0P18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/Beisegel18, author = {Jesse Beisegel}, editor = {Andreas Brandst{\"{a}}dt and Ekkehard K{\"{o}}hler and Klaus Meer}, title = {Characterising AT-free Graphs with {BFS}}, booktitle = {Graph-Theoretic Concepts in Computer Science - 44th International Workshop, {WG} 2018, Cottbus, Germany, June 27-29, 2018, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {11159}, pages = {15--26}, publisher = {Springer}, year = {2018}, url = {https://doi.org/10.1007/978-3-030-00256-5\_2}, doi = {10.1007/978-3-030-00256-5\_2}, timestamp = {Mon, 03 Sep 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/Beisegel18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/BekosGDLMR18, author = {Michael A. Bekos and Emilio Di Giacomo and Walter Didimo and Giuseppe Liotta and Fabrizio Montecchiani and Chrysanthi N. Raftopoulou}, editor = {Andreas Brandst{\"{a}}dt and Ekkehard K{\"{o}}hler and Klaus Meer}, title = {Edge Partitions of Optimal 2-plane and 3-plane Graphs}, booktitle = {Graph-Theoretic Concepts in Computer Science - 44th International Workshop, {WG} 2018, Cottbus, Germany, June 27-29, 2018, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {11159}, pages = {27--39}, publisher = {Springer}, year = {2018}, url = {https://doi.org/10.1007/978-3-030-00256-5\_3}, doi = {10.1007/978-3-030-00256-5\_3}, timestamp = {Thu, 14 Oct 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/BekosGDLMR18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/BellittoB18, author = {Thomas Bellitto and Benjamin Bergougnoux}, editor = {Andreas Brandst{\"{a}}dt and Ekkehard K{\"{o}}hler and Klaus Meer}, title = {On Minimum Connecting Transition Sets in Graphs}, booktitle = {Graph-Theoretic Concepts in Computer Science - 44th International Workshop, {WG} 2018, Cottbus, Germany, June 27-29, 2018, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {11159}, pages = {40--51}, publisher = {Springer}, year = {2018}, url = {https://doi.org/10.1007/978-3-030-00256-5\_4}, doi = {10.1007/978-3-030-00256-5\_4}, timestamp = {Mon, 03 Sep 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/BellittoB18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/BodewesBCW18, author = {Jelco M. Bodewes and Hans L. Bodlaender and Gunther Cornelissen and Marieke van der Wegen}, editor = {Andreas Brandst{\"{a}}dt and Ekkehard K{\"{o}}hler and Klaus Meer}, title = {Recognizing Hyperelliptic Graphs in Polynomial Time}, booktitle = {Graph-Theoretic Concepts in Computer Science - 44th International Workshop, {WG} 2018, Cottbus, Germany, June 27-29, 2018, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {11159}, pages = {52--64}, publisher = {Springer}, year = {2018}, url = {https://doi.org/10.1007/978-3-030-00256-5\_5}, doi = {10.1007/978-3-030-00256-5\_5}, timestamp = {Mon, 16 Sep 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/BodewesBCW18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/BonamyKNPSW18, author = {Marthe Bonamy and Lukasz Kowalik and Jesper Nederlof and Michal Pilipczuk and Arkadiusz Socala and Marcin Wrochna}, editor = {Andreas Brandst{\"{a}}dt and Ekkehard K{\"{o}}hler and Klaus Meer}, title = {On Directed Feedback Vertex Set Parameterized by Treewidth}, booktitle = {Graph-Theoretic Concepts in Computer Science - 44th International Workshop, {WG} 2018, Cottbus, Germany, June 27-29, 2018, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {11159}, pages = {65--78}, publisher = {Springer}, year = {2018}, url = {https://doi.org/10.1007/978-3-030-00256-5\_6}, doi = {10.1007/978-3-030-00256-5\_6}, timestamp = {Mon, 03 Jan 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/wg/BonamyKNPSW18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/BonnetR18, author = {{\'{E}}douard Bonnet and Pawel Rzazewski}, editor = {Andreas Brandst{\"{a}}dt and Ekkehard K{\"{o}}hler and Klaus Meer}, title = {Optimality Program in Segment and String Graphs}, booktitle = {Graph-Theoretic Concepts in Computer Science - 44th International Workshop, {WG} 2018, Cottbus, Germany, June 27-29, 2018, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {11159}, pages = {79--90}, publisher = {Springer}, year = {2018}, url = {https://doi.org/10.1007/978-3-030-00256-5\_7}, doi = {10.1007/978-3-030-00256-5\_7}, timestamp = {Mon, 16 Sep 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/BonnetR18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/CarmiDM18, author = {Paz Carmi and Vida Dujmovic and Pat Morin}, editor = {Andreas Brandst{\"{a}}dt and Ekkehard K{\"{o}}hler and Klaus Meer}, title = {Anagram-Free Chromatic Number Is Not Pathwidth-Bounded}, booktitle = {Graph-Theoretic Concepts in Computer Science - 44th International Workshop, {WG} 2018, Cottbus, Germany, June 27-29, 2018, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {11159}, pages = {91--99}, publisher = {Springer}, year = {2018}, url = {https://doi.org/10.1007/978-3-030-00256-5\_8}, doi = {10.1007/978-3-030-00256-5\_8}, timestamp = {Sun, 25 Jul 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/CarmiDM18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/ConteGMRUV18, author = {Alessio Conte and Roberto Grossi and Andrea Marino and Romeo Rizzi and Takeaki Uno and Luca Versari}, editor = {Andreas Brandst{\"{a}}dt and Ekkehard K{\"{o}}hler and Klaus Meer}, title = {Tight Lower Bounds for the Number of Inclusion-Minimal st-Cuts}, booktitle = {Graph-Theoretic Concepts in Computer Science - 44th International Workshop, {WG} 2018, Cottbus, Germany, June 27-29, 2018, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {11159}, pages = {100--110}, publisher = {Springer}, year = {2018}, url = {https://doi.org/10.1007/978-3-030-00256-5\_9}, doi = {10.1007/978-3-030-00256-5\_9}, timestamp = {Sun, 18 Jun 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/ConteGMRUV18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/DabrowskiDJKKOP18, author = {Konrad K. Dabrowski and Fran{\c{c}}ois Dross and Jisu Jeong and Mamadou Moustapha Kant{\'{e}} and O{-}joung Kwon and Sang{-}il Oum and Dani{\"{e}}l Paulusma}, editor = {Andreas Brandst{\"{a}}dt and Ekkehard K{\"{o}}hler and Klaus Meer}, title = {Computing Small Pivot-Minors}, booktitle = {Graph-Theoretic Concepts in Computer Science - 44th International Workshop, {WG} 2018, Cottbus, Germany, June 27-29, 2018, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {11159}, pages = {125--138}, publisher = {Springer}, year = {2018}, url = {https://doi.org/10.1007/978-3-030-00256-5\_11}, doi = {10.1007/978-3-030-00256-5\_11}, timestamp = {Thu, 13 Sep 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/DabrowskiDJKKOP18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/Damaschke18, author = {Peter Damaschke}, editor = {Andreas Brandst{\"{a}}dt and Ekkehard K{\"{o}}hler and Klaus Meer}, title = {Saving Probe Bits by Cube Domination}, booktitle = {Graph-Theoretic Concepts in Computer Science - 44th International Workshop, {WG} 2018, Cottbus, Germany, June 27-29, 2018, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {11159}, pages = {139--151}, publisher = {Springer}, year = {2018}, url = {https://doi.org/10.1007/978-3-030-00256-5\_12}, doi = {10.1007/978-3-030-00256-5\_12}, timestamp = {Mon, 03 Sep 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/Damaschke18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/DobbinsKMR18, author = {Michael Gene Dobbins and Linda Kleist and Tillmann Miltzow and Pawel Rzazewski}, editor = {Andreas Brandst{\"{a}}dt and Ekkehard K{\"{o}}hler and Klaus Meer}, title = {{\(\forall\)}{\(\exists\)}{\(\mathbb{R}\)}-Completeness and Area-Universality}, booktitle = {Graph-Theoretic Concepts in Computer Science - 44th International Workshop, {WG} 2018, Cottbus, Germany, June 27-29, 2018, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {11159}, pages = {164--175}, publisher = {Springer}, year = {2018}, url = {https://doi.org/10.1007/978-3-030-00256-5\_14}, doi = {10.1007/978-3-030-00256-5\_14}, timestamp = {Mon, 03 Jan 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/wg/DobbinsKMR18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/DudyczP18, author = {Szymon Dudycz and Katarzyna Paluch}, editor = {Andreas Brandst{\"{a}}dt and Ekkehard K{\"{o}}hler and Klaus Meer}, title = {Optimal General Matchings}, booktitle = {Graph-Theoretic Concepts in Computer Science - 44th International Workshop, {WG} 2018, Cottbus, Germany, June 27-29, 2018, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {11159}, pages = {176--189}, publisher = {Springer}, year = {2018}, url = {https://doi.org/10.1007/978-3-030-00256-5\_15}, doi = {10.1007/978-3-030-00256-5\_15}, timestamp = {Thu, 20 May 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/DudyczP18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/DyerM18, author = {Martin E. Dyer and Haiko M{\"{u}}ller}, editor = {Andreas Brandst{\"{a}}dt and Ekkehard K{\"{o}}hler and Klaus Meer}, title = {Quasimonotone Graphs}, booktitle = {Graph-Theoretic Concepts in Computer Science - 44th International Workshop, {WG} 2018, Cottbus, Germany, June 27-29, 2018, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {11159}, pages = {190--202}, publisher = {Springer}, year = {2018}, url = {https://doi.org/10.1007/978-3-030-00256-5\_16}, doi = {10.1007/978-3-030-00256-5\_16}, timestamp = {Sun, 12 Nov 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/wg/DyerM18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/FelsnerSS18, author = {Stefan Felsner and Hendrik Schrezenmaier and Raphael Steiner}, editor = {Andreas Brandst{\"{a}}dt and Ekkehard K{\"{o}}hler and Klaus Meer}, title = {Equiangular Polygon Contact Representations}, booktitle = {Graph-Theoretic Concepts in Computer Science - 44th International Workshop, {WG} 2018, Cottbus, Germany, June 27-29, 2018, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {11159}, pages = {203--215}, publisher = {Springer}, year = {2018}, url = {https://doi.org/10.1007/978-3-030-00256-5\_17}, doi = {10.1007/978-3-030-00256-5\_17}, timestamp = {Sun, 02 Oct 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/FelsnerSS18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/FluschnikMNZ18, author = {Till Fluschnik and Hendrik Molter and Rolf Niedermeier and Philipp Zschoche}, editor = {Andreas Brandst{\"{a}}dt and Ekkehard K{\"{o}}hler and Klaus Meer}, title = {Temporal Graph Classes: {A} View Through Temporal Separators}, booktitle = {Graph-Theoretic Concepts in Computer Science - 44th International Workshop, {WG} 2018, Cottbus, Germany, June 27-29, 2018, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {11159}, pages = {216--227}, publisher = {Springer}, year = {2018}, url = {https://doi.org/10.1007/978-3-030-00256-5\_18}, doi = {10.1007/978-3-030-00256-5\_18}, timestamp = {Mon, 03 Sep 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/FluschnikMNZ18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/GomezW18, author = {Renzo G{\'{o}}mez and Yoshiko Wakabayashi}, editor = {Andreas Brandst{\"{a}}dt and Ekkehard K{\"{o}}hler and Klaus Meer}, title = {Covering a Graph with Nontrivial Vertex-Disjoint Paths: Existence and Optimization}, booktitle = {Graph-Theoretic Concepts in Computer Science - 44th International Workshop, {WG} 2018, Cottbus, Germany, June 27-29, 2018, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {11159}, pages = {228--238}, publisher = {Springer}, year = {2018}, url = {https://doi.org/10.1007/978-3-030-00256-5\_19}, doi = {10.1007/978-3-030-00256-5\_19}, timestamp = {Thu, 13 Sep 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/GomezW18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/GruttemeierK18, author = {Niels Gr{\"{u}}ttemeier and Christian Komusiewicz}, editor = {Andreas Brandst{\"{a}}dt and Ekkehard K{\"{o}}hler and Klaus Meer}, title = {On the Relation of Strong Triadic Closure and Cluster Deletion}, booktitle = {Graph-Theoretic Concepts in Computer Science - 44th International Workshop, {WG} 2018, Cottbus, Germany, June 27-29, 2018, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {11159}, pages = {239--251}, publisher = {Springer}, year = {2018}, url = {https://doi.org/10.1007/978-3-030-00256-5\_20}, doi = {10.1007/978-3-030-00256-5\_20}, timestamp = {Mon, 03 Sep 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/GruttemeierK18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/HatzelW18, author = {Meike Hatzel and Sebastian Wiederrecht}, editor = {Andreas Brandst{\"{a}}dt and Ekkehard K{\"{o}}hler and Klaus Meer}, title = {On Perfect Linegraph Squares}, booktitle = {Graph-Theoretic Concepts in Computer Science - 44th International Workshop, {WG} 2018, Cottbus, Germany, June 27-29, 2018, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {11159}, pages = {252--265}, publisher = {Springer}, year = {2018}, url = {https://doi.org/10.1007/978-3-030-00256-5\_21}, doi = {10.1007/978-3-030-00256-5\_21}, timestamp = {Mon, 05 Feb 2024 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/wg/HatzelW18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/JaffkeO18, author = {Lars Jaffke and Mateus de Oliveira Oliveira}, editor = {Andreas Brandst{\"{a}}dt and Ekkehard K{\"{o}}hler and Klaus Meer}, title = {On Weak Isomorphism of Rooted Vertex-Colored Graphs}, booktitle = {Graph-Theoretic Concepts in Computer Science - 44th International Workshop, {WG} 2018, Cottbus, Germany, June 27-29, 2018, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {11159}, pages = {266--278}, publisher = {Springer}, year = {2018}, url = {https://doi.org/10.1007/978-3-030-00256-5\_22}, doi = {10.1007/978-3-030-00256-5\_22}, timestamp = {Thu, 13 Sep 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/JaffkeO18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/KatsikarelisLP18, author = {Ioannis Katsikarelis and Michael Lampis and Vangelis Th. Paschos}, editor = {Andreas Brandst{\"{a}}dt and Ekkehard K{\"{o}}hler and Klaus Meer}, title = {Structurally Parameterized d-Scattered Set}, booktitle = {Graph-Theoretic Concepts in Computer Science - 44th International Workshop, {WG} 2018, Cottbus, Germany, June 27-29, 2018, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {11159}, pages = {292--305}, publisher = {Springer}, year = {2018}, url = {https://doi.org/10.1007/978-3-030-00256-5\_24}, doi = {10.1007/978-3-030-00256-5\_24}, timestamp = {Mon, 03 Sep 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/KatsikarelisLP18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/Kavitha18, author = {Telikepalli Kavitha}, editor = {Andreas Brandst{\"{a}}dt and Ekkehard K{\"{o}}hler and Klaus Meer}, title = {Popular Matchings of Desired Size}, booktitle = {Graph-Theoretic Concepts in Computer Science - 44th International Workshop, {WG} 2018, Cottbus, Germany, June 27-29, 2018, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {11159}, pages = {306--317}, publisher = {Springer}, year = {2018}, url = {https://doi.org/10.1007/978-3-030-00256-5\_25}, doi = {10.1007/978-3-030-00256-5\_25}, timestamp = {Mon, 03 Sep 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/Kavitha18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/KleistKLSSS18, author = {Linda Kleist and Boris Klemz and Anna Lubiw and Lena Schlipf and Frank Staals and Darren Strash}, editor = {Andreas Brandst{\"{a}}dt and Ekkehard K{\"{o}}hler and Klaus Meer}, title = {Convexity-Increasing Morphs of Planar Graphs}, booktitle = {Graph-Theoretic Concepts in Computer Science - 44th International Workshop, {WG} 2018, Cottbus, Germany, June 27-29, 2018, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {11159}, pages = {318--330}, publisher = {Springer}, year = {2018}, url = {https://doi.org/10.1007/978-3-030-00256-5\_26}, doi = {10.1007/978-3-030-00256-5\_26}, timestamp = {Mon, 03 Jan 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/wg/KleistKLSSS18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/KunOS18, author = {Jeremy Kun and Michael P. O'Brien and Blair D. Sullivan}, editor = {Andreas Brandst{\"{a}}dt and Ekkehard K{\"{o}}hler and Klaus Meer}, title = {Treedepth Bounds in Linear Colorings}, booktitle = {Graph-Theoretic Concepts in Computer Science - 44th International Workshop, {WG} 2018, Cottbus, Germany, June 27-29, 2018, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {11159}, pages = {331--343}, publisher = {Springer}, year = {2018}, url = {https://doi.org/10.1007/978-3-030-00256-5\_27}, doi = {10.1007/978-3-030-00256-5\_27}, timestamp = {Fri, 27 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/wg/KunOS18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/LiP18, author = {Shaohua Li and Marcin Pilipczuk}, editor = {Andreas Brandst{\"{a}}dt and Ekkehard K{\"{o}}hler and Klaus Meer}, title = {An Improved {FPT} Algorithm for Independent Feedback Vertex Set}, booktitle = {Graph-Theoretic Concepts in Computer Science - 44th International Workshop, {WG} 2018, Cottbus, Germany, June 27-29, 2018, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {11159}, pages = {344--355}, publisher = {Springer}, year = {2018}, url = {https://doi.org/10.1007/978-3-030-00256-5\_28}, doi = {10.1007/978-3-030-00256-5\_28}, timestamp = {Mon, 05 Feb 2024 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/wg/LiP18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/LozzoEG018, author = {Giordano Da Lozzo and David Eppstein and Michael T. Goodrich and Siddharth Gupta}, editor = {Andreas Brandst{\"{a}}dt and Ekkehard K{\"{o}}hler and Klaus Meer}, title = {Subexponential-Time and {FPT} Algorithms for Embedded Flat Clustered Planarity}, booktitle = {Graph-Theoretic Concepts in Computer Science - 44th International Workshop, {WG} 2018, Cottbus, Germany, June 27-29, 2018, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {11159}, pages = {111--124}, publisher = {Springer}, year = {2018}, url = {https://doi.org/10.1007/978-3-030-00256-5\_10}, doi = {10.1007/978-3-030-00256-5\_10}, timestamp = {Wed, 25 Sep 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/LozzoEG018.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/LubiwM18, author = {Anna Lubiw and Debajyoti Mondal}, editor = {Andreas Brandst{\"{a}}dt and Ekkehard K{\"{o}}hler and Klaus Meer}, title = {Construction and Local Routing for Angle-Monotone Graphs}, booktitle = {Graph-Theoretic Concepts in Computer Science - 44th International Workshop, {WG} 2018, Cottbus, Germany, June 27-29, 2018, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {11159}, pages = {356--368}, publisher = {Springer}, year = {2018}, url = {https://doi.org/10.1007/978-3-030-00256-5\_29}, doi = {10.1007/978-3-030-00256-5\_29}, timestamp = {Mon, 03 Sep 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/LubiwM18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/Oliveira18, author = {Mateus de Oliveira Oliveira}, editor = {Andreas Brandst{\"{a}}dt and Ekkehard K{\"{o}}hler and Klaus Meer}, title = {Graph Amalgamation Under Logical Constraints}, booktitle = {Graph-Theoretic Concepts in Computer Science - 44th International Workshop, {WG} 2018, Cottbus, Germany, June 27-29, 2018, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {11159}, pages = {152--163}, publisher = {Springer}, year = {2018}, url = {https://doi.org/10.1007/978-3-030-00256-5\_13}, doi = {10.1007/978-3-030-00256-5\_13}, timestamp = {Mon, 03 Sep 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/Oliveira18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/Panda018, author = {B. S. Panda and Anita Das}, editor = {Andreas Brandst{\"{a}}dt and Ekkehard K{\"{o}}hler and Klaus Meer}, title = {Characterization and Recognition of Tree 3-Spanner Admissible Directed Path Graphs of Diameter Three}, booktitle = {Graph-Theoretic Concepts in Computer Science - 44th International Workshop, {WG} 2018, Cottbus, Germany, June 27-29, 2018, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {11159}, pages = {369--381}, publisher = {Springer}, year = {2018}, url = {https://doi.org/10.1007/978-3-030-00256-5\_30}, doi = {10.1007/978-3-030-00256-5\_30}, timestamp = {Sun, 06 Oct 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/Panda018.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@proceedings{DBLP:conf/wg/2018, editor = {Andreas Brandst{\"{a}}dt and Ekkehard K{\"{o}}hler and Klaus Meer}, title = {Graph-Theoretic Concepts in Computer Science - 44th International Workshop, {WG} 2018, Cottbus, Germany, June 27-29, 2018, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {11159}, publisher = {Springer}, year = {2018}, url = {https://doi.org/10.1007/978-3-030-00256-5}, doi = {10.1007/978-3-030-00256-5}, isbn = {978-3-030-00255-8}, timestamp = {Tue, 14 May 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/2018.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/AcunaGILRSSS17, author = {Vicente Acu{\~{n}}a and Roberto Grossi and Giuseppe F. Italiano and Leandro Lima and Romeo Rizzi and Gustavo Sacomoto and Marie{-}France Sagot and Blerina Sinaimeri}, editor = {Hans L. Bodlaender and Gerhard J. Woeginger}, title = {On Bubble Generators in Directed Graphs}, booktitle = {Graph-Theoretic Concepts in Computer Science - 43rd International Workshop, {WG} 2017, Eindhoven, The Netherlands, June 21-23, 2017, Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {10520}, pages = {18--31}, publisher = {Springer}, year = {2017}, url = {https://doi.org/10.1007/978-3-319-68705-6\_2}, doi = {10.1007/978-3-319-68705-6\_2}, timestamp = {Sat, 05 Sep 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/AcunaGILRSSS17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/AgrawalLM17, author = {Akanksha Agrawal and Daniel Lokshtanov and Amer E. Mouawad}, editor = {Hans L. Bodlaender and Gerhard J. Woeginger}, title = {Critical Node Cut Parameterized by Treewidth and Solution Size is W[1]-Hard}, booktitle = {Graph-Theoretic Concepts in Computer Science - 43rd International Workshop, {WG} 2017, Eindhoven, The Netherlands, June 21-23, 2017, Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {10520}, pages = {32--44}, publisher = {Springer}, year = {2017}, url = {https://doi.org/10.1007/978-3-319-68705-6\_3}, doi = {10.1007/978-3-319-68705-6\_3}, timestamp = {Tue, 02 Jan 2024 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/wg/AgrawalLM17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/AngeliniB17, author = {Patrizio Angelini and Michael A. Bekos}, editor = {Hans L. Bodlaender and Gerhard J. Woeginger}, title = {Hierarchical Partial Planarity}, booktitle = {Graph-Theoretic Concepts in Computer Science - 43rd International Workshop, {WG} 2017, Eindhoven, The Netherlands, June 21-23, 2017, Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {10520}, pages = {45--58}, publisher = {Springer}, year = {2017}, url = {https://doi.org/10.1007/978-3-319-68705-6\_4}, doi = {10.1007/978-3-319-68705-6\_4}, timestamp = {Fri, 02 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/wg/AngeliniB17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/AngeliniBBLBDLM17, author = {Patrizio Angelini and Michael A. Bekos and Franz J. Brandenburg and Giordano Da Lozzo and Giuseppe Di Battista and Walter Didimo and Giuseppe Liotta and Fabrizio Montecchiani and Ignaz Rutter}, editor = {Hans L. Bodlaender and Gerhard J. Woeginger}, title = {On the Relationship Between k-Planar and k-Quasi-Planar Graphs}, booktitle = {Graph-Theoretic Concepts in Computer Science - 43rd International Workshop, {WG} 2017, Eindhoven, The Netherlands, June 21-23, 2017, Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {10520}, pages = {59--74}, publisher = {Springer}, year = {2017}, url = {https://doi.org/10.1007/978-3-319-68705-6\_5}, doi = {10.1007/978-3-319-68705-6\_5}, timestamp = {Sat, 19 Oct 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/AngeliniBBLBDLM17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/AprileFFHM17, author = {Manuel Aprile and Yuri Faenza and Samuel Fiorini and Tony Huynh and Marco Macchia}, editor = {Hans L. Bodlaender and Gerhard J. Woeginger}, title = {Extension Complexity of Stable Set Polytopes of Bipartite Graphs}, booktitle = {Graph-Theoretic Concepts in Computer Science - 43rd International Workshop, {WG} 2017, Eindhoven, The Netherlands, June 21-23, 2017, Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {10520}, pages = {75--87}, publisher = {Springer}, year = {2017}, url = {https://doi.org/10.1007/978-3-319-68705-6\_6}, doi = {10.1007/978-3-319-68705-6\_6}, timestamp = {Fri, 09 Apr 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/AprileFFHM17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/BasteNS17, author = {Julien Baste and Marc Noy and Ignasi Sau}, editor = {Hans L. Bodlaender and Gerhard J. Woeginger}, title = {On the Number of Labeled Graphs of Bounded Treewidth}, booktitle = {Graph-Theoretic Concepts in Computer Science - 43rd International Workshop, {WG} 2017, Eindhoven, The Netherlands, June 21-23, 2017, Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {10520}, pages = {88--99}, publisher = {Springer}, year = {2017}, url = {https://doi.org/10.1007/978-3-319-68705-6\_7}, doi = {10.1007/978-3-319-68705-6\_7}, timestamp = {Sat, 09 Apr 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/BasteNS17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/BasteRS17, author = {Julien Baste and Dieter Rautenbach and Ignasi Sau}, editor = {Hans L. Bodlaender and Gerhard J. Woeginger}, title = {Uniquely Restricted Matchings and Edge Colorings}, booktitle = {Graph-Theoretic Concepts in Computer Science - 43rd International Workshop, {WG} 2017, Eindhoven, The Netherlands, June 21-23, 2017, Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {10520}, pages = {100--112}, publisher = {Springer}, year = {2017}, url = {https://doi.org/10.1007/978-3-319-68705-6\_8}, doi = {10.1007/978-3-319-68705-6\_8}, timestamp = {Sat, 09 Apr 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/BasteRS17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/BelmonteLM17, author = {R{\'{e}}my Belmonte and Michael Lampis and Valia Mitsou}, editor = {Hans L. Bodlaender and Gerhard J. Woeginger}, title = {Defective Coloring on Classes of Perfect Graphs}, booktitle = {Graph-Theoretic Concepts in Computer Science - 43rd International Workshop, {WG} 2017, Eindhoven, The Netherlands, June 21-23, 2017, Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {10520}, pages = {113--126}, publisher = {Springer}, year = {2017}, url = {https://doi.org/10.1007/978-3-319-68705-6\_9}, doi = {10.1007/978-3-319-68705-6\_9}, timestamp = {Thu, 02 Nov 2017 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/wg/BelmonteLM17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/BonamyB17, author = {Marthe Bonamy and Nicolas Bousquet}, editor = {Hans L. Bodlaender and Gerhard J. Woeginger}, title = {Token Sliding on Chordal Graphs}, booktitle = {Graph-Theoretic Concepts in Computer Science - 43rd International Workshop, {WG} 2017, Eindhoven, The Netherlands, June 21-23, 2017, Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {10520}, pages = {127--139}, publisher = {Springer}, year = {2017}, url = {https://doi.org/10.1007/978-3-319-68705-6\_10}, doi = {10.1007/978-3-319-68705-6\_10}, timestamp = {Sat, 05 Sep 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/BonamyB17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/BousquetH17, author = {Nicolas Bousquet and Marc Heinrich}, editor = {Hans L. Bodlaender and Gerhard J. Woeginger}, title = {Computing Maximum Cliques in B{\_}2 -EPG Graphs}, booktitle = {Graph-Theoretic Concepts in Computer Science - 43rd International Workshop, {WG} 2017, Eindhoven, The Netherlands, June 21-23, 2017, Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {10520}, pages = {140--152}, publisher = {Springer}, year = {2017}, url = {https://doi.org/10.1007/978-3-319-68705-6\_11}, doi = {10.1007/978-3-319-68705-6\_11}, timestamp = {Sat, 05 Sep 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/BousquetH17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/CardinalFMTV17, author = {Jean Cardinal and Stefan Felsner and Tillmann Miltzow and Casey Tompkins and Birgit Vogtenhuber}, editor = {Hans L. Bodlaender and Gerhard J. Woeginger}, title = {Intersection Graphs of Rays and Grounded Segments}, booktitle = {Graph-Theoretic Concepts in Computer Science - 43rd International Workshop, {WG} 2017, Eindhoven, The Netherlands, June 21-23, 2017, Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {10520}, pages = {153--166}, publisher = {Springer}, year = {2017}, url = {https://doi.org/10.1007/978-3-319-68705-6\_12}, doi = {10.1007/978-3-319-68705-6\_12}, timestamp = {Thu, 02 Nov 2017 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/wg/CardinalFMTV17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/Chaplick0VZ17, author = {Steven Chaplick and Martin Toepfer and Jan Voborn{\'{\i}}k and Peter Zeman}, editor = {Hans L. Bodlaender and Gerhard J. Woeginger}, title = {On H-Topological Intersection Graphs}, booktitle = {Graph-Theoretic Concepts in Computer Science - 43rd International Workshop, {WG} 2017, Eindhoven, The Netherlands, June 21-23, 2017, Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {10520}, pages = {167--179}, publisher = {Springer}, year = {2017}, url = {https://doi.org/10.1007/978-3-319-68705-6\_13}, doi = {10.1007/978-3-319-68705-6\_13}, timestamp = {Thu, 23 May 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/Chaplick0VZ17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/ChenGL17, author = {Yijia Chen and Martin Grohe and Bingkai Lin}, editor = {Hans L. Bodlaender and Gerhard J. Woeginger}, title = {The Hardness of Embedding Grids and Walls}, booktitle = {Graph-Theoretic Concepts in Computer Science - 43rd International Workshop, {WG} 2017, Eindhoven, The Netherlands, June 21-23, 2017, Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {10520}, pages = {180--192}, publisher = {Springer}, year = {2017}, url = {https://doi.org/10.1007/978-3-319-68705-6\_14}, doi = {10.1007/978-3-319-68705-6\_14}, timestamp = {Tue, 07 May 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/ChenGL17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/ChudnovskySSSZ17, author = {Maria Chudnovsky and Oliver Schaudt and Sophie Spirkl and Maya Stein and Mingxian Zhong}, editor = {Hans L. Bodlaender and Gerhard J. Woeginger}, title = {Approximately Coloring Graphs Without Long Induced Paths}, booktitle = {Graph-Theoretic Concepts in Computer Science - 43rd International Workshop, {WG} 2017, Eindhoven, The Netherlands, June 21-23, 2017, Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {10520}, pages = {193--205}, publisher = {Springer}, year = {2017}, url = {https://doi.org/10.1007/978-3-319-68705-6\_15}, doi = {10.1007/978-3-319-68705-6\_15}, timestamp = {Sat, 30 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/ChudnovskySSSZ17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/CsehM17, author = {{\'{A}}gnes Cseh and Jannik Matuschke}, editor = {Hans L. Bodlaender and Gerhard J. Woeginger}, title = {New and Simple Algorithms for Stable Flow Problems}, booktitle = {Graph-Theoretic Concepts in Computer Science - 43rd International Workshop, {WG} 2017, Eindhoven, The Netherlands, June 21-23, 2017, Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {10520}, pages = {206--219}, publisher = {Springer}, year = {2017}, url = {https://doi.org/10.1007/978-3-319-68705-6\_16}, doi = {10.1007/978-3-319-68705-6\_16}, timestamp = {Mon, 03 Jan 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/wg/CsehM17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/DabrowskiLP17, author = {Konrad K. Dabrowski and Vadim V. Lozin and Dani{\"{e}}l Paulusma}, editor = {Hans L. Bodlaender and Gerhard J. Woeginger}, title = {Clique-Width and Well-Quasi-Ordering of Triangle-Free Graph Classes}, booktitle = {Graph-Theoretic Concepts in Computer Science - 43rd International Workshop, {WG} 2017, Eindhoven, The Netherlands, June 21-23, 2017, Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {10520}, pages = {220--233}, publisher = {Springer}, year = {2017}, url = {https://doi.org/10.1007/978-3-319-68705-6\_17}, doi = {10.1007/978-3-319-68705-6\_17}, timestamp = {Sat, 05 Sep 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/DabrowskiLP17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/Ducoffe17, author = {Guillaume Ducoffe}, editor = {Hans L. Bodlaender and Gerhard J. Woeginger}, title = {Finding Cut-Vertices in the Square Roots of a Graph}, booktitle = {Graph-Theoretic Concepts in Computer Science - 43rd International Workshop, {WG} 2017, Eindhoven, The Netherlands, June 21-23, 2017, Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {10520}, pages = {234--248}, publisher = {Springer}, year = {2017}, url = {https://doi.org/10.1007/978-3-319-68705-6\_18}, doi = {10.1007/978-3-319-68705-6\_18}, timestamp = {Thu, 02 Nov 2017 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/wg/Ducoffe17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/FluschnikHHMS17, author = {Till Fluschnik and Meike Hatzel and Steffen H{\"{a}}rtlein and Hendrik Molter and Henning Seidler}, editor = {Hans L. Bodlaender and Gerhard J. Woeginger}, title = {The Minimum Shared Edges Problem on Grid-Like Graphs}, booktitle = {Graph-Theoretic Concepts in Computer Science - 43rd International Workshop, {WG} 2017, Eindhoven, The Netherlands, June 21-23, 2017, Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {10520}, pages = {249--262}, publisher = {Springer}, year = {2017}, url = {https://doi.org/10.1007/978-3-319-68705-6\_19}, doi = {10.1007/978-3-319-68705-6\_19}, timestamp = {Thu, 02 Nov 2017 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/wg/FluschnikHHMS17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/GaspersH17, author = {Serge Gaspers and Shenwei Huang}, editor = {Hans L. Bodlaender and Gerhard J. Woeginger}, title = {Linearly {\textbackslash}chi {\(\chi\)} -Bounding (P{\_}6, C{\_}4) {(} {P} 6 , {C} 4 {)} -Free Graphs}, booktitle = {Graph-Theoretic Concepts in Computer Science - 43rd International Workshop, {WG} 2017, Eindhoven, The Netherlands, June 21-23, 2017, Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {10520}, pages = {263--274}, publisher = {Springer}, year = {2017}, url = {https://doi.org/10.1007/978-3-319-68705-6\_20}, doi = {10.1007/978-3-319-68705-6\_20}, timestamp = {Thu, 02 Nov 2017 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/wg/GaspersH17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/GolovachHKLP17, author = {Petr A. Golovach and Pinar Heggernes and Dieter Kratsch and Paloma T. Lima and Dani{\"{e}}l Paulusma}, editor = {Hans L. Bodlaender and Gerhard J. Woeginger}, title = {Algorithms for Outerplanar Graph Roots and Graph Roots of Pathwidth at Most 2}, booktitle = {Graph-Theoretic Concepts in Computer Science - 43rd International Workshop, {WG} 2017, Eindhoven, The Netherlands, June 21-23, 2017, Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {10520}, pages = {275--288}, publisher = {Springer}, year = {2017}, url = {https://doi.org/10.1007/978-3-319-68705-6\_21}, doi = {10.1007/978-3-319-68705-6\_21}, timestamp = {Sun, 25 Oct 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/GolovachHKLP17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/GolovachKLS17, author = {Petr A. Golovach and Dieter Kratsch and Mathieu Liedloff and Mohamed Yosri Sayadi}, editor = {Hans L. Bodlaender and Gerhard J. Woeginger}, title = {Enumeration and Maximum Number of Maximal Irredundant Sets for Chordal Graphs}, booktitle = {Graph-Theoretic Concepts in Computer Science - 43rd International Workshop, {WG} 2017, Eindhoven, The Netherlands, June 21-23, 2017, Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {10520}, pages = {289--302}, publisher = {Springer}, year = {2017}, url = {https://doi.org/10.1007/978-3-319-68705-6\_22}, doi = {10.1007/978-3-319-68705-6\_22}, timestamp = {Fri, 02 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/wg/GolovachKLS17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/Hofstad17, author = {Remco van der Hofstad}, editor = {Hans L. Bodlaender and Gerhard J. Woeginger}, title = {Counting Graphs and Null Models of Complex Networks: Configuration Model and Extensions}, booktitle = {Graph-Theoretic Concepts in Computer Science - 43rd International Workshop, {WG} 2017, Eindhoven, The Netherlands, June 21-23, 2017, Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {10520}, pages = {1--17}, publisher = {Springer}, year = {2017}, url = {https://doi.org/10.1007/978-3-319-68705-6\_1}, doi = {10.1007/978-3-319-68705-6\_1}, timestamp = {Wed, 07 Dec 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/wg/Hofstad17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/HujdurovicHMRT17, author = {Ademir Hujdurovic and Edin Husic and Martin Milanic and Romeo Rizzi and Alexandru I. Tomescu}, editor = {Hans L. Bodlaender and Gerhard J. Woeginger}, title = {The Minimum Conflict-Free Row Split Problem Revisited}, booktitle = {Graph-Theoretic Concepts in Computer Science - 43rd International Workshop, {WG} 2017, Eindhoven, The Netherlands, June 21-23, 2017, Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {10520}, pages = {303--315}, publisher = {Springer}, year = {2017}, url = {https://doi.org/10.1007/978-3-319-68705-6\_23}, doi = {10.1007/978-3-319-68705-6\_23}, timestamp = {Thu, 14 Oct 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/HujdurovicHMRT17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/HultenschmidtKM17, author = {Gregor H{\"{u}}ltenschmidt and Philipp Kindermann and Wouter Meulemans and Andr{\'{e}} Schulz}, editor = {Hans L. Bodlaender and Gerhard J. Woeginger}, title = {Drawing Planar Graphs with Few Geometric Primitives}, booktitle = {Graph-Theoretic Concepts in Computer Science - 43rd International Workshop, {WG} 2017, Eindhoven, The Netherlands, June 21-23, 2017, Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {10520}, pages = {316--329}, publisher = {Springer}, year = {2017}, url = {https://doi.org/10.1007/978-3-319-68705-6\_24}, doi = {10.1007/978-3-319-68705-6\_24}, timestamp = {Fri, 02 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/wg/HultenschmidtKM17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/JainJPS17, author = {Pallavi Jain and Jayakrishnan Madathil and Fahad Panolan and Abhishek Sahu}, editor = {Hans L. Bodlaender and Gerhard J. Woeginger}, title = {Mixed Dominating Set: {A} Parameterized Perspective}, booktitle = {Graph-Theoretic Concepts in Computer Science - 43rd International Workshop, {WG} 2017, Eindhoven, The Netherlands, June 21-23, 2017, Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {10520}, pages = {330--343}, publisher = {Springer}, year = {2017}, url = {https://doi.org/10.1007/978-3-319-68705-6\_25}, doi = {10.1007/978-3-319-68705-6\_25}, timestamp = {Tue, 06 Dec 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/wg/JainJPS17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/KnopKMT17, author = {Dusan Knop and Martin Kouteck{\'{y}} and Tom{\'{a}}s Masar{\'{\i}}k and Tom{\'{a}}s Toufar}, editor = {Hans L. Bodlaender and Gerhard J. Woeginger}, title = {Simplified Algorithmic Metatheorems Beyond {MSO:} Treewidth and Neighborhood Diversity}, booktitle = {Graph-Theoretic Concepts in Computer Science - 43rd International Workshop, {WG} 2017, Eindhoven, The Netherlands, June 21-23, 2017, Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {10520}, pages = {344--357}, publisher = {Springer}, year = {2017}, url = {https://doi.org/10.1007/978-3-319-68705-6\_26}, doi = {10.1007/978-3-319-68705-6\_26}, timestamp = {Mon, 15 Jun 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/KnopKMT17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/KrawczykW17, author = {Tomasz Krawczyk and Bartosz Walczak}, editor = {Hans L. Bodlaender and Gerhard J. Woeginger}, title = {Extending Partial Representations of Trapezoid Graphs}, booktitle = {Graph-Theoretic Concepts in Computer Science - 43rd International Workshop, {WG} 2017, Eindhoven, The Netherlands, June 21-23, 2017, Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {10520}, pages = {358--371}, publisher = {Springer}, year = {2017}, url = {https://doi.org/10.1007/978-3-319-68705-6\_27}, doi = {10.1007/978-3-319-68705-6\_27}, timestamp = {Thu, 02 Nov 2017 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/wg/KrawczykW17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/KwonPS17, author = {O{-}joung Kwon and Michal Pilipczuk and Sebastian Siebertz}, editor = {Hans L. Bodlaender and Gerhard J. Woeginger}, title = {On Low Rank-Width Colorings}, booktitle = {Graph-Theoretic Concepts in Computer Science - 43rd International Workshop, {WG} 2017, Eindhoven, The Netherlands, June 21-23, 2017, Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {10520}, pages = {372--385}, publisher = {Springer}, year = {2017}, url = {https://doi.org/10.1007/978-3-319-68705-6\_28}, doi = {10.1007/978-3-319-68705-6\_28}, timestamp = {Sat, 19 Oct 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/KwonPS17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/Lafond17, author = {Manuel Lafond}, editor = {Hans L. Bodlaender and Gerhard J. Woeginger}, title = {On Strongly Chordal Graphs That Are Not Leaf Powers}, booktitle = {Graph-Theoretic Concepts in Computer Science - 43rd International Workshop, {WG} 2017, Eindhoven, The Netherlands, June 21-23, 2017, Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {10520}, pages = {386--398}, publisher = {Springer}, year = {2017}, url = {https://doi.org/10.1007/978-3-319-68705-6\_29}, doi = {10.1007/978-3-319-68705-6\_29}, timestamp = {Thu, 02 Nov 2017 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/wg/Lafond17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/LozinMMZ17, author = {Vadim V. Lozin and Dmitriy S. Malyshev and Raffaele Mosca and Viktor Zamaraev}, editor = {Hans L. Bodlaender and Gerhard J. Woeginger}, title = {New Results on Weighted Independent Domination}, booktitle = {Graph-Theoretic Concepts in Computer Science - 43rd International Workshop, {WG} 2017, Eindhoven, The Netherlands, June 21-23, 2017, Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {10520}, pages = {399--411}, publisher = {Springer}, year = {2017}, url = {https://doi.org/10.1007/978-3-319-68705-6\_30}, doi = {10.1007/978-3-319-68705-6\_30}, timestamp = {Tue, 07 May 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/LozinMMZ17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/SchaudtS17, author = {Oliver Schaudt and Fabian Senger}, editor = {Hans L. Bodlaender and Gerhard J. Woeginger}, title = {The Parameterized Complexity of the Equidomination Problem}, booktitle = {Graph-Theoretic Concepts in Computer Science - 43rd International Workshop, {WG} 2017, Eindhoven, The Netherlands, June 21-23, 2017, Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {10520}, pages = {412--424}, publisher = {Springer}, year = {2017}, url = {https://doi.org/10.1007/978-3-319-68705-6\_31}, doi = {10.1007/978-3-319-68705-6\_31}, timestamp = {Thu, 02 Nov 2017 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/wg/SchaudtS17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/Schrezenmaier17, author = {Hendrik Schrezenmaier}, editor = {Hans L. Bodlaender and Gerhard J. Woeginger}, title = {Homothetic Triangle Contact Representations}, booktitle = {Graph-Theoretic Concepts in Computer Science - 43rd International Workshop, {WG} 2017, Eindhoven, The Netherlands, June 21-23, 2017, Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {10520}, pages = {425--437}, publisher = {Springer}, year = {2017}, url = {https://doi.org/10.1007/978-3-319-68705-6\_32}, doi = {10.1007/978-3-319-68705-6\_32}, timestamp = {Thu, 02 Nov 2017 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/wg/Schrezenmaier17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@proceedings{DBLP:conf/wg/2017, editor = {Hans L. Bodlaender and Gerhard J. Woeginger}, title = {Graph-Theoretic Concepts in Computer Science - 43rd International Workshop, {WG} 2017, Eindhoven, The Netherlands, June 21-23, 2017, Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {10520}, publisher = {Springer}, year = {2017}, url = {https://doi.org/10.1007/978-3-319-68705-6}, doi = {10.1007/978-3-319-68705-6}, isbn = {978-3-319-68704-9}, timestamp = {Tue, 14 May 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/2017.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/AngelBEL16, author = {Eric Angel and Evripidis Bampis and Bruno Escoffier and Michael Lampis}, editor = {Pinar Heggernes}, title = {Parameterized Power Vertex Cover}, booktitle = {Graph-Theoretic Concepts in Computer Science - 42nd International Workshop, {WG} 2016, Istanbul, Turkey, June 22-24, 2016, Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {9941}, pages = {97--108}, year = {2016}, url = {https://doi.org/10.1007/978-3-662-53536-3\_9}, doi = {10.1007/978-3-662-53536-3\_9}, timestamp = {Tue, 14 May 2019 10:00:40 +0200}, biburl = {https://dblp.org/rec/conf/wg/AngelBEL16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/BohmovaCMPW16, author = {Katerina B{\"{o}}hmov{\'{a}} and J{\'{e}}r{\'{e}}mie Chalopin and Mat{\'{u}}s Mihal{\'{a}}k and Guido Proietti and Peter Widmayer}, editor = {Pinar Heggernes}, title = {Sequence Hypergraphs}, booktitle = {Graph-Theoretic Concepts in Computer Science - 42nd International Workshop, {WG} 2016, Istanbul, Turkey, June 22-24, 2016, Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {9941}, pages = {282--294}, year = {2016}, url = {https://doi.org/10.1007/978-3-662-53536-3\_24}, doi = {10.1007/978-3-662-53536-3\_24}, timestamp = {Thu, 23 Jun 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/BohmovaCMPW16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/BonnetBKM16, author = {{\'{E}}douard Bonnet and Nick Brettell and O{-}joung Kwon and D{\'{a}}niel Marx}, editor = {Pinar Heggernes}, title = {Parameterized Vertex Deletion Problems for Hereditary Graph Classes with a Block Property}, booktitle = {Graph-Theoretic Concepts in Computer Science - 42nd International Workshop, {WG} 2016, Istanbul, Turkey, June 22-24, 2016, Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {9941}, pages = {233--244}, year = {2016}, url = {https://doi.org/10.1007/978-3-662-53536-3\_20}, doi = {10.1007/978-3-662-53536-3\_20}, timestamp = {Fri, 02 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/wg/BonnetBKM16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/BrandstadtM16, author = {Andreas Brandst{\"{a}}dt and Raffaele Mosca}, editor = {Pinar Heggernes}, title = {Weighted Efficient Domination for P{\_}6 -Free and for P{\_}5 -Free Graphs}, booktitle = {Graph-Theoretic Concepts in Computer Science - 42nd International Workshop, {WG} 2016, Istanbul, Turkey, June 22-24, 2016, Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {9941}, pages = {38--49}, year = {2016}, url = {https://doi.org/10.1007/978-3-662-53536-3\_4}, doi = {10.1007/978-3-662-53536-3\_4}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/BrandstadtM16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/CaiY16, author = {Leizhen Cai and Junjie Ye}, editor = {Pinar Heggernes}, title = {Finding Two Edge-Disjoint Paths with Length Constraints}, booktitle = {Graph-Theoretic Concepts in Computer Science - 42nd International Workshop, {WG} 2016, Istanbul, Turkey, June 22-24, 2016, Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {9941}, pages = {62--73}, year = {2016}, url = {https://doi.org/10.1007/978-3-662-53536-3\_6}, doi = {10.1007/978-3-662-53536-3\_6}, timestamp = {Fri, 02 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/wg/CaiY16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/ChitnisKK16, author = {Rajesh Chitnis and Lior Kamma and Robert Krauthgamer}, editor = {Pinar Heggernes}, title = {Tight Bounds for Gomory-Hu-like Cut Counting}, booktitle = {Graph-Theoretic Concepts in Computer Science - 42nd International Workshop, {WG} 2016, Istanbul, Turkey, June 22-24, 2016, Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {9941}, pages = {133--144}, year = {2016}, url = {https://doi.org/10.1007/978-3-662-53536-3\_12}, doi = {10.1007/978-3-662-53536-3\_12}, timestamp = {Sat, 30 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/ChitnisKK16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/DebskiLR16, author = {Michal Debski and Zbigniew Lonc and Pawel Rzazewski}, editor = {Pinar Heggernes}, title = {Sequences of Radius k for Complete Bipartite Graphs}, booktitle = {Graph-Theoretic Concepts in Computer Science - 42nd International Workshop, {WG} 2016, Istanbul, Turkey, June 22-24, 2016, Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {9941}, pages = {1--12}, year = {2016}, url = {https://doi.org/10.1007/978-3-662-53536-3\_1}, doi = {10.1007/978-3-662-53536-3\_1}, timestamp = {Sun, 25 Oct 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/DebskiLR16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/DouradoPR16, author = {Mitre Costa Dourado and Lucia Draque Penso and Dieter Rautenbach}, editor = {Pinar Heggernes}, title = {Geodetic Convexity Parameters for Graphs with Few Short Induced Paths}, booktitle = {Graph-Theoretic Concepts in Computer Science - 42nd International Workshop, {WG} 2016, Istanbul, Turkey, June 22-24, 2016, Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {9941}, pages = {25--37}, year = {2016}, url = {https://doi.org/10.1007/978-3-662-53536-3\_3}, doi = {10.1007/978-3-662-53536-3\_3}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/DouradoPR16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/DraganKA16, author = {Feodor F. Dragan and Ekkehard K{\"{o}}hler and Hend Alrasheed}, editor = {Pinar Heggernes}, title = {Eccentricity Approximating Trees - Extended Abstract}, booktitle = {Graph-Theoretic Concepts in Computer Science - 42nd International Workshop, {WG} 2016, Istanbul, Turkey, June 22-24, 2016, Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {9941}, pages = {145--157}, year = {2016}, url = {https://doi.org/10.1007/978-3-662-53536-3\_13}, doi = {10.1007/978-3-662-53536-3\_13}, timestamp = {Thu, 14 Oct 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/DraganKA16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/DuttaG16, author = {Kunal Dutta and Arijit Ghosh}, editor = {Pinar Heggernes}, title = {On Subgraphs of Bounded Degeneracy in Hypergraphs}, booktitle = {Graph-Theoretic Concepts in Computer Science - 42nd International Workshop, {WG} 2016, Istanbul, Turkey, June 22-24, 2016, Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {9941}, pages = {295--306}, year = {2016}, url = {https://doi.org/10.1007/978-3-662-53536-3\_25}, doi = {10.1007/978-3-662-53536-3\_25}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/DuttaG16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/Escoffier16, author = {Bruno Escoffier}, editor = {Pinar Heggernes}, title = {Saving Colors and Max Coloring: Some Fixed-Parameter Tractability Results}, booktitle = {Graph-Theoretic Concepts in Computer Science - 42nd International Workshop, {WG} 2016, Istanbul, Turkey, June 22-24, 2016, Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {9941}, pages = {50--61}, year = {2016}, url = {https://doi.org/10.1007/978-3-662-53536-3\_5}, doi = {10.1007/978-3-662-53536-3\_5}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/Escoffier16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/FominS16, author = {Fedor V. Fomin and Torstein J. F. Str{\o}mme}, editor = {Pinar Heggernes}, title = {Vertex Cover Structural Parameterization Revisited}, booktitle = {Graph-Theoretic Concepts in Computer Science - 42nd International Workshop, {WG} 2016, Istanbul, Turkey, June 22-24, 2016, Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {9941}, pages = {171--182}, year = {2016}, url = {https://doi.org/10.1007/978-3-662-53536-3\_15}, doi = {10.1007/978-3-662-53536-3\_15}, timestamp = {Sun, 02 Jun 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/FominS16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/GiannopoulouKRT16, author = {Archontia C. Giannopoulou and O{-}joung Kwon and Jean{-}Florent Raymond and Dimitrios M. Thilikos}, editor = {Pinar Heggernes}, title = {Packing and Covering Immersion Models of Planar Subcubic Graphs}, booktitle = {Graph-Theoretic Concepts in Computer Science - 42nd International Workshop, {WG} 2016, Istanbul, Turkey, June 22-24, 2016, Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {9941}, pages = {74--84}, year = {2016}, url = {https://doi.org/10.1007/978-3-662-53536-3\_7}, doi = {10.1007/978-3-662-53536-3\_7}, timestamp = {Fri, 02 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/wg/GiannopoulouKRT16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/GoedgebeurS16, author = {Jan Goedgebeur and Oliver Schaudt}, editor = {Pinar Heggernes}, title = {Exhaustive Generation of k-Critical {\(\mathscr{H}\)}-Free Graphs}, booktitle = {Graph-Theoretic Concepts in Computer Science - 42nd International Workshop, {WG} 2016, Istanbul, Turkey, June 22-24, 2016, Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {9941}, pages = {109--120}, year = {2016}, url = {https://doi.org/10.1007/978-3-662-53536-3\_10}, doi = {10.1007/978-3-662-53536-3\_10}, timestamp = {Fri, 02 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/wg/GoedgebeurS16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/GozupekOPSS16, author = {Didem G{\"{o}}z{\"{u}}pek and Sibel {\"{O}}zkan and Christophe Paul and Ignasi Sau and Mordechai Shalom}, editor = {Pinar Heggernes}, title = {Parameterized Complexity of the {MINCCA} Problem on Graphs of Bounded Decomposability}, booktitle = {Graph-Theoretic Concepts in Computer Science - 42nd International Workshop, {WG} 2016, Istanbul, Turkey, June 22-24, 2016, Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {9941}, pages = {195--206}, year = {2016}, url = {https://doi.org/10.1007/978-3-662-53536-3\_17}, doi = {10.1007/978-3-662-53536-3\_17}, timestamp = {Sun, 25 Jul 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/GozupekOPSS16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/Kleist16, author = {Linda Kleist}, editor = {Pinar Heggernes}, title = {Drawing Planar Graphs with Prescribed Face Areas}, booktitle = {Graph-Theoretic Concepts in Computer Science - 42nd International Workshop, {WG} 2016, Istanbul, Turkey, June 22-24, 2016, Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {9941}, pages = {158--170}, year = {2016}, url = {https://doi.org/10.1007/978-3-662-53536-3\_14}, doi = {10.1007/978-3-662-53536-3\_14}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/Kleist16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/KolayPP0T16, author = {Sudeshna Kolay and Ragukumar Pandurangan and Fahad Panolan and Venkatesh Raman and Prafullkumar Tale}, editor = {Pinar Heggernes}, title = {Harmonious Coloring: Parameterized Algorithms and Upper Bounds}, booktitle = {Graph-Theoretic Concepts in Computer Science - 42nd International Workshop, {WG} 2016, Istanbul, Turkey, June 22-24, 2016, Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {9941}, pages = {245--256}, year = {2016}, url = {https://doi.org/10.1007/978-3-662-53536-3\_21}, doi = {10.1007/978-3-662-53536-3\_21}, timestamp = {Sat, 30 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/KolayPP0T16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/MaffrayP16, author = {Fr{\'{e}}d{\'{e}}ric Maffray and Lucas Pastor}, editor = {Pinar Heggernes}, title = {The Maximum Weight Stable Set Problem in {(} P{\_}6 , bull)-Free Graphs}, booktitle = {Graph-Theoretic Concepts in Computer Science - 42nd International Workshop, {WG} 2016, Istanbul, Turkey, June 22-24, 2016, Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {9941}, pages = {85--96}, year = {2016}, url = {https://doi.org/10.1007/978-3-662-53536-3\_8}, doi = {10.1007/978-3-662-53536-3\_8}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/MaffrayP16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/MontealegreT16, author = {Pedro Montealegre and Ioan Todinca}, editor = {Pinar Heggernes}, title = {On Distance-d Independent Set and Other Problems in Graphs with "few" Minimal Separators}, booktitle = {Graph-Theoretic Concepts in Computer Science - 42nd International Workshop, {WG} 2016, Istanbul, Turkey, June 22-24, 2016, Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {9941}, pages = {183--194}, year = {2016}, url = {https://doi.org/10.1007/978-3-662-53536-3\_16}, doi = {10.1007/978-3-662-53536-3\_16}, timestamp = {Mon, 03 Jan 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/wg/MontealegreT16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/PergelR16, author = {Martin Pergel and Pawel Rzazewski}, editor = {Pinar Heggernes}, title = {On Edge Intersection Graphs of Paths with 2 Bends}, booktitle = {Graph-Theoretic Concepts in Computer Science - 42nd International Workshop, {WG} 2016, Istanbul, Turkey, June 22-24, 2016, Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {9941}, pages = {207--219}, year = {2016}, url = {https://doi.org/10.1007/978-3-662-53536-3\_18}, doi = {10.1007/978-3-662-53536-3\_18}, timestamp = {Mon, 16 Sep 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/PergelR16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/Ramanujan16, author = {M. S. Ramanujan}, editor = {Pinar Heggernes}, title = {A Faster Parameterized Algorithm for Group Feedback Edge Set}, booktitle = {Graph-Theoretic Concepts in Computer Science - 42nd International Workshop, {WG} 2016, Istanbul, Turkey, June 22-24, 2016, Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {9941}, pages = {269--281}, year = {2016}, url = {https://doi.org/10.1007/978-3-662-53536-3\_23}, doi = {10.1007/978-3-662-53536-3\_23}, timestamp = {Tue, 03 Nov 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/wg/Ramanujan16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/Suchy16, author = {Ondrej Such{\'{y}}}, editor = {Pinar Heggernes}, title = {On Directed Steiner Trees with Multiple Roots}, booktitle = {Graph-Theoretic Concepts in Computer Science - 42nd International Workshop, {WG} 2016, Istanbul, Turkey, June 22-24, 2016, Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {9941}, pages = {257--268}, year = {2016}, url = {https://doi.org/10.1007/978-3-662-53536-3\_22}, doi = {10.1007/978-3-662-53536-3\_22}, timestamp = {Mon, 16 Sep 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/Suchy16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/XiaoK16, author = {Mingyu Xiao and Shaowei Kou}, editor = {Pinar Heggernes}, title = {Almost Induced Matching: Linear Kernels and Parameterized Algorithms}, booktitle = {Graph-Theoretic Concepts in Computer Science - 42nd International Workshop, {WG} 2016, Istanbul, Turkey, June 22-24, 2016, Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {9941}, pages = {220--232}, year = {2016}, url = {https://doi.org/10.1007/978-3-662-53536-3\_19}, doi = {10.1007/978-3-662-53536-3\_19}, timestamp = {Mon, 08 Jan 2024 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/wg/XiaoK16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/YouW016, author = {Jie You and Jianxin Wang and Yixin Cao}, editor = {Pinar Heggernes}, title = {Approximate Association via Dissociation}, booktitle = {Graph-Theoretic Concepts in Computer Science - 42nd International Workshop, {WG} 2016, Istanbul, Turkey, June 22-24, 2016, Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {9941}, pages = {13--24}, year = {2016}, url = {https://doi.org/10.1007/978-3-662-53536-3\_2}, doi = {10.1007/978-3-662-53536-3\_2}, timestamp = {Fri, 17 Sep 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/YouW016.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/ZiedanRMGD16, author = {Emile Ziedan and Deepak Rajendraprasad and Rogers Mathew and Martin Charles Golumbic and J{\'{e}}r{\'{e}}mie Dusart}, editor = {Pinar Heggernes}, title = {Induced Separation Dimension}, booktitle = {Graph-Theoretic Concepts in Computer Science - 42nd International Workshop, {WG} 2016, Istanbul, Turkey, June 22-24, 2016, Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {9941}, pages = {121--132}, year = {2016}, url = {https://doi.org/10.1007/978-3-662-53536-3\_11}, doi = {10.1007/978-3-662-53536-3\_11}, timestamp = {Sun, 12 Nov 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/wg/ZiedanRMGD16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@proceedings{DBLP:conf/wg/2015, editor = {Ernst W. Mayr}, title = {Graph-Theoretic Concepts in Computer Science - 41st International Workshop, {WG} 2015, Garching, Germany, June 17-19, 2015, Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {9224}, publisher = {Springer}, year = {2016}, url = {https://doi.org/10.1007/978-3-662-53174-7}, doi = {10.1007/978-3-662-53174-7}, isbn = {978-3-662-53173-0}, timestamp = {Tue, 14 May 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/2015.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@proceedings{DBLP:conf/wg/2016, editor = {Pinar Heggernes}, title = {Graph-Theoretic Concepts in Computer Science - 42nd International Workshop, {WG} 2016, Istanbul, Turkey, June 22-24, 2016, Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {9941}, year = {2016}, url = {https://doi.org/10.1007/978-3-662-53536-3}, doi = {10.1007/978-3-662-53536-3}, isbn = {978-3-662-53535-6}, timestamp = {Tue, 14 May 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/2016.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/0002MS15, author = {Eun Jung Kim and Martin Milanic and Oliver Schaudt}, editor = {Ernst W. Mayr}, title = {Recognizing k-equistable Graphs in {FPT} Time}, booktitle = {Graph-Theoretic Concepts in Computer Science - 41st International Workshop, {WG} 2015, Garching, Germany, June 17-19, 2015, Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {9224}, pages = {487--498}, publisher = {Springer}, year = {2015}, url = {https://doi.org/10.1007/978-3-662-53174-7\_34}, doi = {10.1007/978-3-662-53174-7\_34}, timestamp = {Tue, 14 May 2019 10:00:40 +0200}, biburl = {https://dblp.org/rec/conf/wg/0002MS15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/AlamKPT15, author = {Md. Jawaherul Alam and Stephen G. Kobourov and Sergey Pupyrev and Jackson Toeniskoetter}, editor = {Ernst W. Mayr}, title = {Weak Unit Disk and Interval Representation of Graphs}, booktitle = {Graph-Theoretic Concepts in Computer Science - 41st International Workshop, {WG} 2015, Garching, Germany, June 17-19, 2015, Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {9224}, pages = {237--251}, publisher = {Springer}, year = {2015}, url = {https://doi.org/10.1007/978-3-662-53174-7\_17}, doi = {10.1007/978-3-662-53174-7\_17}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/AlamKPT15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/BelmonteOS15, author = {R{\'{e}}my Belmonte and Yota Otachi and Pascal Schweitzer}, editor = {Ernst W. Mayr}, title = {Induced Minor Free Graphs: Isomorphism and Clique-width}, booktitle = {Graph-Theoretic Concepts in Computer Science - 41st International Workshop, {WG} 2015, Garching, Germany, June 17-19, 2015, Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {9224}, pages = {299--311}, publisher = {Springer}, year = {2015}, url = {https://doi.org/10.1007/978-3-662-53174-7\_21}, doi = {10.1007/978-3-662-53174-7\_21}, timestamp = {Sun, 04 Aug 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/BelmonteOS15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/Biedl15, author = {Therese Biedl}, editor = {Ernst W. Mayr}, title = {Triangulating Planar Graphs While Keeping the Pathwidth Small}, booktitle = {Graph-Theoretic Concepts in Computer Science - 41st International Workshop, {WG} 2015, Garching, Germany, June 17-19, 2015, Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {9224}, pages = {425--439}, publisher = {Springer}, year = {2015}, url = {https://doi.org/10.1007/978-3-662-53174-7\_30}, doi = {10.1007/978-3-662-53174-7\_30}, timestamp = {Thu, 11 Aug 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/Biedl15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/BiroKPW15, author = {P{\'{e}}ter Bir{\'{o}} and Walter Kern and Dani{\"{e}}l Paulusma and P{\'{e}}ter Wojuteczky}, editor = {Ernst W. Mayr}, title = {The Stable Fixtures Problem with Payments}, booktitle = {Graph-Theoretic Concepts in Computer Science - 41st International Workshop, {WG} 2015, Garching, Germany, June 17-19, 2015, Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {9224}, pages = {49--63}, publisher = {Springer}, year = {2015}, url = {https://doi.org/10.1007/978-3-662-53174-7\_4}, doi = {10.1007/978-3-662-53174-7\_4}, timestamp = {Fri, 09 Feb 2024 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/wg/BiroKPW15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/BliemW15, author = {Bernhard Bliem and Stefan Woltran}, editor = {Ernst W. Mayr}, title = {Complexity of Secure Sets}, booktitle = {Graph-Theoretic Concepts in Computer Science - 41st International Workshop, {WG} 2015, Garching, Germany, June 17-19, 2015, Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {9224}, pages = {64--77}, publisher = {Springer}, year = {2015}, url = {https://doi.org/10.1007/978-3-662-53174-7\_5}, doi = {10.1007/978-3-662-53174-7\_5}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/BliemW15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/BrandstadtEF15, author = {Andreas Brandst{\"{a}}dt and Elaine M. Eschen and Erik Friese}, editor = {Ernst W. Mayr}, title = {Efficient Domination for Some Subclasses of P{\_}6 -free Graphs in Polynomial Time}, booktitle = {Graph-Theoretic Concepts in Computer Science - 41st International Workshop, {WG} 2015, Garching, Germany, June 17-19, 2015, Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {9224}, pages = {78--89}, publisher = {Springer}, year = {2015}, url = {https://doi.org/10.1007/978-3-662-53174-7\_6}, doi = {10.1007/978-3-662-53174-7\_6}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/BrandstadtEF15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/CicaleseKLPV15, author = {Ferdinando Cicalese and Bal{\'{a}}zs Keszegh and Bernard Lidick{\'{y}} and D{\"{o}}m{\"{o}}t{\"{o}}r P{\'{a}}lv{\"{o}}lgyi and Tom{\'{a}}s Valla}, editor = {Ernst W. Mayr}, title = {On the Tree Search Problem with Non-uniform Costs}, booktitle = {Graph-Theoretic Concepts in Computer Science - 41st International Workshop, {WG} 2015, Garching, Germany, June 17-19, 2015, Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {9224}, pages = {90--102}, publisher = {Springer}, year = {2015}, url = {https://doi.org/10.1007/978-3-662-53174-7\_7}, doi = {10.1007/978-3-662-53174-7\_7}, timestamp = {Fri, 27 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/wg/CicaleseKLPV15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/CoutoFGKS15, author = {Fernanda Couto and Lu{\'{e}}rbio Faria and Sylvain Gravier and Sulamita Klein and Vin{\'{\i}}cius Fernandes dos Santos}, editor = {Ernst W. Mayr}, title = {On the Complexity of Probe and Sandwich Problems for Generalized Threshold Graphs}, booktitle = {Graph-Theoretic Concepts in Computer Science - 41st International Workshop, {WG} 2015, Garching, Germany, June 17-19, 2015, Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {9224}, pages = {312--324}, publisher = {Springer}, year = {2015}, url = {https://doi.org/10.1007/978-3-662-53174-7\_22}, doi = {10.1007/978-3-662-53174-7\_22}, timestamp = {Sat, 19 Oct 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/CoutoFGKS15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/CrespellePT15, author = {Christophe Crespelle and Anthony Perez and Ioan Todinca}, editor = {Ernst W. Mayr}, title = {An \emph{O}(n2) Time Algorithm for the Minimal Permutation Completion Problem}, booktitle = {Graph-Theoretic Concepts in Computer Science - 41st International Workshop, {WG} 2015, Garching, Germany, June 17-19, 2015, Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {9224}, pages = {103--115}, publisher = {Springer}, year = {2015}, url = {https://doi.org/10.1007/978-3-662-53174-7\_8}, doi = {10.1007/978-3-662-53174-7\_8}, timestamp = {Mon, 24 Sep 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/CrespellePT15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/CyganPPLW15, author = {Marek Cygan and Marcin Pilipczuk and Michal Pilipczuk and Erik Jan van Leeuwen and Marcin Wrochna}, editor = {Ernst W. Mayr}, title = {Polynomial Kernelization for Removing Induced Claws and Diamonds}, booktitle = {Graph-Theoretic Concepts in Computer Science - 41st International Workshop, {WG} 2015, Garching, Germany, June 17-19, 2015, Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {9224}, pages = {440--455}, publisher = {Springer}, year = {2015}, url = {https://doi.org/10.1007/978-3-662-53174-7\_31}, doi = {10.1007/978-3-662-53174-7\_31}, timestamp = {Sun, 25 Jul 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/CyganPPLW15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/DraganL15, author = {Feodor F. Dragan and Arne Leitert}, editor = {Ernst W. Mayr}, title = {Minimum Eccentricity Shortest Paths in Some Structured Graph Classes}, booktitle = {Graph-Theoretic Concepts in Computer Science - 41st International Workshop, {WG} 2015, Garching, Germany, June 17-19, 2015, Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {9224}, pages = {189--202}, publisher = {Springer}, year = {2015}, url = {https://doi.org/10.1007/978-3-662-53174-7\_14}, doi = {10.1007/978-3-662-53174-7\_14}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/DraganL15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/EvansLM15, author = {William S. Evans and Giuseppe Liotta and Fabrizio Montecchiani}, editor = {Ernst W. Mayr}, title = {Simultaneous Visibility Representations of Plane st-graphs Using L-shapes}, booktitle = {Graph-Theoretic Concepts in Computer Science - 41st International Workshop, {WG} 2015, Garching, Germany, June 17-19, 2015, Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {9224}, pages = {252--265}, publisher = {Springer}, year = {2015}, url = {https://doi.org/10.1007/978-3-662-53174-7\_18}, doi = {10.1007/978-3-662-53174-7\_18}, timestamp = {Sat, 19 Oct 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/EvansLM15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/FoucaudMNPV15, author = {Florent Foucaud and George B. Mertzios and Reza Naserasr and Aline Parreau and Petru Valicov}, editor = {Ernst W. Mayr}, title = {Algorithms and Complexity for Metric Dimension and Location-domination on Interval and Permutation Graphs}, booktitle = {Graph-Theoretic Concepts in Computer Science - 41st International Workshop, {WG} 2015, Garching, Germany, June 17-19, 2015, Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {9224}, pages = {456--471}, publisher = {Springer}, year = {2015}, url = {https://doi.org/10.1007/978-3-662-53174-7\_32}, doi = {10.1007/978-3-662-53174-7\_32}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/FoucaudMNPV15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/GaspersM15, author = {Serge Gaspers and Simon Mackenzie}, editor = {Ernst W. Mayr}, title = {On the Number of Minimal Separators in Graphs}, booktitle = {Graph-Theoretic Concepts in Computer Science - 41st International Workshop, {WG} 2015, Garching, Germany, June 17-19, 2015, Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {9224}, pages = {116--121}, publisher = {Springer}, year = {2015}, url = {https://doi.org/10.1007/978-3-662-53174-7\_9}, doi = {10.1007/978-3-662-53174-7\_9}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/GaspersM15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/Grimm15, author = {Carsten Grimm}, editor = {Ernst W. Mayr}, title = {Efficient Farthest-Point Queries in Two-terminal Series-parallel Networks}, booktitle = {Graph-Theoretic Concepts in Computer Science - 41st International Workshop, {WG} 2015, Garching, Germany, June 17-19, 2015, Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {9224}, pages = {122--137}, publisher = {Springer}, year = {2015}, url = {https://doi.org/10.1007/978-3-662-53174-7\_10}, doi = {10.1007/978-3-662-53174-7\_10}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/Grimm15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/GroheKRSS15, author = {Martin Grohe and Stephan Kreutzer and Roman Rabinovich and Sebastian Siebertz and Konstantinos S. Stavropoulos}, editor = {Ernst W. Mayr}, title = {Colouring and Covering Nowhere Dense Graphs}, booktitle = {Graph-Theoretic Concepts in Computer Science - 41st International Workshop, {WG} 2015, Garching, Germany, June 17-19, 2015, Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {9224}, pages = {325--338}, publisher = {Springer}, year = {2015}, url = {https://doi.org/10.1007/978-3-662-53174-7\_23}, doi = {10.1007/978-3-662-53174-7\_23}, timestamp = {Fri, 07 Oct 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/GroheKRSS15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/HajnalIR015, author = {P{\'{e}}ter Hajnal and Alexander Igamberdiev and G{\"{u}}nter Rote and Andr{\'{e}} Schulz}, editor = {Ernst W. Mayr}, title = {Saturated Simple and 2-simple Topological Graphs with Few Edges}, booktitle = {Graph-Theoretic Concepts in Computer Science - 41st International Workshop, {WG} 2015, Garching, Germany, June 17-19, 2015, Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {9224}, pages = {391--405}, publisher = {Springer}, year = {2015}, url = {https://doi.org/10.1007/978-3-662-53174-7\_28}, doi = {10.1007/978-3-662-53174-7\_28}, timestamp = {Fri, 02 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/wg/HajnalIR015.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/HongN15, author = {Seok{-}Hee Hong and Hiroshi Nagamochi}, editor = {Ernst W. Mayr}, title = {Testing Full Outer-2-planarity in Linear Time}, booktitle = {Graph-Theoretic Concepts in Computer Science - 41st International Workshop, {WG} 2015, Garching, Germany, June 17-19, 2015, Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {9224}, pages = {406--421}, publisher = {Springer}, year = {2015}, url = {https://doi.org/10.1007/978-3-662-53174-7\_29}, doi = {10.1007/978-3-662-53174-7\_29}, timestamp = {Thu, 27 Apr 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/HongN15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/Jansen15, author = {Bart M. P. Jansen}, editor = {Ernst W. Mayr}, title = {On Structural Parameterizations of Hitting Set: Hitting Paths in Graphs Using 2-SAT}, booktitle = {Graph-Theoretic Concepts in Computer Science - 41st International Workshop, {WG} 2015, Garching, Germany, June 17-19, 2015, Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {9224}, pages = {472--486}, publisher = {Springer}, year = {2015}, url = {https://doi.org/10.1007/978-3-662-53174-7\_33}, doi = {10.1007/978-3-662-53174-7\_33}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/Jansen15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/Joos15, author = {Felix Joos}, editor = {Ernst W. Mayr}, title = {Parity Linkage and the Erd{\H{o}}s-P{\'{o}}sa Property of Odd Cycles Through Prescribed Vertices in Highly Connected Graphs}, booktitle = {Graph-Theoretic Concepts in Computer Science - 41st International Workshop, {WG} 2015, Garching, Germany, June 17-19, 2015, Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {9224}, pages = {339--350}, publisher = {Springer}, year = {2015}, url = {https://doi.org/10.1007/978-3-662-53174-7\_24}, doi = {10.1007/978-3-662-53174-7\_24}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/Joos15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/KanteLMNU15, author = {Mamadou Moustapha Kant{\'{e}} and Vincent Limouzy and Arnaud Mary and Lhouari Nourine and Takeaki Uno}, editor = {Ernst W. Mayr}, title = {A Polynomial Delay Algorithm for Enumerating Minimal Dominating Sets in Chordal Graphs}, booktitle = {Graph-Theoretic Concepts in Computer Science - 41st International Workshop, {WG} 2015, Garching, Germany, June 17-19, 2015, Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {9224}, pages = {138--153}, publisher = {Springer}, year = {2015}, url = {https://doi.org/10.1007/978-3-662-53174-7\_11}, doi = {10.1007/978-3-662-53174-7\_11}, timestamp = {Sun, 02 Oct 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/KanteLMNU15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/KanteMMN15, author = {Mamadou Moustapha Kant{\'{e}} and Fatima Zahra Moataz and Benjamin Mom{\`{e}}ge and Nicolas Nisse}, editor = {Ernst W. Mayr}, title = {Finding Paths in Grids with Forbidden Transitions}, booktitle = {Graph-Theoretic Concepts in Computer Science - 41st International Workshop, {WG} 2015, Garching, Germany, June 17-19, 2015, Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {9224}, pages = {154--168}, publisher = {Springer}, year = {2015}, url = {https://doi.org/10.1007/978-3-662-53174-7\_12}, doi = {10.1007/978-3-662-53174-7\_12}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/KanteMMN15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/KeszeghP15, author = {Bal{\'{a}}zs Keszegh and D{\"{o}}m{\"{o}}t{\"{o}}r P{\'{a}}lv{\"{o}}lgyi}, editor = {Ernst W. Mayr}, title = {An Abstract Approach to Polychromatic Coloring: Shallow Hitting Sets in ABA-free Hypergraphs and Pseudohalfplanes}, booktitle = {Graph-Theoretic Concepts in Computer Science - 41st International Workshop, {WG} 2015, Garching, Germany, June 17-19, 2015, Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {9224}, pages = {266--280}, publisher = {Springer}, year = {2015}, url = {https://doi.org/10.1007/978-3-662-53174-7\_19}, doi = {10.1007/978-3-662-53174-7\_19}, timestamp = {Fri, 27 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/wg/KeszeghP15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/KomusiewiczNN15, author = {Christian Komusiewicz and Andr{\'{e}} Nichterlein and Rolf Niedermeier}, editor = {Ernst W. Mayr}, title = {Parameterized Algorithmics for Graph Modification Problems: On Interactions with Heuristics}, booktitle = {Graph-Theoretic Concepts in Computer Science - 41st International Workshop, {WG} 2015, Garching, Germany, June 17-19, 2015, Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {9224}, pages = {3--15}, publisher = {Springer}, year = {2015}, url = {https://doi.org/10.1007/978-3-662-53174-7\_1}, doi = {10.1007/978-3-662-53174-7\_1}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/KomusiewiczNN15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/KortsarzN15, author = {Guy Kortsarz and Zeev Nutov}, editor = {Ernst W. Mayr}, title = {Approximating Source Location and Star Survivable Network Problems}, booktitle = {Graph-Theoretic Concepts in Computer Science - 41st International Workshop, {WG} 2015, Garching, Germany, June 17-19, 2015, Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {9224}, pages = {203--218}, publisher = {Springer}, year = {2015}, url = {https://doi.org/10.1007/978-3-662-53174-7\_15}, doi = {10.1007/978-3-662-53174-7\_15}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/KortsarzN15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/LiedloffMT15, author = {Mathieu Liedloff and Pedro Montealegre and Ioan Todinca}, editor = {Ernst W. Mayr}, title = {Beyond Classes of Graphs with "Few" Minimal Separators: {FPT} Results Through Potential Maximal Cliques}, booktitle = {Graph-Theoretic Concepts in Computer Science - 41st International Workshop, {WG} 2015, Garching, Germany, June 17-19, 2015, Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {9224}, pages = {499--512}, publisher = {Springer}, year = {2015}, url = {https://doi.org/10.1007/978-3-662-53174-7\_35}, doi = {10.1007/978-3-662-53174-7\_35}, timestamp = {Mon, 03 Jan 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/wg/LiedloffMT15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/LozinRZ15, author = {Vadim V. Lozin and Igor Razgon and Victor Zamaraev}, editor = {Ernst W. Mayr}, title = {Well-quasi-ordering Does Not Imply Bounded Clique-width}, booktitle = {Graph-Theoretic Concepts in Computer Science - 41st International Workshop, {WG} 2015, Garching, Germany, June 17-19, 2015, Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {9224}, pages = {351--359}, publisher = {Springer}, year = {2015}, url = {https://doi.org/10.1007/978-3-662-53174-7\_25}, doi = {10.1007/978-3-662-53174-7\_25}, timestamp = {Fri, 02 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/wg/LozinRZ15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/MarcilonS15, author = {Thiago Braga Marcilon and Rudini M. Sampaio}, editor = {Ernst W. Mayr}, title = {The Maximum Time of 2-neighbour Bootstrap Percolation in Grid Graphs and Parametrized Results}, booktitle = {Graph-Theoretic Concepts in Computer Science - 41st International Workshop, {WG} 2015, Garching, Germany, June 17-19, 2015, Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {9224}, pages = {169--185}, publisher = {Springer}, year = {2015}, url = {https://doi.org/10.1007/978-3-662-53174-7\_13}, doi = {10.1007/978-3-662-53174-7\_13}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/MarcilonS15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/MontejanoS15, author = {Luis Pedro Montejano and Ignasi Sau}, editor = {Ernst W. Mayr}, title = {On the Complexity of Computing the k-restricted Edge-connectivity of a Graph}, booktitle = {Graph-Theoretic Concepts in Computer Science - 41st International Workshop, {WG} 2015, Garching, Germany, June 17-19, 2015, Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {9224}, pages = {219--233}, publisher = {Springer}, year = {2015}, url = {https://doi.org/10.1007/978-3-662-53174-7\_16}, doi = {10.1007/978-3-662-53174-7\_16}, timestamp = {Fri, 29 Jul 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/MontejanoS15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/Oliveira15, author = {Mateus de Oliveira Oliveira}, editor = {Ernst W. Mayr}, title = {A Slice Theoretic Approach for Embedding Problems on Digraphs}, booktitle = {Graph-Theoretic Concepts in Computer Science - 41st International Workshop, {WG} 2015, Garching, Germany, June 17-19, 2015, Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {9224}, pages = {360--372}, publisher = {Springer}, year = {2015}, url = {https://doi.org/10.1007/978-3-662-53174-7\_26}, doi = {10.1007/978-3-662-53174-7\_26}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/Oliveira15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/PachP15, author = {J{\'{a}}nos Pach and D{\"{o}}m{\"{o}}t{\"{o}}r P{\'{a}}lv{\"{o}}lgyi}, editor = {Ernst W. Mayr}, title = {Unsplittable Coverings in the Plane}, booktitle = {Graph-Theoretic Concepts in Computer Science - 41st International Workshop, {WG} 2015, Garching, Germany, June 17-19, 2015, Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {9224}, pages = {281--296}, publisher = {Springer}, year = {2015}, url = {https://doi.org/10.1007/978-3-662-53174-7\_20}, doi = {10.1007/978-3-662-53174-7\_20}, timestamp = {Fri, 27 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/wg/PachP15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/Paulusma15, author = {Dani{\"{e}}l Paulusma}, editor = {Ernst W. Mayr}, title = {Open Problems on Graph Coloring for Special Graph Classes}, booktitle = {Graph-Theoretic Concepts in Computer Science - 41st International Workshop, {WG} 2015, Garching, Germany, June 17-19, 2015, Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {9224}, pages = {16--30}, publisher = {Springer}, year = {2015}, url = {https://doi.org/10.1007/978-3-662-53174-7\_2}, doi = {10.1007/978-3-662-53174-7\_2}, timestamp = {Sun, 25 Oct 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/Paulusma15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/Takazawa15, author = {Kenjiro Takazawa}, editor = {Ernst W. Mayr}, title = {Decomposition Theorems for Square-free 2-matchings in Bipartite Graphs}, booktitle = {Graph-Theoretic Concepts in Computer Science - 41st International Workshop, {WG} 2015, Garching, Germany, June 17-19, 2015, Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {9224}, pages = {373--387}, publisher = {Springer}, year = {2015}, url = {https://doi.org/10.1007/978-3-662-53174-7\_27}, doi = {10.1007/978-3-662-53174-7\_27}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/Takazawa15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/Zaks15, author = {Shmuel Zaks}, editor = {Ernst W. Mayr}, title = {On the Complexity of Approximation and Online Scheduling Problems with Applications to Optical Networks}, booktitle = {Graph-Theoretic Concepts in Computer Science - 41st International Workshop, {WG} 2015, Garching, Germany, June 17-19, 2015, Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {9224}, pages = {31--46}, publisher = {Springer}, year = {2015}, url = {https://doi.org/10.1007/978-3-662-53174-7\_3}, doi = {10.1007/978-3-662-53174-7\_3}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/Zaks15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/AaronKM14, author = {Eric Aaron and Danny Krizanc and Elliot Meyerson}, editor = {Dieter Kratsch and Ioan Todinca}, title = {{DMVP:} Foremost Waypoint Coverage of Time-Varying Graphs}, booktitle = {Graph-Theoretic Concepts in Computer Science - 40th International Workshop, {WG} 2014, Nouan-le-Fuzelier, France, June 25-27, 2014. Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {8747}, pages = {29--41}, publisher = {Springer}, year = {2014}, url = {https://doi.org/10.1007/978-3-319-12340-0\_3}, doi = {10.1007/978-3-319-12340-0\_3}, timestamp = {Tue, 14 May 2019 10:00:40 +0200}, biburl = {https://dblp.org/rec/conf/wg/AaronKM14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/AdlerKK14, author = {Isolde Adler and Mamadou Moustapha Kant{\'{e}} and O{-}joung Kwon}, editor = {Dieter Kratsch and Ioan Todinca}, title = {Linear Rank-Width of Distance-Hereditary Graphs}, booktitle = {Graph-Theoretic Concepts in Computer Science - 40th International Workshop, {WG} 2014, Nouan-le-Fuzelier, France, June 25-27, 2014. Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {8747}, pages = {42--55}, publisher = {Springer}, year = {2014}, url = {https://doi.org/10.1007/978-3-319-12340-0\_4}, doi = {10.1007/978-3-319-12340-0\_4}, timestamp = {Sun, 02 Jun 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/AdlerKK14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/AertsF14, author = {Nieke Aerts and Stefan Felsner}, editor = {Dieter Kratsch and Ioan Todinca}, title = {Vertex Contact Graphs of Paths on a Grid}, booktitle = {Graph-Theoretic Concepts in Computer Science - 40th International Workshop, {WG} 2014, Nouan-le-Fuzelier, France, June 25-27, 2014. Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {8747}, pages = {56--68}, publisher = {Springer}, year = {2014}, url = {https://doi.org/10.1007/978-3-319-12340-0\_5}, doi = {10.1007/978-3-319-12340-0\_5}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/AertsF14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/ArfaouiFIM14, author = {Heger Arfaoui and Pierre Fraigniaud and David Ilcinkas and Fabien Mathieu}, editor = {Dieter Kratsch and Ioan Todinca}, title = {Distributedly Testing Cycle-Freeness}, booktitle = {Graph-Theoretic Concepts in Computer Science - 40th International Workshop, {WG} 2014, Nouan-le-Fuzelier, France, June 25-27, 2014. Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {8747}, pages = {15--28}, publisher = {Springer}, year = {2014}, url = {https://doi.org/10.1007/978-3-319-12340-0\_2}, doi = {10.1007/978-3-319-12340-0\_2}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/ArfaouiFIM14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/AtminasCFL14, author = {Aistis Atminas and Andrew Collins and Jan Foniok and Vadim V. Lozin}, editor = {Dieter Kratsch and Ioan Todinca}, title = {Deciding the Bell Number for Hereditary Graph Properties - (Extended Abstract)}, booktitle = {Graph-Theoretic Concepts in Computer Science - 40th International Workshop, {WG} 2014, Nouan-le-Fuzelier, France, June 25-27, 2014. Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {8747}, pages = {69--80}, publisher = {Springer}, year = {2014}, url = {https://doi.org/10.1007/978-3-319-12340-0\_6}, doi = {10.1007/978-3-319-12340-0\_6}, timestamp = {Tue, 17 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/wg/AtminasCFL14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/BasavarajuCGMR14, author = {Manu Basavaraju and L. Sunil Chandran and Martin Charles Golumbic and Rogers Mathew and Deepak Rajendraprasad}, editor = {Dieter Kratsch and Ioan Todinca}, title = {Boxicity and Separation Dimension}, booktitle = {Graph-Theoretic Concepts in Computer Science - 40th International Workshop, {WG} 2014, Nouan-le-Fuzelier, France, June 25-27, 2014. Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {8747}, pages = {81--92}, publisher = {Springer}, year = {2014}, url = {https://doi.org/10.1007/978-3-319-12340-0\_7}, doi = {10.1007/978-3-319-12340-0\_7}, timestamp = {Sun, 12 Nov 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/wg/BasavarajuCGMR14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/BasavarajuHHSV14, author = {Manu Basavaraju and Pinar Heggernes and Pim van 't Hof and Reza Saei and Yngve Villanger}, editor = {Dieter Kratsch and Ioan Todinca}, title = {Maximal Induced Matchings in Triangle-Free Graphs}, booktitle = {Graph-Theoretic Concepts in Computer Science - 40th International Workshop, {WG} 2014, Nouan-le-Fuzelier, France, June 25-27, 2014. Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {8747}, pages = {93--104}, publisher = {Springer}, year = {2014}, url = {https://doi.org/10.1007/978-3-319-12340-0\_8}, doi = {10.1007/978-3-319-12340-0\_8}, timestamp = {Thu, 14 Oct 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/BasavarajuHHSV14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/Bonsma14, author = {Paul S. Bonsma}, editor = {Dieter Kratsch and Ioan Todinca}, title = {Independent Set Reconfiguration in Cographs}, booktitle = {Graph-Theoretic Concepts in Computer Science - 40th International Workshop, {WG} 2014, Nouan-le-Fuzelier, France, June 25-27, 2014. Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {8747}, pages = {105--116}, publisher = {Springer}, year = {2014}, url = {https://doi.org/10.1007/978-3-319-12340-0\_9}, doi = {10.1007/978-3-319-12340-0\_9}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/Bonsma14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/BruhnCJS14, author = {Henning Bruhn and Morgan Chopin and Felix Joos and Oliver Schaudt}, editor = {Dieter Kratsch and Ioan Todinca}, title = {Structural Parameterizations for Boxicity}, booktitle = {Graph-Theoretic Concepts in Computer Science - 40th International Workshop, {WG} 2014, Nouan-le-Fuzelier, France, June 25-27, 2014. Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {8747}, pages = {117--128}, publisher = {Springer}, year = {2014}, url = {https://doi.org/10.1007/978-3-319-12340-0\_10}, doi = {10.1007/978-3-319-12340-0\_10}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/BruhnCJS14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/CambyS14, author = {Eglantine Camby and Oliver Schaudt}, editor = {Dieter Kratsch and Ioan Todinca}, title = {A New Characterization of P\({}_{\mbox{k}}\)-free Graphs}, booktitle = {Graph-Theoretic Concepts in Computer Science - 40th International Workshop, {WG} 2014, Nouan-le-Fuzelier, France, June 25-27, 2014. Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {8747}, pages = {129--138}, publisher = {Springer}, year = {2014}, url = {https://doi.org/10.1007/978-3-319-12340-0\_11}, doi = {10.1007/978-3-319-12340-0\_11}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/CambyS14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/ChaplickDKMS14, author = {Steven Chaplick and Paul Dorbec and Jan Kratochv{\'{\i}}l and Micka{\"{e}}l Montassier and Juraj Stacho}, editor = {Dieter Kratsch and Ioan Todinca}, title = {Contact Representations of Planar Graphs: Extending a Partial Representation is Hard}, booktitle = {Graph-Theoretic Concepts in Computer Science - 40th International Workshop, {WG} 2014, Nouan-le-Fuzelier, France, June 25-27, 2014. Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {8747}, pages = {139--151}, publisher = {Springer}, year = {2014}, url = {https://doi.org/10.1007/978-3-319-12340-0\_12}, doi = {10.1007/978-3-319-12340-0\_12}, timestamp = {Sat, 30 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/ChaplickDKMS14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/CouetouxNV14, author = {Basile Cou{\"{e}}toux and Elie Nakache and Yann Vax{\`{e}}s}, editor = {Dieter Kratsch and Ioan Todinca}, title = {The Maximum Labeled Path Problem}, booktitle = {Graph-Theoretic Concepts in Computer Science - 40th International Workshop, {WG} 2014, Nouan-le-Fuzelier, France, June 25-27, 2014. Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {8747}, pages = {152--163}, publisher = {Springer}, year = {2014}, url = {https://doi.org/10.1007/978-3-319-12340-0\_13}, doi = {10.1007/978-3-319-12340-0\_13}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/CouetouxNV14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/DiestelO14, author = {Reinhard Diestel and Sang{-}il Oum}, editor = {Dieter Kratsch and Ioan Todinca}, title = {Unifying Duality Theorems for Width Parameters in Graphs and Matroids (Extended Abstract)}, booktitle = {Graph-Theoretic Concepts in Computer Science - 40th International Workshop, {WG} 2014, Nouan-le-Fuzelier, France, June 25-27, 2014. Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {8747}, pages = {1--14}, publisher = {Springer}, year = {2014}, url = {https://doi.org/10.1007/978-3-319-12340-0\_1}, doi = {10.1007/978-3-319-12340-0\_1}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/DiestelO14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/Erlebach014, author = {Thomas Erlebach and Michael Hoffmann}, editor = {Dieter Kratsch and Ioan Todinca}, title = {Minimum Spanning Tree Verification Under Uncertainty}, booktitle = {Graph-Theoretic Concepts in Computer Science - 40th International Workshop, {WG} 2014, Nouan-le-Fuzelier, France, June 25-27, 2014. Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {8747}, pages = {164--175}, publisher = {Springer}, year = {2014}, url = {https://doi.org/10.1007/978-3-319-12340-0\_14}, doi = {10.1007/978-3-319-12340-0\_14}, timestamp = {Mon, 05 Jun 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/Erlebach014.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/Fulek14, author = {Radoslav Fulek}, editor = {Dieter Kratsch and Ioan Todinca}, title = {Towards the Hanani-Tutte Theorem for Clustered Graphs}, booktitle = {Graph-Theoretic Concepts in Computer Science - 40th International Workshop, {WG} 2014, Nouan-le-Fuzelier, France, June 25-27, 2014. Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {8747}, pages = {176--188}, publisher = {Springer}, year = {2014}, url = {https://doi.org/10.1007/978-3-319-12340-0\_15}, doi = {10.1007/978-3-319-12340-0\_15}, timestamp = {Thu, 15 Jun 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/Fulek14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/GandhiK14, author = {Rajiv Gandhi and Guy Kortsarz}, editor = {Dieter Kratsch and Ioan Todinca}, title = {On Set Expansion Problems and the Small Set Expansion Conjecture}, booktitle = {Graph-Theoretic Concepts in Computer Science - 40th International Workshop, {WG} 2014, Nouan-le-Fuzelier, France, June 25-27, 2014. Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {8747}, pages = {189--200}, publisher = {Springer}, year = {2014}, url = {https://doi.org/10.1007/978-3-319-12340-0\_16}, doi = {10.1007/978-3-319-12340-0\_16}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/GandhiK14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/GolovachHHP14, author = {Petr A. Golovach and Pinar Heggernes and Pim van 't Hof and Christophe Paul}, editor = {Dieter Kratsch and Ioan Todinca}, title = {Hadwiger Number of Graphs with Small Chordality}, booktitle = {Graph-Theoretic Concepts in Computer Science - 40th International Workshop, {WG} 2014, Nouan-le-Fuzelier, France, June 25-27, 2014. Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {8747}, pages = {201--213}, publisher = {Springer}, year = {2014}, url = {https://doi.org/10.1007/978-3-319-12340-0\_17}, doi = {10.1007/978-3-319-12340-0\_17}, timestamp = {Thu, 14 Oct 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/GolovachHHP14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/GolovachHLMSS14, author = {Petr A. Golovach and Pinar Heggernes and Nathan Lindzey and Ross M. McConnell and Vin{\'{\i}}cius Fernandes dos Santos and Jeremy P. Spinrad}, editor = {Dieter Kratsch and Ioan Todinca}, title = {Recognizing Threshold Tolerance Graphs in O(n\({}^{\mbox{2}}\)) Time}, booktitle = {Graph-Theoretic Concepts in Computer Science - 40th International Workshop, {WG} 2014, Nouan-le-Fuzelier, France, June 25-27, 2014. Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {8747}, pages = {214--224}, publisher = {Springer}, year = {2014}, url = {https://doi.org/10.1007/978-3-319-12340-0\_18}, doi = {10.1007/978-3-319-12340-0\_18}, timestamp = {Fri, 02 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/wg/GolovachHLMSS14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/GolovachPL14, author = {Petr A. Golovach and Dani{\"{e}}l Paulusma and Erik Jan van Leeuwen}, editor = {Dieter Kratsch and Ioan Todinca}, title = {Induced Disjoint Paths in Circular-Arc Graphs in Linear Time}, booktitle = {Graph-Theoretic Concepts in Computer Science - 40th International Workshop, {WG} 2014, Nouan-le-Fuzelier, France, June 25-27, 2014. Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {8747}, pages = {225--237}, publisher = {Springer}, year = {2014}, url = {https://doi.org/10.1007/978-3-319-12340-0\_19}, doi = {10.1007/978-3-319-12340-0\_19}, timestamp = {Sun, 25 Oct 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/GolovachPL14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/GuX14, author = {Qian{-}Ping Gu and Gengchun Xu}, editor = {Dieter Kratsch and Ioan Todinca}, title = {Near-Linear Time Constant-Factor Approximation Algorithm for Branch-Decomposition of Planar Graphs}, booktitle = {Graph-Theoretic Concepts in Computer Science - 40th International Workshop, {WG} 2014, Nouan-le-Fuzelier, France, June 25-27, 2014. Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {8747}, pages = {238--249}, publisher = {Springer}, year = {2014}, url = {https://doi.org/10.1007/978-3-319-12340-0\_20}, doi = {10.1007/978-3-319-12340-0\_20}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/GuX14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/GutinJSW14, author = {Gregory Z. Gutin and Mark Jones and Bin Sheng and Magnus Wahlstr{\"{o}}m}, editor = {Dieter Kratsch and Ioan Todinca}, title = {Parameterized Directed k-Chinese Postman Problem and k Arc-Disjoint Cycles Problem on Euler Digraphs}, booktitle = {Graph-Theoretic Concepts in Computer Science - 40th International Workshop, {WG} 2014, Nouan-le-Fuzelier, France, June 25-27, 2014. Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {8747}, pages = {250--262}, publisher = {Springer}, year = {2014}, url = {https://doi.org/10.1007/978-3-319-12340-0\_21}, doi = {10.1007/978-3-319-12340-0\_21}, timestamp = {Wed, 22 Dec 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/wg/GutinJSW14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/HabibM14, author = {Michel Habib and Antoine Mamcarz}, editor = {Dieter Kratsch and Ioan Todinca}, title = {Colored Modular and Split Decompositions of Graphs with Applications to Trigraphs}, booktitle = {Graph-Theoretic Concepts in Computer Science - 40th International Workshop, {WG} 2014, Nouan-le-Fuzelier, France, June 25-27, 2014. Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {8747}, pages = {263--274}, publisher = {Springer}, year = {2014}, url = {https://doi.org/10.1007/978-3-319-12340-0\_22}, doi = {10.1007/978-3-319-12340-0\_22}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/HabibM14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/HougardyS14, author = {Stefan Hougardy and Rasmus T. Schroeder}, editor = {Dieter Kratsch and Ioan Todinca}, title = {Edge Elimination in {TSP} Instances}, booktitle = {Graph-Theoretic Concepts in Computer Science - 40th International Workshop, {WG} 2014, Nouan-le-Fuzelier, France, June 25-27, 2014. Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {8747}, pages = {275--286}, publisher = {Springer}, year = {2014}, url = {https://doi.org/10.1007/978-3-319-12340-0\_23}, doi = {10.1007/978-3-319-12340-0\_23}, timestamp = {Sat, 30 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/HougardyS14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/HuffnerKNR14, author = {Falk H{\"{u}}ffner and Christian Komusiewicz and Rolf Niedermeier and Martin R{\"{o}}tzschke}, editor = {Dieter Kratsch and Ioan Todinca}, title = {The Parameterized Complexity of the Rainbow Subgraph Problem}, booktitle = {Graph-Theoretic Concepts in Computer Science - 40th International Workshop, {WG} 2014, Nouan-le-Fuzelier, France, June 25-27, 2014. Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {8747}, pages = {287--298}, publisher = {Springer}, year = {2014}, url = {https://doi.org/10.1007/978-3-319-12340-0\_24}, doi = {10.1007/978-3-319-12340-0\_24}, timestamp = {Sun, 25 Oct 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/HuffnerKNR14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/IerselK14, author = {Leo van Iersel and Steven Kelk}, editor = {Dieter Kratsch and Ioan Todinca}, title = {Kernelizations for the Hybridization Number Problem on Multiple Nonbinary Trees}, booktitle = {Graph-Theoretic Concepts in Computer Science - 40th International Workshop, {WG} 2014, Nouan-le-Fuzelier, France, June 25-27, 2014. Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {8747}, pages = {299--311}, publisher = {Springer}, year = {2014}, url = {https://doi.org/10.1007/978-3-319-12340-0\_25}, doi = {10.1007/978-3-319-12340-0\_25}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/IerselK14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/IwataNR14, author = {Satoru Iwata and Alantha Newman and R. Ravi}, editor = {Dieter Kratsch and Ioan Todinca}, title = {Graph-TSP from Steiner Cycles}, booktitle = {Graph-Theoretic Concepts in Computer Science - 40th International Workshop, {WG} 2014, Nouan-le-Fuzelier, France, June 25-27, 2014. Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {8747}, pages = {312--323}, publisher = {Springer}, year = {2014}, url = {https://doi.org/10.1007/978-3-319-12340-0\_26}, doi = {10.1007/978-3-319-12340-0\_26}, timestamp = {Wed, 16 May 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/IwataNR14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/Joos14, author = {Felix Joos}, editor = {Dieter Kratsch and Ioan Todinca}, title = {A Characterization of Mixed Unit Interval Graphs}, booktitle = {Graph-Theoretic Concepts in Computer Science - 40th International Workshop, {WG} 2014, Nouan-le-Fuzelier, France, June 25-27, 2014. Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {8747}, pages = {324--335}, publisher = {Springer}, year = {2014}, url = {https://doi.org/10.1007/978-3-319-12340-0\_27}, doi = {10.1007/978-3-319-12340-0\_27}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/Joos14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/KangasKKK14, author = {Kustaa Kangas and Petteri Kaski and Mikko Koivisto and Janne H. Korhonen}, editor = {Dieter Kratsch and Ioan Todinca}, title = {On the Number of Connected Sets in Bounded Degree Graphs}, booktitle = {Graph-Theoretic Concepts in Computer Science - 40th International Workshop, {WG} 2014, Nouan-le-Fuzelier, France, June 25-27, 2014. Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {8747}, pages = {336--347}, publisher = {Springer}, year = {2014}, url = {https://doi.org/10.1007/978-3-319-12340-0\_28}, doi = {10.1007/978-3-319-12340-0\_28}, timestamp = {Thu, 15 Jun 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/KangasKKK14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/LampisMMU14, author = {Michael Lampis and Kazuhisa Makino and Valia Mitsou and Yushi Uno}, editor = {Dieter Kratsch and Ioan Todinca}, title = {Parameterized Edge Hamiltonicity}, booktitle = {Graph-Theoretic Concepts in Computer Science - 40th International Workshop, {WG} 2014, Nouan-le-Fuzelier, France, June 25-27, 2014. Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {8747}, pages = {348--359}, publisher = {Springer}, year = {2014}, url = {https://doi.org/10.1007/978-3-319-12340-0\_29}, doi = {10.1007/978-3-319-12340-0\_29}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/LampisMMU14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/LeOS14, author = {Van Bang Le and Andrea Oversberg and Oliver Schaudt}, editor = {Dieter Kratsch and Ioan Todinca}, title = {Polynomial Time Recognition of Squares of Ptolemaic Graphs and 3-sun-free Split Graphs}, booktitle = {Graph-Theoretic Concepts in Computer Science - 40th International Workshop, {WG} 2014, Nouan-le-Fuzelier, France, June 25-27, 2014. Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {8747}, pages = {360--371}, publisher = {Springer}, year = {2014}, url = {https://doi.org/10.1007/978-3-319-12340-0\_30}, doi = {10.1007/978-3-319-12340-0\_30}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/LeOS14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/MarcilonNS14, author = {Thiago Braga Marcilon and Samuel Nascimento and Rudini M. Sampaio}, editor = {Dieter Kratsch and Ioan Todinca}, title = {The Maximum Time of 2-Neighbour Bootstrap Percolation: Complexity Results}, booktitle = {Graph-Theoretic Concepts in Computer Science - 40th International Workshop, {WG} 2014, Nouan-le-Fuzelier, France, June 25-27, 2014. Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {8747}, pages = {372--383}, publisher = {Springer}, year = {2014}, url = {https://doi.org/10.1007/978-3-319-12340-0\_31}, doi = {10.1007/978-3-319-12340-0\_31}, timestamp = {Sat, 30 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/MarcilonNS14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/SaetherT14, author = {Sigve Hortemo S{\ae}ther and Jan Arne Telle}, editor = {Dieter Kratsch and Ioan Todinca}, title = {Between Treewidth and Clique-Width}, booktitle = {Graph-Theoretic Concepts in Computer Science - 40th International Workshop, {WG} 2014, Nouan-le-Fuzelier, France, June 25-27, 2014. Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {8747}, pages = {396--407}, publisher = {Springer}, year = {2014}, url = {https://doi.org/10.1007/978-3-319-12340-0\_33}, doi = {10.1007/978-3-319-12340-0\_33}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/SaetherT14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/ShachnaiZ14, author = {Hadas Shachnai and Meirav Zehavi}, editor = {Dieter Kratsch and Ioan Todinca}, title = {Parameterized Algorithms for Graph Partitioning Problems}, booktitle = {Graph-Theoretic Concepts in Computer Science - 40th International Workshop, {WG} 2014, Nouan-le-Fuzelier, France, June 25-27, 2014. Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {8747}, pages = {384--395}, publisher = {Springer}, year = {2014}, url = {https://doi.org/10.1007/978-3-319-12340-0\_32}, doi = {10.1007/978-3-319-12340-0\_32}, timestamp = {Fri, 02 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/wg/ShachnaiZ14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/ThomasseTV14, author = {St{\'{e}}phan Thomass{\'{e}} and Nicolas Trotignon and Kristina Vuskovic}, editor = {Dieter Kratsch and Ioan Todinca}, title = {A Polynomial Turing-Kernel for Weighted Independent Set in Bull-Free Graphs}, booktitle = {Graph-Theoretic Concepts in Computer Science - 40th International Workshop, {WG} 2014, Nouan-le-Fuzelier, France, June 25-27, 2014. Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {8747}, pages = {408--419}, publisher = {Springer}, year = {2014}, url = {https://doi.org/10.1007/978-3-319-12340-0\_34}, doi = {10.1007/978-3-319-12340-0\_34}, timestamp = {Sun, 02 Jun 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/ThomasseTV14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@proceedings{DBLP:conf/wg/2014, editor = {Dieter Kratsch and Ioan Todinca}, title = {Graph-Theoretic Concepts in Computer Science - 40th International Workshop, {WG} 2014, Nouan-le-Fuzelier, France, June 25-27, 2014. Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {8747}, publisher = {Springer}, year = {2014}, url = {https://doi.org/10.1007/978-3-319-12340-0}, doi = {10.1007/978-3-319-12340-0}, isbn = {978-3-319-12339-4}, timestamp = {Tue, 14 May 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/2014.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/AdlerK13, author = {Isolde Adler and Mamadou Moustapha Kant{\'{e}}}, editor = {Andreas Brandst{\"{a}}dt and Klaus Jansen and R{\"{u}}diger Reischuk}, title = {Linear Rank-Width and Linear Clique-Width of Trees}, booktitle = {Graph-Theoretic Concepts in Computer Science - 39th International Workshop, {WG} 2013, L{\"{u}}beck, Germany, June 19-21, 2013, Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {8165}, pages = {12--25}, publisher = {Springer}, year = {2013}, url = {https://doi.org/10.1007/978-3-642-45043-3\_3}, doi = {10.1007/978-3-642-45043-3\_3}, timestamp = {Tue, 14 May 2019 10:00:40 +0200}, biburl = {https://dblp.org/rec/conf/wg/AdlerK13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/AlamCFKKP13, author = {Md. Jawaherul Alam and Steven Chaplick and Gasper Fijavz and Michael Kaufmann and Stephen G. Kobourov and Sergey Pupyrev}, editor = {Andreas Brandst{\"{a}}dt and Klaus Jansen and R{\"{u}}diger Reischuk}, title = {Threshold-Coloring and Unit-Cube Contact Representation of Graphs}, booktitle = {Graph-Theoretic Concepts in Computer Science - 39th International Workshop, {WG} 2013, L{\"{u}}beck, Germany, June 19-21, 2013, Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {8165}, pages = {26--37}, publisher = {Springer}, year = {2013}, url = {https://doi.org/10.1007/978-3-642-45043-3\_4}, doi = {10.1007/978-3-642-45043-3\_4}, timestamp = {Mon, 05 Jun 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/AlamCFKKP13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/AuerBBH13, author = {Christopher Auer and Christian Bachmaier and Franz{-}Josef Brandenburg and Kathrin Hanauer}, editor = {Andreas Brandst{\"{a}}dt and Klaus Jansen and R{\"{u}}diger Reischuk}, title = {Rolling Upward Planarity Testing of Strongly Connected Graphs}, booktitle = {Graph-Theoretic Concepts in Computer Science - 39th International Workshop, {WG} 2013, L{\"{u}}beck, Germany, June 19-21, 2013, Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {8165}, pages = {38--49}, publisher = {Springer}, year = {2013}, url = {https://doi.org/10.1007/978-3-642-45043-3\_5}, doi = {10.1007/978-3-642-45043-3\_5}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/AuerBBH13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/BentoBMSS13, author = {Lucila Maria Souza Bento and Davidson R. Boccardo and Raphael Carlos Santos Machado and Vin{\'{\i}}cius Gusm{\~{a}}o Pereira de S{\'{a}} and Jayme Luiz Szwarcfiter}, editor = {Andreas Brandst{\"{a}}dt and Klaus Jansen and R{\"{u}}diger Reischuk}, title = {Towards a Provably Resilient Scheme for Graph-Based Watermarking}, booktitle = {Graph-Theoretic Concepts in Computer Science - 39th International Workshop, {WG} 2013, L{\"{u}}beck, Germany, June 19-21, 2013, Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {8165}, pages = {50--63}, publisher = {Springer}, year = {2013}, url = {https://doi.org/10.1007/978-3-642-45043-3\_6}, doi = {10.1007/978-3-642-45043-3\_6}, timestamp = {Sat, 30 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/BentoBMSS13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/BerryW13, author = {Anne Berry and Annegret Wagler}, editor = {Andreas Brandst{\"{a}}dt and Klaus Jansen and R{\"{u}}diger Reischuk}, title = {The Normal Graph Conjecture for Classes of Sparse Graphs}, booktitle = {Graph-Theoretic Concepts in Computer Science - 39th International Workshop, {WG} 2013, L{\"{u}}beck, Germany, June 19-21, 2013, Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {8165}, pages = {64--75}, publisher = {Springer}, year = {2013}, url = {https://doi.org/10.1007/978-3-642-45043-3\_7}, doi = {10.1007/978-3-642-45043-3\_7}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/BerryW13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/BevernFSS13, author = {Ren{\'{e}} van Bevern and Andreas Emil Feldmann and Manuel Sorge and Ondrej Such{\'{y}}}, editor = {Andreas Brandst{\"{a}}dt and Klaus Jansen and R{\"{u}}diger Reischuk}, title = {On the Parameterized Complexity of Computing Graph Bisections}, booktitle = {Graph-Theoretic Concepts in Computer Science - 39th International Workshop, {WG} 2013, L{\"{u}}beck, Germany, June 19-21, 2013, Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {8165}, pages = {76--87}, publisher = {Springer}, year = {2013}, url = {https://doi.org/10.1007/978-3-642-45043-3\_8}, doi = {10.1007/978-3-642-45043-3\_8}, timestamp = {Tue, 07 May 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/BevernFSS13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/BodlaenderKK13, author = {Hans L. Bodlaender and Stefan Kratsch and Vincent J. C. Kreuzen}, editor = {Andreas Brandst{\"{a}}dt and Klaus Jansen and R{\"{u}}diger Reischuk}, title = {Fixed-Parameter Tractability and Characterizations of Small Special Treewidth}, booktitle = {Graph-Theoretic Concepts in Computer Science - 39th International Workshop, {WG} 2013, L{\"{u}}beck, Germany, June 19-21, 2013, Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {8165}, pages = {88--99}, publisher = {Springer}, year = {2013}, url = {https://doi.org/10.1007/978-3-642-45043-3\_9}, doi = {10.1007/978-3-642-45043-3\_9}, timestamp = {Sun, 02 Jun 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/BodlaenderKK13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/BoseMRV13, author = {Prosenjit Bose and Pat Morin and Andr{\'{e}} van Renssen and Sander Verdonschot}, editor = {Andreas Brandst{\"{a}}dt and Klaus Jansen and R{\"{u}}diger Reischuk}, title = {The {\texttheta} 5-Graph is a Spanner}, booktitle = {Graph-Theoretic Concepts in Computer Science - 39th International Workshop, {WG} 2013, L{\"{u}}beck, Germany, June 19-21, 2013, Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {8165}, pages = {100--114}, publisher = {Springer}, year = {2013}, url = {https://doi.org/10.1007/978-3-642-45043-3\_10}, doi = {10.1007/978-3-642-45043-3\_10}, timestamp = {Fri, 02 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/wg/BoseMRV13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/BoyaciESZ13, author = {Arman Boyaci and T{\'{\i}}naz Ekim and Mordechai Shalom and Shmuel Zaks}, editor = {Andreas Brandst{\"{a}}dt and Klaus Jansen and R{\"{u}}diger Reischuk}, title = {Graphs of Edge-Intersecting Non-splitting Paths in a Tree: Towards Hole Representations - (Extended Abstract)}, booktitle = {Graph-Theoretic Concepts in Computer Science - 39th International Workshop, {WG} 2013, L{\"{u}}beck, Germany, June 19-21, 2013, Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {8165}, pages = {115--126}, publisher = {Springer}, year = {2013}, url = {https://doi.org/10.1007/978-3-642-45043-3\_11}, doi = {10.1007/978-3-642-45043-3\_11}, timestamp = {Sun, 25 Jul 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/BoyaciESZ13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/BroersmaFGKPP13, author = {Hajo Broersma and Jir{\'{\i}} Fiala and Petr A. Golovach and Tom{\'{a}}s Kaiser and Dani{\"{e}}l Paulusma and Andrzej Proskurowski}, editor = {Andreas Brandst{\"{a}}dt and Klaus Jansen and R{\"{u}}diger Reischuk}, title = {Linear-Time Algorithms for Scattering Number and Hamilton-Connectivity of Interval Graphs}, booktitle = {Graph-Theoretic Concepts in Computer Science - 39th International Workshop, {WG} 2013, L{\"{u}}beck, Germany, June 19-21, 2013, Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {8165}, pages = {127--138}, publisher = {Springer}, year = {2013}, url = {https://doi.org/10.1007/978-3-642-45043-3\_12}, doi = {10.1007/978-3-642-45043-3\_12}, timestamp = {Sat, 05 Sep 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/BroersmaFGKPP13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/ChaplickKU13, author = {Steven Chaplick and Stephen G. Kobourov and Torsten Ueckerdt}, editor = {Andreas Brandst{\"{a}}dt and Klaus Jansen and R{\"{u}}diger Reischuk}, title = {Equilateral L-Contact Graphs}, booktitle = {Graph-Theoretic Concepts in Computer Science - 39th International Workshop, {WG} 2013, L{\"{u}}beck, Germany, June 19-21, 2013, Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {8165}, pages = {139--151}, publisher = {Springer}, year = {2013}, url = {https://doi.org/10.1007/978-3-642-45043-3\_13}, doi = {10.1007/978-3-642-45043-3\_13}, timestamp = {Mon, 05 Jun 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/ChaplickKU13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/ChenFS13, author = {Jianer Chen and Jia{-}Hao Fan and Sing{-}Hoi Sze}, editor = {Andreas Brandst{\"{a}}dt and Klaus Jansen and R{\"{u}}diger Reischuk}, title = {Parameterized and Approximation Algorithms for the {MAF} Problem in Multifurcating Trees}, booktitle = {Graph-Theoretic Concepts in Computer Science - 39th International Workshop, {WG} 2013, L{\"{u}}beck, Germany, June 19-21, 2013, Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {8165}, pages = {152--164}, publisher = {Springer}, year = {2013}, url = {https://doi.org/10.1007/978-3-642-45043-3\_14}, doi = {10.1007/978-3-642-45043-3\_14}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/ChenFS13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/ChengMOST13, author = {Christine T. Cheng and Andrew McConvey and Drew Onderko and Nathaniel Shar and Charles Tomlinson}, editor = {Andreas Brandst{\"{a}}dt and Klaus Jansen and R{\"{u}}diger Reischuk}, title = {Beyond Knights and Knaves}, booktitle = {Graph-Theoretic Concepts in Computer Science - 39th International Workshop, {WG} 2013, L{\"{u}}beck, Germany, June 19-21, 2013, Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {8165}, pages = {394--405}, publisher = {Springer}, year = {2013}, url = {https://doi.org/10.1007/978-3-642-45043-3\_34}, doi = {10.1007/978-3-642-45043-3\_34}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/ChengMOST13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/ChiarelliM13, author = {Nina Chiarelli and Martin Milanic}, editor = {Andreas Brandst{\"{a}}dt and Klaus Jansen and R{\"{u}}diger Reischuk}, title = {Linear Separation of Total Dominating Sets in Graphs}, booktitle = {Graph-Theoretic Concepts in Computer Science - 39th International Workshop, {WG} 2013, L{\"{u}}beck, Germany, June 19-21, 2013, Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {8165}, pages = {165--176}, publisher = {Springer}, year = {2013}, url = {https://doi.org/10.1007/978-3-642-45043-3\_15}, doi = {10.1007/978-3-642-45043-3\_15}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/ChiarelliM13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/CochefertCGKP13, author = {Manfred Cochefert and Jean{-}Fran{\c{c}}ois Couturier and Petr A. Golovach and Dieter Kratsch and Dani{\"{e}}l Paulusma}, editor = {Andreas Brandst{\"{a}}dt and Klaus Jansen and R{\"{u}}diger Reischuk}, title = {Sparse Square Roots}, booktitle = {Graph-Theoretic Concepts in Computer Science - 39th International Workshop, {WG} 2013, L{\"{u}}beck, Germany, June 19-21, 2013, Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {8165}, pages = {177--188}, publisher = {Springer}, year = {2013}, url = {https://doi.org/10.1007/978-3-642-45043-3\_16}, doi = {10.1007/978-3-642-45043-3\_16}, timestamp = {Sun, 25 Oct 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/CochefertCGKP13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/CookESW13, author = {Kathryn Cook and Elaine M. Eschen and R. Sritharan and Xiaoqiang Wang}, editor = {Andreas Brandst{\"{a}}dt and Klaus Jansen and R{\"{u}}diger Reischuk}, title = {Completing Colored Graphs to Meet a Target Property}, booktitle = {Graph-Theoretic Concepts in Computer Science - 39th International Workshop, {WG} 2013, L{\"{u}}beck, Germany, June 19-21, 2013, Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {8165}, pages = {189--200}, publisher = {Springer}, year = {2013}, url = {https://doi.org/10.1007/978-3-642-45043-3\_17}, doi = {10.1007/978-3-642-45043-3\_17}, timestamp = {Wed, 12 Jan 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/wg/CookESW13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/DabrowskiGP13, author = {Konrad K. Dabrowski and Petr A. Golovach and Dani{\"{e}}l Paulusma}, editor = {Andreas Brandst{\"{a}}dt and Klaus Jansen and R{\"{u}}diger Reischuk}, title = {Colouring of Graphs with Ramsey-Type Forbidden Subgraphs}, booktitle = {Graph-Theoretic Concepts in Computer Science - 39th International Workshop, {WG} 2013, L{\"{u}}beck, Germany, June 19-21, 2013, Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {8165}, pages = {201--212}, publisher = {Springer}, year = {2013}, url = {https://doi.org/10.1007/978-3-642-45043-3\_18}, doi = {10.1007/978-3-642-45043-3\_18}, timestamp = {Sat, 05 Sep 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/DabrowskiGP13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/DoerrRS13, author = {Carola Doerr and G. Ramakrishna and Jens M. Schmidt}, editor = {Andreas Brandst{\"{a}}dt and Klaus Jansen and R{\"{u}}diger Reischuk}, title = {Computing Minimum Cycle Bases in Weighted Partial 2-Trees in Linear Time}, booktitle = {Graph-Theoretic Concepts in Computer Science - 39th International Workshop, {WG} 2013, L{\"{u}}beck, Germany, June 19-21, 2013, Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {8165}, pages = {225--236}, publisher = {Springer}, year = {2013}, url = {https://doi.org/10.1007/978-3-642-45043-3\_20}, doi = {10.1007/978-3-642-45043-3\_20}, timestamp = {Sun, 25 Jul 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/DoerrRS13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/Dragan13, author = {Feodor F. Dragan}, editor = {Andreas Brandst{\"{a}}dt and Klaus Jansen and R{\"{u}}diger Reischuk}, title = {Tree-Like Structures in Graphs: {A} Metric Point of View}, booktitle = {Graph-Theoretic Concepts in Computer Science - 39th International Workshop, {WG} 2013, L{\"{u}}beck, Germany, June 19-21, 2013, Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {8165}, pages = {1--4}, publisher = {Springer}, year = {2013}, url = {https://doi.org/10.1007/978-3-642-45043-3\_1}, doi = {10.1007/978-3-642-45043-3\_1}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/Dragan13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/DurocherGM13, author = {Stephane Durocher and Ellen Gethner and Debajyoti Mondal}, editor = {Andreas Brandst{\"{a}}dt and Klaus Jansen and R{\"{u}}diger Reischuk}, title = {Thickness and Colorability of Geometric Graphs}, booktitle = {Graph-Theoretic Concepts in Computer Science - 39th International Workshop, {WG} 2013, L{\"{u}}beck, Germany, June 19-21, 2013, Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {8165}, pages = {237--248}, publisher = {Springer}, year = {2013}, url = {https://doi.org/10.1007/978-3-642-45043-3\_21}, doi = {10.1007/978-3-642-45043-3\_21}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/DurocherGM13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/FariaFRV13, author = {Lu{\'{e}}rbio Faria and Celina M. H. de Figueiredo and R. Bruce Richter and Imrich Vrto}, editor = {Andreas Brandst{\"{a}}dt and Klaus Jansen and R{\"{u}}diger Reischuk}, title = {The Same Upper Bound for Both: The 2-Page and the Rectilinear Crossing Numbers of the n-Cube}, booktitle = {Graph-Theoretic Concepts in Computer Science - 39th International Workshop, {WG} 2013, L{\"{u}}beck, Germany, June 19-21, 2013, Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {8165}, pages = {249--260}, publisher = {Springer}, year = {2013}, url = {https://doi.org/10.1007/978-3-642-45043-3\_22}, doi = {10.1007/978-3-642-45043-3\_22}, timestamp = {Sat, 19 Oct 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/FariaFRV13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/FellowsJ13, author = {Michael R. Fellows and Bart M. P. Jansen}, editor = {Andreas Brandst{\"{a}}dt and Klaus Jansen and R{\"{u}}diger Reischuk}, title = {{FPT} Is Characterized by Useful Obstruction Sets}, booktitle = {Graph-Theoretic Concepts in Computer Science - 39th International Workshop, {WG} 2013, L{\"{u}}beck, Germany, June 19-21, 2013, Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {8165}, pages = {261--273}, publisher = {Springer}, year = {2013}, url = {https://doi.org/10.1007/978-3-642-45043-3\_23}, doi = {10.1007/978-3-642-45043-3\_23}, timestamp = {Wed, 14 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/wg/FellowsJ13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/GiacomoLM13, author = {Emilio Di Giacomo and Giuseppe Liotta and Tamara Mchedlidze}, editor = {Andreas Brandst{\"{a}}dt and Klaus Jansen and R{\"{u}}diger Reischuk}, title = {Lower and Upper Bounds for Long Induced Paths in 3-Connected Planar Graphs}, booktitle = {Graph-Theoretic Concepts in Computer Science - 39th International Workshop, {WG} 2013, L{\"{u}}beck, Germany, June 19-21, 2013, Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {8165}, pages = {213--224}, publisher = {Springer}, year = {2013}, url = {https://doi.org/10.1007/978-3-642-45043-3\_19}, doi = {10.1007/978-3-642-45043-3\_19}, timestamp = {Sun, 02 Oct 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/GiacomoLM13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/GiannopoulouKT13, author = {Archontia C. Giannopoulou and Marcin Kaminski and Dimitrios M. Thilikos}, editor = {Andreas Brandst{\"{a}}dt and Klaus Jansen and R{\"{u}}diger Reischuk}, title = {Excluding Graphs as Immersions in Surface Embedded Graphs}, booktitle = {Graph-Theoretic Concepts in Computer Science - 39th International Workshop, {WG} 2013, L{\"{u}}beck, Germany, June 19-21, 2013, Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {8165}, pages = {274--285}, publisher = {Springer}, year = {2013}, url = {https://doi.org/10.1007/978-3-642-45043-3\_24}, doi = {10.1007/978-3-642-45043-3\_24}, timestamp = {Wed, 30 Aug 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/GiannopoulouKT13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/Gille13, author = {Marc Gill{\'{e}}}, editor = {Andreas Brandst{\"{a}}dt and Klaus Jansen and R{\"{u}}diger Reischuk}, title = {OBDD-Based Representation of Interval Graphs}, booktitle = {Graph-Theoretic Concepts in Computer Science - 39th International Workshop, {WG} 2013, L{\"{u}}beck, Germany, June 19-21, 2013, Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {8165}, pages = {286--297}, publisher = {Springer}, year = {2013}, url = {https://doi.org/10.1007/978-3-642-45043-3\_25}, doi = {10.1007/978-3-642-45043-3\_25}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/Gille13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/HanauerBA13, author = {Kathrin Hanauer and Franz{-}Josef Brandenburg and Christopher Auer}, editor = {Andreas Brandst{\"{a}}dt and Klaus Jansen and R{\"{u}}diger Reischuk}, title = {Tight Upper Bounds for Minimum Feedback Arc Sets of Regular Graphs}, booktitle = {Graph-Theoretic Concepts in Computer Science - 39th International Workshop, {WG} 2013, L{\"{u}}beck, Germany, June 19-21, 2013, Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {8165}, pages = {298--309}, publisher = {Springer}, year = {2013}, url = {https://doi.org/10.1007/978-3-642-45043-3\_26}, doi = {10.1007/978-3-642-45043-3\_26}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/HanauerBA13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/Kammer13, author = {Frank Kammer}, editor = {Andreas Brandst{\"{a}}dt and Klaus Jansen and R{\"{u}}diger Reischuk}, title = {A Linear-Time Kernelization for the Rooted k-Leaf Outbranching Problem}, booktitle = {Graph-Theoretic Concepts in Computer Science - 39th International Workshop, {WG} 2013, L{\"{u}}beck, Germany, June 19-21, 2013, Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {8165}, pages = {310--320}, publisher = {Springer}, year = {2013}, url = {https://doi.org/10.1007/978-3-642-45043-3\_27}, doi = {10.1007/978-3-642-45043-3\_27}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/Kammer13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/KloksW13, author = {Ton Kloks and Yue{-}Li Wang}, editor = {Andreas Brandst{\"{a}}dt and Klaus Jansen and R{\"{u}}diger Reischuk}, title = {On Retracts, Absolute Retracts, and Folds in Cographs}, booktitle = {Graph-Theoretic Concepts in Computer Science - 39th International Workshop, {WG} 2013, L{\"{u}}beck, Germany, June 19-21, 2013, Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {8165}, pages = {321--332}, publisher = {Springer}, year = {2013}, url = {https://doi.org/10.1007/978-3-642-45043-3\_28}, doi = {10.1007/978-3-642-45043-3\_28}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/KloksW13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/KrawczykPW13, author = {Tomasz Krawczyk and Arkadiusz Pawlik and Bartosz Walczak}, editor = {Andreas Brandst{\"{a}}dt and Klaus Jansen and R{\"{u}}diger Reischuk}, title = {Coloring Triangle-Free Rectangular Frame Intersection Graphs with O(loglogn) Colors}, booktitle = {Graph-Theoretic Concepts in Computer Science - 39th International Workshop, {WG} 2013, L{\"{u}}beck, Germany, June 19-21, 2013, Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {8165}, pages = {333--344}, publisher = {Springer}, year = {2013}, url = {https://doi.org/10.1007/978-3-642-45043-3\_29}, doi = {10.1007/978-3-642-45043-3\_29}, timestamp = {Mon, 05 Jun 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/KrawczykPW13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/LindzeyM13, author = {Nathan Lindzey and Ross M. McConnell}, editor = {Andreas Brandst{\"{a}}dt and Klaus Jansen and R{\"{u}}diger Reischuk}, title = {On Finding Tucker Submatrices and Lekkerkerker-Boland Subgraphs}, booktitle = {Graph-Theoretic Concepts in Computer Science - 39th International Workshop, {WG} 2013, L{\"{u}}beck, Germany, June 19-21, 2013, Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {8165}, pages = {345--357}, publisher = {Springer}, year = {2013}, url = {https://doi.org/10.1007/978-3-642-45043-3\_30}, doi = {10.1007/978-3-642-45043-3\_30}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/LindzeyM13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/MehlhornNS13, author = {Kurt Mehlhorn and Adrian Neumann and Jens M. Schmidt}, editor = {Andreas Brandst{\"{a}}dt and Klaus Jansen and R{\"{u}}diger Reischuk}, title = {Certifying 3-Edge-Connectivity}, booktitle = {Graph-Theoretic Concepts in Computer Science - 39th International Workshop, {WG} 2013, L{\"{u}}beck, Germany, June 19-21, 2013, Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {8165}, pages = {358--369}, publisher = {Springer}, year = {2013}, url = {https://doi.org/10.1007/978-3-642-45043-3\_31}, doi = {10.1007/978-3-642-45043-3\_31}, timestamp = {Fri, 02 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/wg/MehlhornNS13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/MisraPRRS13, author = {Neeldhara Misra and Fahad Panolan and Ashutosh Rai and Venkatesh Raman and Saket Saurabh}, editor = {Andreas Brandst{\"{a}}dt and Klaus Jansen and R{\"{u}}diger Reischuk}, title = {Parameterized Algorithms for Max Colorable Induced Subgraph Problem on Perfect Graphs}, booktitle = {Graph-Theoretic Concepts in Computer Science - 39th International Workshop, {WG} 2013, L{\"{u}}beck, Germany, June 19-21, 2013, Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {8165}, pages = {370--381}, publisher = {Springer}, year = {2013}, url = {https://doi.org/10.1007/978-3-642-45043-3\_32}, doi = {10.1007/978-3-642-45043-3\_32}, timestamp = {Fri, 27 Dec 2019 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/wg/MisraPRRS13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/NevriesR13, author = {Ragnar Nevries and Christian Rosenke}, editor = {Andreas Brandst{\"{a}}dt and Klaus Jansen and R{\"{u}}diger Reischuk}, title = {Characterizing and Computing the Structure of Clique Intersections in Strongly Chordal Graphs}, booktitle = {Graph-Theoretic Concepts in Computer Science - 39th International Workshop, {WG} 2013, L{\"{u}}beck, Germany, June 19-21, 2013, Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {8165}, pages = {382--393}, publisher = {Springer}, year = {2013}, url = {https://doi.org/10.1007/978-3-642-45043-3\_33}, doi = {10.1007/978-3-642-45043-3\_33}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/NevriesR13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/Schulz13, author = {Andr{\'{e}} Schulz}, editor = {Andreas Brandst{\"{a}}dt and Klaus Jansen and R{\"{u}}diger Reischuk}, title = {Drawing Graphs with Few Arcs}, booktitle = {Graph-Theoretic Concepts in Computer Science - 39th International Workshop, {WG} 2013, L{\"{u}}beck, Germany, June 19-21, 2013, Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {8165}, pages = {406--417}, publisher = {Springer}, year = {2013}, url = {https://doi.org/10.1007/978-3-642-45043-3\_35}, doi = {10.1007/978-3-642-45043-3\_35}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/Schulz13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/Svensson13, author = {Ola Svensson}, editor = {Andreas Brandst{\"{a}}dt and Klaus Jansen and R{\"{u}}diger Reischuk}, title = {Overview of New Approaches for Approximating {TSP}}, booktitle = {Graph-Theoretic Concepts in Computer Science - 39th International Workshop, {WG} 2013, L{\"{u}}beck, Germany, June 19-21, 2013, Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {8165}, pages = {5--11}, publisher = {Springer}, year = {2013}, url = {https://doi.org/10.1007/978-3-642-45043-3\_2}, doi = {10.1007/978-3-642-45043-3\_2}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/Svensson13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/TelleV13, author = {Jan Arne Telle and Yngve Villanger}, editor = {Andreas Brandst{\"{a}}dt and Klaus Jansen and R{\"{u}}diger Reischuk}, title = {Connecting Terminals and 2-Disjoint Connected Subgraphs}, booktitle = {Graph-Theoretic Concepts in Computer Science - 39th International Workshop, {WG} 2013, L{\"{u}}beck, Germany, June 19-21, 2013, Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {8165}, pages = {418--428}, publisher = {Springer}, year = {2013}, url = {https://doi.org/10.1007/978-3-642-45043-3\_36}, doi = {10.1007/978-3-642-45043-3\_36}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/TelleV13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@proceedings{DBLP:conf/wg/2013, editor = {Andreas Brandst{\"{a}}dt and Klaus Jansen and R{\"{u}}diger Reischuk}, title = {Graph-Theoretic Concepts in Computer Science - 39th International Workshop, {WG} 2013, L{\"{u}}beck, Germany, June 19-21, 2013, Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {8165}, publisher = {Springer}, year = {2013}, url = {https://doi.org/10.1007/978-3-642-45043-3}, doi = {10.1007/978-3-642-45043-3}, isbn = {978-3-642-45042-6}, timestamp = {Tue, 14 May 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/2013.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/AuerBBGH12, author = {Christopher Auer and Christian Bachmaier and Franz{-}Josef Brandenburg and Andreas Glei{\ss}ner and Kathrin Hanauer}, editor = {Martin Charles Golumbic and Michal Stern and Avivit Levy and Gila Morgenstern}, title = {The Duals of Upward Planar Graphs on Cylinders}, booktitle = {Graph-Theoretic Concepts in Computer Science - 38th International Workshop, {WG} 2012, Jerusalem, Israel, June 26-28, 2012, Revised Selcted Papers}, series = {Lecture Notes in Computer Science}, volume = {7551}, pages = {103--113}, publisher = {Springer}, year = {2012}, url = {https://doi.org/10.1007/978-3-642-34611-8\_13}, doi = {10.1007/978-3-642-34611-8\_13}, timestamp = {Thu, 14 Oct 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/AuerBBGH12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/BerendS12, author = {Daniel Berend and Amir Sapir}, editor = {Martin Charles Golumbic and Michal Stern and Avivit Levy and Gila Morgenstern}, title = {Which Multi-peg Tower of Hanoi Problems Are Exponential?}, booktitle = {Graph-Theoretic Concepts in Computer Science - 38th International Workshop, {WG} 2012, Jerusalem, Israel, June 26-28, 2012, Revised Selcted Papers}, series = {Lecture Notes in Computer Science}, volume = {7551}, pages = {81--90}, publisher = {Springer}, year = {2012}, url = {https://doi.org/10.1007/978-3-642-34611-8\_11}, doi = {10.1007/978-3-642-34611-8\_11}, timestamp = {Sat, 19 Oct 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/BerendS12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/BerryW12, author = {Anne Berry and Annegret Wagler}, editor = {Martin Charles Golumbic and Michal Stern and Avivit Levy and Gila Morgenstern}, title = {Triangulation and Clique Separator Decomposition of Claw-Free Graphs}, booktitle = {Graph-Theoretic Concepts in Computer Science - 38th International Workshop, {WG} 2012, Jerusalem, Israel, June 26-28, 2012, Revised Selcted Papers}, series = {Lecture Notes in Computer Science}, volume = {7551}, pages = {7--21}, publisher = {Springer}, year = {2012}, url = {https://doi.org/10.1007/978-3-642-34611-8\_5}, doi = {10.1007/978-3-642-34611-8\_5}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/BerryW12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/Bhattacharya12, author = {Amitava Bhattacharya}, editor = {Martin Charles Golumbic and Michal Stern and Avivit Levy and Gila Morgenstern}, title = {Alternating Reachability and Integer Sum of Closed Alternating Trails - The 3rd Annual Uri N. Peled Memorial Lecture}, booktitle = {Graph-Theoretic Concepts in Computer Science - 38th International Workshop, {WG} 2012, Jerusalem, Israel, June 26-28, 2012, Revised Selcted Papers}, series = {Lecture Notes in Computer Science}, volume = {7551}, pages = {3}, publisher = {Springer}, year = {2012}, url = {https://doi.org/10.1007/978-3-642-34611-8\_3}, doi = {10.1007/978-3-642-34611-8\_3}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/Bhattacharya12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/BiroBGKP12, author = {P{\'{e}}ter Bir{\'{o}} and Matthijs Bomhoff and Petr A. Golovach and Walter Kern and Dani{\"{e}}l Paulusma}, editor = {Martin Charles Golumbic and Michal Stern and Avivit Levy and Gila Morgenstern}, title = {Solutions for the Stable Roommates Problem with Payments}, booktitle = {Graph-Theoretic Concepts in Computer Science - 38th International Workshop, {WG} 2012, Jerusalem, Israel, June 26-28, 2012, Revised Selcted Papers}, series = {Lecture Notes in Computer Science}, volume = {7551}, pages = {69--80}, publisher = {Springer}, year = {2012}, url = {https://doi.org/10.1007/978-3-642-34611-8\_10}, doi = {10.1007/978-3-642-34611-8\_10}, timestamp = {Fri, 09 Feb 2024 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/wg/BiroBGKP12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/BonomoOS12, author = {Flavia Bonomo and Gianpaolo Oriolo and Claudia Snels}, editor = {Martin Charles Golumbic and Michal Stern and Avivit Levy and Gila Morgenstern}, title = {Minimum Weighted Clique Cover on Strip-Composed Perfect Graphs}, booktitle = {Graph-Theoretic Concepts in Computer Science - 38th International Workshop, {WG} 2012, Jerusalem, Israel, June 26-28, 2012, Revised Selcted Papers}, series = {Lecture Notes in Computer Science}, volume = {7551}, pages = {22--33}, publisher = {Springer}, year = {2012}, url = {https://doi.org/10.1007/978-3-642-34611-8\_6}, doi = {10.1007/978-3-642-34611-8\_6}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/BonomoOS12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/BousquetGMPST12, author = {Nicolas Bousquet and Daniel Gon{\c{c}}alves and George B. Mertzios and Christophe Paul and Ignasi Sau and St{\'{e}}phan Thomass{\'{e}}}, editor = {Martin Charles Golumbic and Michal Stern and Avivit Levy and Gila Morgenstern}, title = {Parameterized Domination in Circle Graphs}, booktitle = {Graph-Theoretic Concepts in Computer Science - 38th International Workshop, {WG} 2012, Jerusalem, Israel, June 26-28, 2012, Revised Selcted Papers}, series = {Lecture Notes in Computer Science}, volume = {7551}, pages = {308--319}, publisher = {Springer}, year = {2012}, url = {https://doi.org/10.1007/978-3-642-34611-8\_31}, doi = {10.1007/978-3-642-34611-8\_31}, timestamp = {Sun, 02 Oct 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/BousquetGMPST12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/BraunschvigCP12, author = {Gilad Braunschvig and Shiri Chechik and David Peleg}, editor = {Martin Charles Golumbic and Michal Stern and Avivit Levy and Gila Morgenstern}, title = {Fault Tolerant Additive Spanners}, booktitle = {Graph-Theoretic Concepts in Computer Science - 38th International Workshop, {WG} 2012, Jerusalem, Israel, June 26-28, 2012, Revised Selcted Papers}, series = {Lecture Notes in Computer Science}, volume = {7551}, pages = {206--214}, publisher = {Springer}, year = {2012}, url = {https://doi.org/10.1007/978-3-642-34611-8\_22}, doi = {10.1007/978-3-642-34611-8\_22}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/BraunschvigCP12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/BrunettiCGLQ12, author = {Sara Brunetti and Gennaro Cordasco and Luisa Gargano and Elena Lodi and Walter Quattrociocchi}, editor = {Martin Charles Golumbic and Michal Stern and Avivit Levy and Gila Morgenstern}, title = {Minimum Weight Dynamo and Fast Opinion Spreading - (Extended Abstract)}, booktitle = {Graph-Theoretic Concepts in Computer Science - 38th International Workshop, {WG} 2012, Jerusalem, Israel, June 26-28, 2012, Revised Selcted Papers}, series = {Lecture Notes in Computer Science}, volume = {7551}, pages = {249--261}, publisher = {Springer}, year = {2012}, url = {https://doi.org/10.1007/978-3-642-34611-8\_26}, doi = {10.1007/978-3-642-34611-8\_26}, timestamp = {Tue, 07 May 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/BrunettiCGLQ12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/CentenoPRS12, author = {Carmen Cecilia Centeno and Lucia Draque Penso and Dieter Rautenbach and Vin{\'{\i}}cius Gusm{\~{a}}o Pereira de S{\'{a}}}, editor = {Martin Charles Golumbic and Michal Stern and Avivit Levy and Gila Morgenstern}, title = {Immediate versus Eventual Conversion: Comparing Geodetic and Hull Numbers in {P} 3-Convexity}, booktitle = {Graph-Theoretic Concepts in Computer Science - 38th International Workshop, {WG} 2012, Jerusalem, Israel, June 26-28, 2012, Revised Selcted Papers}, series = {Lecture Notes in Computer Science}, volume = {7551}, pages = {262--273}, publisher = {Springer}, year = {2012}, url = {https://doi.org/10.1007/978-3-642-34611-8\_27}, doi = {10.1007/978-3-642-34611-8\_27}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/CentenoPRS12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/ChaplickJKV12, author = {Steven Chaplick and V{\'{\i}}t Jel{\'{\i}}nek and Jan Kratochv{\'{\i}}l and Tom{\'{a}}s Vyskocil}, editor = {Martin Charles Golumbic and Michal Stern and Avivit Levy and Gila Morgenstern}, title = {Bend-Bounded Path Intersection Graphs: Sausages, Noodles, and Waffles on a Grill}, booktitle = {Graph-Theoretic Concepts in Computer Science - 38th International Workshop, {WG} 2012, Jerusalem, Israel, June 26-28, 2012, Revised Selcted Papers}, series = {Lecture Notes in Computer Science}, volume = {7551}, pages = {274--285}, publisher = {Springer}, year = {2012}, url = {https://doi.org/10.1007/978-3-642-34611-8\_28}, doi = {10.1007/978-3-642-34611-8\_28}, timestamp = {Sun, 25 Jul 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/ChaplickJKV12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/CyganPP12, author = {Marek Cygan and Marcin Pilipczuk and Michal Pilipczuk}, editor = {Martin Charles Golumbic and Michal Stern and Avivit Levy and Gila Morgenstern}, title = {On Group Feedback Vertex Set Parameterized by the Size of the Cutset}, booktitle = {Graph-Theoretic Concepts in Computer Science - 38th International Workshop, {WG} 2012, Jerusalem, Israel, June 26-28, 2012, Revised Selcted Papers}, series = {Lecture Notes in Computer Science}, volume = {7551}, pages = {194--205}, publisher = {Springer}, year = {2012}, url = {https://doi.org/10.1007/978-3-642-34611-8\_21}, doi = {10.1007/978-3-642-34611-8\_21}, timestamp = {Sun, 25 Jul 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/CyganPP12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/EpsteinLW12, author = {Leah Epstein and Asaf Levin and Gerhard J. Woeginger}, editor = {Martin Charles Golumbic and Michal Stern and Avivit Levy and Gila Morgenstern}, title = {The (Weighted) Metric Dimension of Graphs: Hard and Easy Cases}, booktitle = {Graph-Theoretic Concepts in Computer Science - 38th International Workshop, {WG} 2012, Jerusalem, Israel, June 26-28, 2012, Revised Selcted Papers}, series = {Lecture Notes in Computer Science}, volume = {7551}, pages = {114--125}, publisher = {Springer}, year = {2012}, url = {https://doi.org/10.1007/978-3-642-34611-8\_14}, doi = {10.1007/978-3-642-34611-8\_14}, timestamp = {Sun, 02 Oct 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/EpsteinLW12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/FrancisGO12, author = {Mathew C. Francis and Daniel Gon{\c{c}}alves and Pascal Ochem}, editor = {Martin Charles Golumbic and Michal Stern and Avivit Levy and Gila Morgenstern}, title = {The Maximum Clique Problem in Multiple Interval Graphs (Extended Abstract)}, booktitle = {Graph-Theoretic Concepts in Computer Science - 38th International Workshop, {WG} 2012, Jerusalem, Israel, June 26-28, 2012, Revised Selcted Papers}, series = {Lecture Notes in Computer Science}, volume = {7551}, pages = {57--68}, publisher = {Springer}, year = {2012}, url = {https://doi.org/10.1007/978-3-642-34611-8\_9}, doi = {10.1007/978-3-642-34611-8\_9}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/FrancisGO12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/Gavril12, author = {Fanica Gavril}, editor = {Martin Charles Golumbic and Michal Stern and Avivit Levy and Gila Morgenstern}, title = {Maximum Induced Multicliques and Complete Multipartite Subgraphs in Polygon-Circle Graphs and Circle Graphs}, booktitle = {Graph-Theoretic Concepts in Computer Science - 38th International Workshop, {WG} 2012, Jerusalem, Israel, June 26-28, 2012, Revised Selcted Papers}, series = {Lecture Notes in Computer Science}, volume = {7551}, pages = {297--307}, publisher = {Springer}, year = {2012}, url = {https://doi.org/10.1007/978-3-642-34611-8\_30}, doi = {10.1007/978-3-642-34611-8\_30}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/Gavril12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/GiacomoDLM12, author = {Emilio Di Giacomo and Walter Didimo and Giuseppe Liotta and Fabrizio Montecchiani}, editor = {Martin Charles Golumbic and Michal Stern and Avivit Levy and Gila Morgenstern}, title = {h-Quasi Planar Drawings of Bounded Treewidth Graphs in Linear Area}, booktitle = {Graph-Theoretic Concepts in Computer Science - 38th International Workshop, {WG} 2012, Jerusalem, Israel, June 26-28, 2012, Revised Selcted Papers}, series = {Lecture Notes in Computer Science}, volume = {7551}, pages = {91--102}, publisher = {Springer}, year = {2012}, url = {https://doi.org/10.1007/978-3-642-34611-8\_12}, doi = {10.1007/978-3-642-34611-8\_12}, timestamp = {Sun, 02 Jun 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/GiacomoDLM12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/GolovachHHMPP12, author = {Petr A. Golovach and Pinar Heggernes and Pim van 't Hof and Fredrik Manne and Dani{\"{e}}l Paulusma and Michal Pilipczuk}, editor = {Martin Charles Golumbic and Michal Stern and Avivit Levy and Gila Morgenstern}, title = {How to Eliminate a Graph}, booktitle = {Graph-Theoretic Concepts in Computer Science - 38th International Workshop, {WG} 2012, Jerusalem, Israel, June 26-28, 2012, Revised Selcted Papers}, series = {Lecture Notes in Computer Science}, volume = {7551}, pages = {320--331}, publisher = {Springer}, year = {2012}, url = {https://doi.org/10.1007/978-3-642-34611-8\_32}, doi = {10.1007/978-3-642-34611-8\_32}, timestamp = {Thu, 14 Oct 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/GolovachHHMPP12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/GolumbicSLM12, author = {Martin Charles Golumbic and Michal Stern and Avivit Levy and Gila Morgenstern}, editor = {Martin Charles Golumbic and Michal Stern and Avivit Levy and Gila Morgenstern}, title = {Student Poster Session}, booktitle = {Graph-Theoretic Concepts in Computer Science - 38th International Workshop, {WG} 2012, Jerusalem, Israel, June 26-28, 2012, Revised Selcted Papers}, series = {Lecture Notes in Computer Science}, volume = {7551}, pages = {4--6}, publisher = {Springer}, year = {2012}, url = {https://doi.org/10.1007/978-3-642-34611-8\_4}, doi = {10.1007/978-3-642-34611-8\_4}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/GolumbicSLM12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/HeggernesHMMV12, author = {Pinar Heggernes and Pim van 't Hof and D{\'{a}}niel Marx and Neeldhara Misra and Yngve Villanger}, editor = {Martin Charles Golumbic and Michal Stern and Avivit Levy and Gila Morgenstern}, title = {On the Parameterized Complexity of Finding Separators with Non-Hereditary Properties}, booktitle = {Graph-Theoretic Concepts in Computer Science - 38th International Workshop, {WG} 2012, Jerusalem, Israel, June 26-28, 2012, Revised Selcted Papers}, series = {Lecture Notes in Computer Science}, volume = {7551}, pages = {332--343}, publisher = {Springer}, year = {2012}, url = {https://doi.org/10.1007/978-3-642-34611-8\_33}, doi = {10.1007/978-3-642-34611-8\_33}, timestamp = {Thu, 14 Oct 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/HeggernesHMMV12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/HermelinMR12, author = {Danny Hermelin and Juli{\'{a}}n Mestre and Dror Rawitz}, editor = {Martin Charles Golumbic and Michal Stern and Avivit Levy and Gila Morgenstern}, title = {Optimization Problems in Dotted Interval Graphs}, booktitle = {Graph-Theoretic Concepts in Computer Science - 38th International Workshop, {WG} 2012, Jerusalem, Israel, June 26-28, 2012, Revised Selcted Papers}, series = {Lecture Notes in Computer Science}, volume = {7551}, pages = {46--56}, publisher = {Springer}, year = {2012}, url = {https://doi.org/10.1007/978-3-642-34611-8\_8}, doi = {10.1007/978-3-642-34611-8\_8}, timestamp = {Thu, 15 Jun 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/HermelinMR12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/HibiF12, author = {Tomoya Hibi and Toshihiro Fujito}, editor = {Martin Charles Golumbic and Michal Stern and Avivit Levy and Gila Morgenstern}, title = {Multi-rooted Greedy Approximation of Directed Steiner Trees with Applications}, booktitle = {Graph-Theoretic Concepts in Computer Science - 38th International Workshop, {WG} 2012, Jerusalem, Israel, June 26-28, 2012, Revised Selcted Papers}, series = {Lecture Notes in Computer Science}, volume = {7551}, pages = {215--224}, publisher = {Springer}, year = {2012}, url = {https://doi.org/10.1007/978-3-642-34611-8\_23}, doi = {10.1007/978-3-642-34611-8\_23}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/HibiF12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/JavelleMP12, author = {J{\'{e}}r{\^{o}}me Javelle and Mehdi Mhalla and Simon Perdrix}, editor = {Martin Charles Golumbic and Michal Stern and Avivit Levy and Gila Morgenstern}, title = {On the Minimum Degree Up to Local Complementation: Bounds and Complexity}, booktitle = {Graph-Theoretic Concepts in Computer Science - 38th International Workshop, {WG} 2012, Jerusalem, Israel, June 26-28, 2012, Revised Selcted Papers}, series = {Lecture Notes in Computer Science}, volume = {7551}, pages = {138--147}, publisher = {Springer}, year = {2012}, url = {https://doi.org/10.1007/978-3-642-34611-8\_16}, doi = {10.1007/978-3-642-34611-8\_16}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/JavelleMP12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/Junosza-SzaniawskiKLR12, author = {Konstanty Junosza{-}Szaniawski and Jan Kratochv{\'{\i}}l and Mathieu Liedloff and Pawel Rzazewski}, editor = {Martin Charles Golumbic and Michal Stern and Avivit Levy and Gila Morgenstern}, title = {Determining the L(2, 1)-Span in Polynomial Space}, booktitle = {Graph-Theoretic Concepts in Computer Science - 38th International Workshop, {WG} 2012, Jerusalem, Israel, June 26-28, 2012, Revised Selcted Papers}, series = {Lecture Notes in Computer Science}, volume = {7551}, pages = {126--137}, publisher = {Springer}, year = {2012}, url = {https://doi.org/10.1007/978-3-642-34611-8\_15}, doi = {10.1007/978-3-642-34611-8\_15}, timestamp = {Sat, 19 Oct 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/Junosza-SzaniawskiKLR12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/KowalikM12, author = {Lukasz Kowalik and Marcin Mucha}, editor = {Martin Charles Golumbic and Michal Stern and Avivit Levy and Gila Morgenstern}, title = {A 9k Kernel for Nonseparating Independent Set in Planar Graphs}, booktitle = {Graph-Theoretic Concepts in Computer Science - 38th International Workshop, {WG} 2012, Jerusalem, Israel, June 26-28, 2012, Revised Selcted Papers}, series = {Lecture Notes in Computer Science}, volume = {7551}, pages = {160--171}, publisher = {Springer}, year = {2012}, url = {https://doi.org/10.1007/978-3-642-34611-8\_18}, doi = {10.1007/978-3-642-34611-8\_18}, timestamp = {Wed, 25 Sep 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/KowalikM12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/KratschS12, author = {Stefan Kratsch and Pascal Schweitzer}, editor = {Martin Charles Golumbic and Michal Stern and Avivit Levy and Gila Morgenstern}, title = {Graph Isomorphism for Graph Classes Characterized by Two Forbidden Induced Subgraphs}, booktitle = {Graph-Theoretic Concepts in Computer Science - 38th International Workshop, {WG} 2012, Jerusalem, Israel, June 26-28, 2012, Revised Selcted Papers}, series = {Lecture Notes in Computer Science}, volume = {7551}, pages = {34--45}, publisher = {Springer}, year = {2012}, url = {https://doi.org/10.1007/978-3-642-34611-8\_7}, doi = {10.1007/978-3-642-34611-8\_7}, timestamp = {Sun, 04 Aug 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/KratschS12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/LeithauserKM12, author = {Neele Leith{\"{a}}user and Sven Oliver Krumke and Maximilian Merkert}, editor = {Martin Charles Golumbic and Michal Stern and Avivit Levy and Gila Morgenstern}, title = {Approximating Infeasible 2VPI-Systems}, booktitle = {Graph-Theoretic Concepts in Computer Science - 38th International Workshop, {WG} 2012, Jerusalem, Israel, June 26-28, 2012, Revised Selcted Papers}, series = {Lecture Notes in Computer Science}, volume = {7551}, pages = {225--236}, publisher = {Springer}, year = {2012}, url = {https://doi.org/10.1007/978-3-642-34611-8\_24}, doi = {10.1007/978-3-642-34611-8\_24}, timestamp = {Mon, 03 Jan 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/wg/LeithauserKM12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/LevitMT12, author = {Vadim E. Levit and Martin Milanic and David Tankus}, editor = {Martin Charles Golumbic and Michal Stern and Avivit Levy and Gila Morgenstern}, title = {On the Recognition of k-Equistable Graphs}, booktitle = {Graph-Theoretic Concepts in Computer Science - 38th International Workshop, {WG} 2012, Jerusalem, Israel, June 26-28, 2012, Revised Selcted Papers}, series = {Lecture Notes in Computer Science}, volume = {7551}, pages = {286--296}, publisher = {Springer}, year = {2012}, url = {https://doi.org/10.1007/978-3-642-34611-8\_29}, doi = {10.1007/978-3-642-34611-8\_29}, timestamp = {Mon, 16 Sep 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/LevitMT12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/MisraRRS12, author = {Pranabendu Misra and Venkatesh Raman and M. S. Ramanujan and Saket Saurabh}, editor = {Martin Charles Golumbic and Michal Stern and Avivit Levy and Gila Morgenstern}, title = {Parameterized Algorithms for Even Cycle Transversal}, booktitle = {Graph-Theoretic Concepts in Computer Science - 38th International Workshop, {WG} 2012, Jerusalem, Israel, June 26-28, 2012, Revised Selcted Papers}, series = {Lecture Notes in Computer Science}, volume = {7551}, pages = {172--183}, publisher = {Springer}, year = {2012}, url = {https://doi.org/10.1007/978-3-642-34611-8\_19}, doi = {10.1007/978-3-642-34611-8\_19}, timestamp = {Tue, 03 Nov 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/wg/MisraRRS12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/MnichZ12, author = {Matthias Mnich and Rico Zenklusen}, editor = {Martin Charles Golumbic and Michal Stern and Avivit Levy and Gila Morgenstern}, title = {Bisections above Tight Lower Bounds}, booktitle = {Graph-Theoretic Concepts in Computer Science - 38th International Workshop, {WG} 2012, Jerusalem, Israel, June 26-28, 2012, Revised Selcted Papers}, series = {Lecture Notes in Computer Science}, volume = {7551}, pages = {184--193}, publisher = {Springer}, year = {2012}, url = {https://doi.org/10.1007/978-3-642-34611-8\_20}, doi = {10.1007/978-3-642-34611-8\_20}, timestamp = {Thu, 15 Jun 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/MnichZ12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/Muller12, author = {Haiko M{\"{u}}ller}, editor = {Martin Charles Golumbic and Michal Stern and Avivit Levy and Gila Morgenstern}, title = {On the Stable Degree of Graphs}, booktitle = {Graph-Theoretic Concepts in Computer Science - 38th International Workshop, {WG} 2012, Jerusalem, Israel, June 26-28, 2012, Revised Selcted Papers}, series = {Lecture Notes in Computer Science}, volume = {7551}, pages = {148--159}, publisher = {Springer}, year = {2012}, url = {https://doi.org/10.1007/978-3-642-34611-8\_17}, doi = {10.1007/978-3-642-34611-8\_17}, timestamp = {Sun, 12 Nov 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/wg/Muller12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/Peleg12, author = {David Peleg}, editor = {Martin Charles Golumbic and Michal Stern and Avivit Levy and Gila Morgenstern}, title = {Constructing Resilient Structures in Graphs: Rigid vs. Competitive Fault-Tolerance}, booktitle = {Graph-Theoretic Concepts in Computer Science - 38th International Workshop, {WG} 2012, Jerusalem, Israel, June 26-28, 2012, Revised Selcted Papers}, series = {Lecture Notes in Computer Science}, volume = {7551}, pages = {2}, publisher = {Springer}, year = {2012}, url = {https://doi.org/10.1007/978-3-642-34611-8\_2}, doi = {10.1007/978-3-642-34611-8\_2}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/Peleg12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/Rautenbach12, author = {Dieter Rautenbach}, editor = {Martin Charles Golumbic and Michal Stern and Avivit Levy and Gila Morgenstern}, title = {Account on Intervals}, booktitle = {Graph-Theoretic Concepts in Computer Science - 38th International Workshop, {WG} 2012, Jerusalem, Israel, June 26-28, 2012, Revised Selcted Papers}, series = {Lecture Notes in Computer Science}, volume = {7551}, pages = {1}, publisher = {Springer}, year = {2012}, url = {https://doi.org/10.1007/978-3-642-34611-8\_1}, doi = {10.1007/978-3-642-34611-8\_1}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/Rautenbach12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/SloanST12, author = {Robert H. Sloan and Despina Stasi and Gy{\"{o}}rgy Tur{\'{a}}n}, editor = {Martin Charles Golumbic and Michal Stern and Avivit Levy and Gila Morgenstern}, title = {Hydras: Directed Hypergraphs and Horn Formulas}, booktitle = {Graph-Theoretic Concepts in Computer Science - 38th International Workshop, {WG} 2012, Jerusalem, Israel, June 26-28, 2012, Revised Selcted Papers}, series = {Lecture Notes in Computer Science}, volume = {7551}, pages = {237--248}, publisher = {Springer}, year = {2012}, url = {https://doi.org/10.1007/978-3-642-34611-8\_25}, doi = {10.1007/978-3-642-34611-8\_25}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/SloanST12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@proceedings{DBLP:conf/wg/2012, editor = {Martin Charles Golumbic and Michal Stern and Avivit Levy and Gila Morgenstern}, title = {Graph-Theoretic Concepts in Computer Science - 38th International Workshop, {WG} 2012, Jerusalem, Israel, June 26-28, 2012, Revised Selcted Papers}, series = {Lecture Notes in Computer Science}, volume = {7551}, publisher = {Springer}, year = {2012}, url = {https://doi.org/10.1007/978-3-642-34611-8}, doi = {10.1007/978-3-642-34611-8}, isbn = {978-3-642-34610-1}, timestamp = {Tue, 14 May 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/2012.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/AlconFFG11, author = {Liliana Alc{\'{o}}n and Lu{\'{e}}rbio Faria and Celina M. H. de Figueiredo and Marisa Gutierrez}, editor = {Petr Kolman and Jan Kratochv{\'{\i}}l}, title = {Split Clique Graph Complexity}, booktitle = {Graph-Theoretic Concepts in Computer Science - 37th International Workshop, {WG} 2011, Tepl{\'{a}} Monastery, Czech Republic, June 21-24, 2011. Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {6986}, pages = {11--22}, publisher = {Springer}, year = {2011}, url = {https://doi.org/10.1007/978-3-642-25870-1\_3}, doi = {10.1007/978-3-642-25870-1\_3}, timestamp = {Sat, 19 Oct 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/AlconFFG11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/ArendsOW11, author = {Felix Arends and Jo{\"{e}}l Ouaknine and Charles W. Wampler}, editor = {Petr Kolman and Jan Kratochv{\'{\i}}l}, title = {On Searching for Small Kochen-Specker Vector Systems}, booktitle = {Graph-Theoretic Concepts in Computer Science - 37th International Workshop, {WG} 2011, Tepl{\'{a}} Monastery, Czech Republic, June 21-24, 2011. Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {6986}, pages = {23--34}, publisher = {Springer}, year = {2011}, url = {https://doi.org/10.1007/978-3-642-25870-1\_4}, doi = {10.1007/978-3-642-25870-1\_4}, timestamp = {Mon, 05 Jun 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/ArendsOW11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/AuerG11, author = {Christopher Auer and Andreas Glei{\ss}ner}, editor = {Petr Kolman and Jan Kratochv{\'{\i}}l}, title = {Characterizations of Deque and Queue Graphs}, booktitle = {Graph-Theoretic Concepts in Computer Science - 37th International Workshop, {WG} 2011, Tepl{\'{a}} Monastery, Czech Republic, June 21-24, 2011. Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {6986}, pages = {35--46}, publisher = {Springer}, year = {2011}, url = {https://doi.org/10.1007/978-3-642-25870-1\_5}, doi = {10.1007/978-3-642-25870-1\_5}, timestamp = {Thu, 14 Oct 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/AuerG11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/BelmonteV11, author = {R{\'{e}}my Belmonte and Martin Vatshelle}, editor = {Petr Kolman and Jan Kratochv{\'{\i}}l}, title = {Graph Classes with Structured Neighborhoods and Algorithmic Applications}, booktitle = {Graph-Theoretic Concepts in Computer Science - 37th International Workshop, {WG} 2011, Tepl{\'{a}} Monastery, Czech Republic, June 21-24, 2011. Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {6986}, pages = {47--58}, publisher = {Springer}, year = {2011}, url = {https://doi.org/10.1007/978-3-642-25870-1\_6}, doi = {10.1007/978-3-642-25870-1\_6}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/BelmonteV11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/BilkaJKTV11, author = {Ondrej B{\'{\i}}lka and Jozef Jir{\'{a}}sek and Pavel Klav{\'{\i}}k and Martin Tancer and Jan Volec}, editor = {Petr Kolman and Jan Kratochv{\'{\i}}l}, title = {On the Complexity of Planar Covering of Small Graphs}, booktitle = {Graph-Theoretic Concepts in Computer Science - 37th International Workshop, {WG} 2011, Tepl{\'{a}} Monastery, Czech Republic, June 21-24, 2011. Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {6986}, pages = {83--94}, publisher = {Springer}, year = {2011}, url = {https://doi.org/10.1007/978-3-642-25870-1\_9}, doi = {10.1007/978-3-642-25870-1\_9}, timestamp = {Sat, 19 Oct 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/BilkaJKTV11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/BodlaenderHW11, author = {Marijke H. L. Bodlaender and Cor A. J. Hurkens and Gerhard J. Woeginger}, editor = {Petr Kolman and Jan Kratochv{\'{\i}}l}, title = {The Cinderella Game on Holes and Anti-holes}, booktitle = {Graph-Theoretic Concepts in Computer Science - 37th International Workshop, {WG} 2011, Tepl{\'{a}} Monastery, Czech Republic, June 21-24, 2011. Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {6986}, pages = {71--82}, publisher = {Springer}, year = {2011}, url = {https://doi.org/10.1007/978-3-642-25870-1\_8}, doi = {10.1007/978-3-642-25870-1\_8}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/BodlaenderHW11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/BodlaenderK11, author = {Hans L. Bodlaender and Dieter Kratsch}, editor = {Petr Kolman and Jan Kratochv{\'{\i}}l}, title = {Exact Algorithms for Kayles}, booktitle = {Graph-Theoretic Concepts in Computer Science - 37th International Workshop, {WG} 2011, Tepl{\'{a}} Monastery, Czech Republic, June 21-24, 2011. Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {6986}, pages = {59--70}, publisher = {Springer}, year = {2011}, url = {https://doi.org/10.1007/978-3-642-25870-1\_7}, doi = {10.1007/978-3-642-25870-1\_7}, timestamp = {Sun, 02 Jun 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/BodlaenderK11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/CechlarovaJ11, author = {Katar{\'{\i}}na Cechl{\'{a}}rov{\'{a}} and Eva Jel{\'{\i}}nkov{\'{a}}}, editor = {Petr Kolman and Jan Kratochv{\'{\i}}l}, title = {Approximability of Economic Equilibrium for Housing Markets with Duplicate Houses}, booktitle = {Graph-Theoretic Concepts in Computer Science - 37th International Workshop, {WG} 2011, Tepl{\'{a}} Monastery, Czech Republic, June 21-24, 2011. Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {6986}, pages = {95--106}, publisher = {Springer}, year = {2011}, url = {https://doi.org/10.1007/978-3-642-25870-1\_10}, doi = {10.1007/978-3-642-25870-1\_10}, timestamp = {Sat, 09 Apr 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/CechlarovaJ11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/ChaplickCS11, author = {Steven Chaplick and Elad Cohen and Juraj Stacho}, editor = {Petr Kolman and Jan Kratochv{\'{\i}}l}, title = {Recognizing Some Subclasses of Vertex Intersection Graphs of 0-Bend Paths in a Grid}, booktitle = {Graph-Theoretic Concepts in Computer Science - 37th International Workshop, {WG} 2011, Tepl{\'{a}} Monastery, Czech Republic, June 21-24, 2011. Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {6986}, pages = {319--330}, publisher = {Springer}, year = {2011}, url = {https://doi.org/10.1007/978-3-642-25870-1\_29}, doi = {10.1007/978-3-642-25870-1\_29}, timestamp = {Mon, 05 Jun 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/ChaplickCS11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/ChengMS11, author = {Christine T. Cheng and Eric McDermid and Ichiro Suzuki}, editor = {Petr Kolman and Jan Kratochv{\'{\i}}l}, title = {Planarization and Acyclic Colorings of Subcubic Claw-Free Graphs}, booktitle = {Graph-Theoretic Concepts in Computer Science - 37th International Workshop, {WG} 2011, Tepl{\'{a}} Monastery, Czech Republic, June 21-24, 2011. Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {6986}, pages = {107--118}, publisher = {Springer}, year = {2011}, url = {https://doi.org/10.1007/978-3-642-25870-1\_11}, doi = {10.1007/978-3-642-25870-1\_11}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/ChengMS11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/CouturierGKP11, author = {Jean{-}Fran{\c{c}}ois Couturier and Petr A. Golovach and Dieter Kratsch and Dani{\"{e}}l Paulusma}, editor = {Petr Kolman and Jan Kratochv{\'{\i}}l}, title = {List Coloring in the Absence of a Linear Forest}, booktitle = {Graph-Theoretic Concepts in Computer Science - 37th International Workshop, {WG} 2011, Tepl{\'{a}} Monastery, Czech Republic, June 21-24, 2011. Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {6986}, pages = {119--130}, publisher = {Springer}, year = {2011}, url = {https://doi.org/10.1007/978-3-642-25870-1\_12}, doi = {10.1007/978-3-642-25870-1\_12}, timestamp = {Sun, 25 Oct 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/CouturierGKP11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/CyganMPPS11, author = {Marek Cygan and D{\'{a}}niel Marx and Marcin Pilipczuk and Michal Pilipczuk and Ildik{\'{o}} Schlotter}, editor = {Petr Kolman and Jan Kratochv{\'{\i}}l}, title = {Parameterized Complexity of Eulerian Deletion Problems}, booktitle = {Graph-Theoretic Concepts in Computer Science - 37th International Workshop, {WG} 2011, Tepl{\'{a}} Monastery, Czech Republic, June 21-24, 2011. Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {6986}, pages = {131--142}, publisher = {Springer}, year = {2011}, url = {https://doi.org/10.1007/978-3-642-25870-1\_13}, doi = {10.1007/978-3-642-25870-1\_13}, timestamp = {Sun, 25 Jul 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/CyganMPPS11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/FeldmannDW11, author = {Andreas Emil Feldmann and Shantanu Das and Peter Widmayer}, editor = {Petr Kolman and Jan Kratochv{\'{\i}}l}, title = {Restricted Cuts for Bisections in Solid Grids: {A} Proof via Polygons}, booktitle = {Graph-Theoretic Concepts in Computer Science - 37th International Workshop, {WG} 2011, Tepl{\'{a}} Monastery, Czech Republic, June 21-24, 2011. Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {6986}, pages = {143--154}, publisher = {Springer}, year = {2011}, url = {https://doi.org/10.1007/978-3-642-25870-1\_14}, doi = {10.1007/978-3-642-25870-1\_14}, timestamp = {Thu, 15 Jun 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/FeldmannDW11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/FlierMWZ11, author = {Holger Flier and Mat{\'{u}}s Mihal{\'{a}}k and Peter Widmayer and Anna Zych}, editor = {Petr Kolman and Jan Kratochv{\'{\i}}l}, title = {Maximum Independent Set in 2-Direction Outersegment Graphs}, booktitle = {Graph-Theoretic Concepts in Computer Science - 37th International Workshop, {WG} 2011, Tepl{\'{a}} Monastery, Czech Republic, June 21-24, 2011. Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {6986}, pages = {155--166}, publisher = {Springer}, year = {2011}, url = {https://doi.org/10.1007/978-3-642-25870-1\_15}, doi = {10.1007/978-3-642-25870-1\_15}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/FlierMWZ11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/FulekPSS11, author = {Radoslav Fulek and Michael J. Pelsmajer and Marcus Schaefer and Daniel Stefankovic}, editor = {Petr Kolman and Jan Kratochv{\'{\i}}l}, title = {Hanani-Tutte and Monotone Drawings}, booktitle = {Graph-Theoretic Concepts in Computer Science - 37th International Workshop, {WG} 2011, Tepl{\'{a}} Monastery, Czech Republic, June 21-24, 2011. Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {6986}, pages = {283--294}, publisher = {Springer}, year = {2011}, url = {https://doi.org/10.1007/978-3-642-25870-1\_26}, doi = {10.1007/978-3-642-25870-1\_26}, timestamp = {Thu, 17 Jun 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/FulekPSS11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/GalcikKS11, author = {Frantisek Galc{\'{\i}}k and J{\'{a}}n Katrenic and Gabriel Semanisin}, editor = {Petr Kolman and Jan Kratochv{\'{\i}}l}, title = {On Computing an Optimal Semi-matching}, booktitle = {Graph-Theoretic Concepts in Computer Science - 37th International Workshop, {WG} 2011, Tepl{\'{a}} Monastery, Czech Republic, June 21-24, 2011. Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {6986}, pages = {250--261}, publisher = {Springer}, year = {2011}, url = {https://doi.org/10.1007/978-3-642-25870-1\_23}, doi = {10.1007/978-3-642-25870-1\_23}, timestamp = {Mon, 05 Jun 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/GalcikKS11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/GaspersLSS11, author = {Serge Gaspers and Mathieu Liedloff and Maya Stein and Karol Suchan}, editor = {Petr Kolman and Jan Kratochv{\'{\i}}l}, title = {Complexity of Splits Reconstruction for Low-Degree Trees}, booktitle = {Graph-Theoretic Concepts in Computer Science - 37th International Workshop, {WG} 2011, Tepl{\'{a}} Monastery, Czech Republic, June 21-24, 2011. Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {6986}, pages = {167--178}, publisher = {Springer}, year = {2011}, url = {https://doi.org/10.1007/978-3-642-25870-1\_16}, doi = {10.1007/978-3-642-25870-1\_16}, timestamp = {Sat, 05 Sep 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/GaspersLSS11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/HalldorssonKP11, author = {Magn{\'{u}}s M. Halld{\'{o}}rsson and Sergey Kitaev and Artem V. Pyatkin}, editor = {Petr Kolman and Jan Kratochv{\'{\i}}l}, title = {Alternation Graphs}, booktitle = {Graph-Theoretic Concepts in Computer Science - 37th International Workshop, {WG} 2011, Tepl{\'{a}} Monastery, Czech Republic, June 21-24, 2011. Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {6986}, pages = {191--202}, publisher = {Springer}, year = {2011}, url = {https://doi.org/10.1007/978-3-642-25870-1\_18}, doi = {10.1007/978-3-642-25870-1\_18}, timestamp = {Sun, 25 Oct 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/HalldorssonKP11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/HasunumaN11, author = {Toru Hasunuma and Hiroshi Nagamochi}, editor = {Petr Kolman and Jan Kratochv{\'{\i}}l}, title = {Improved Bounds for Minimum Fault-Tolerant Gossip Graphs}, booktitle = {Graph-Theoretic Concepts in Computer Science - 37th International Workshop, {WG} 2011, Tepl{\'{a}} Monastery, Czech Republic, June 21-24, 2011. Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {6986}, pages = {203--214}, publisher = {Springer}, year = {2011}, url = {https://doi.org/10.1007/978-3-642-25870-1\_19}, doi = {10.1007/978-3-642-25870-1\_19}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/HasunumaN11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/HermelinHKW11, author = {Danny Hermelin and Chien{-}Chung Huang and Stefan Kratsch and Magnus Wahlstr{\"{o}}m}, editor = {Petr Kolman and Jan Kratochv{\'{\i}}l}, title = {Parameterized Two-Player Nash Equilibrium}, booktitle = {Graph-Theoretic Concepts in Computer Science - 37th International Workshop, {WG} 2011, Tepl{\'{a}} Monastery, Czech Republic, June 21-24, 2011. Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {6986}, pages = {215--226}, publisher = {Springer}, year = {2011}, url = {https://doi.org/10.1007/978-3-642-25870-1\_20}, doi = {10.1007/978-3-642-25870-1\_20}, timestamp = {Tue, 24 Jan 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/wg/HermelinHKW11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/Junosza-SzaniawskiLT11, author = {Konstanty Junosza{-}Szaniawski and Zbigniew Lonc and Michal Tuczynski}, editor = {Petr Kolman and Jan Kratochv{\'{\i}}l}, title = {Counting Independent Sets in Claw-Free Graphs}, booktitle = {Graph-Theoretic Concepts in Computer Science - 37th International Workshop, {WG} 2011, Tepl{\'{a}} Monastery, Czech Republic, June 21-24, 2011. Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {6986}, pages = {227--237}, publisher = {Springer}, year = {2011}, url = {https://doi.org/10.1007/978-3-642-25870-1\_21}, doi = {10.1007/978-3-642-25870-1\_21}, timestamp = {Sun, 25 Oct 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/Junosza-SzaniawskiLT11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/KanjZ11, author = {Iyad A. Kanj and Fenghui Zhang}, editor = {Petr Kolman and Jan Kratochv{\'{\i}}l}, title = {On the Independence Number of Graphs with Maximum Degree 3}, booktitle = {Graph-Theoretic Concepts in Computer Science - 37th International Workshop, {WG} 2011, Tepl{\'{a}} Monastery, Czech Republic, June 21-24, 2011. Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {6986}, pages = {238--249}, publisher = {Springer}, year = {2011}, url = {https://doi.org/10.1007/978-3-642-25870-1\_22}, doi = {10.1007/978-3-642-25870-1\_22}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/KanjZ11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/LokshtanovMS11, author = {Daniel Lokshtanov and Matthias Mnich and Saket Saurabh}, editor = {Petr Kolman and Jan Kratochv{\'{\i}}l}, title = {Planar k-Path in Subexponential Time and Polynomial Space}, booktitle = {Graph-Theoretic Concepts in Computer Science - 37th International Workshop, {WG} 2011, Tepl{\'{a}} Monastery, Czech Republic, June 21-24, 2011. Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {6986}, pages = {262--270}, publisher = {Springer}, year = {2011}, url = {https://doi.org/10.1007/978-3-642-25870-1\_24}, doi = {10.1007/978-3-642-25870-1\_24}, timestamp = {Mon, 30 Oct 2017 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/wg/LokshtanovMS11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/Marchetti-Spaccamela11, author = {Alberto Marchetti{-}Spaccamela}, editor = {Petr Kolman and Jan Kratochv{\'{\i}}l}, title = {Structures and Hyperstructures in Metabolic Networks}, booktitle = {Graph-Theoretic Concepts in Computer Science - 37th International Workshop, {WG} 2011, Tepl{\'{a}} Monastery, Czech Republic, June 21-24, 2011. Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {6986}, pages = {1--4}, publisher = {Springer}, year = {2011}, url = {https://doi.org/10.1007/978-3-642-25870-1\_1}, doi = {10.1007/978-3-642-25870-1\_1}, timestamp = {Sun, 04 Aug 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/Marchetti-Spaccamela11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/Marx11, author = {D{\'{a}}niel Marx}, editor = {Petr Kolman and Jan Kratochv{\'{\i}}l}, title = {Important Separators and Parameterized Algorithms}, booktitle = {Graph-Theoretic Concepts in Computer Science - 37th International Workshop, {WG} 2011, Tepl{\'{a}} Monastery, Czech Republic, June 21-24, 2011. Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {6986}, pages = {5--10}, publisher = {Springer}, year = {2011}, url = {https://doi.org/10.1007/978-3-642-25870-1\_2}, doi = {10.1007/978-3-642-25870-1\_2}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/Marx11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/McGraeZ11, author = {Andrew R. A. McGrae and Michele Zito}, editor = {Petr Kolman and Jan Kratochv{\'{\i}}l}, title = {Empires Make Cartography Hard: The Complexity of the Empire Colouring Problem}, booktitle = {Graph-Theoretic Concepts in Computer Science - 37th International Workshop, {WG} 2011, Tepl{\'{a}} Monastery, Czech Republic, June 21-24, 2011. Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {6986}, pages = {179--190}, publisher = {Springer}, year = {2011}, url = {https://doi.org/10.1007/978-3-642-25870-1\_17}, doi = {10.1007/978-3-642-25870-1\_17}, timestamp = {Fri, 16 Oct 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/McGraeZ11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/OtachiSYKOOUY11, author = {Yota Otachi and Toshiki Saitoh and Katsuhisa Yamanaka and Shuji Kijima and Yoshio Okamoto and Hirotaka Ono and Yushi Uno and Koichi Yamazaki}, editor = {Petr Kolman and Jan Kratochv{\'{\i}}l}, title = {Approximability of the Path-Distance-Width for AT-free Graphs}, booktitle = {Graph-Theoretic Concepts in Computer Science - 37th International Workshop, {WG} 2011, Tepl{\'{a}} Monastery, Czech Republic, June 21-24, 2011. Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {6986}, pages = {271--282}, publisher = {Springer}, year = {2011}, url = {https://doi.org/10.1007/978-3-642-25870-1\_25}, doi = {10.1007/978-3-642-25870-1\_25}, timestamp = {Fri, 29 Dec 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/wg/OtachiSYKOOUY11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/RavskyV11, author = {Alexander Ravsky and Oleg Verbitsky}, editor = {Petr Kolman and Jan Kratochv{\'{\i}}l}, title = {On Collinear Sets in Straight-Line Drawings}, booktitle = {Graph-Theoretic Concepts in Computer Science - 37th International Workshop, {WG} 2011, Tepl{\'{a}} Monastery, Czech Republic, June 21-24, 2011. Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {6986}, pages = {295--306}, publisher = {Springer}, year = {2011}, url = {https://doi.org/10.1007/978-3-642-25870-1\_27}, doi = {10.1007/978-3-642-25870-1\_27}, timestamp = {Thu, 13 Oct 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/RavskyV11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/SorgeBNW11, author = {Manuel Sorge and Ren{\'{e}} van Bevern and Rolf Niedermeier and Mathias Weller}, editor = {Petr Kolman and Jan Kratochv{\'{\i}}l}, title = {From Few Components to an Eulerian Graph by Adding Arcs}, booktitle = {Graph-Theoretic Concepts in Computer Science - 37th International Workshop, {WG} 2011, Tepl{\'{a}} Monastery, Czech Republic, June 21-24, 2011. Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {6986}, pages = {307--318}, publisher = {Springer}, year = {2011}, url = {https://doi.org/10.1007/978-3-642-25870-1\_28}, doi = {10.1007/978-3-642-25870-1\_28}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/SorgeBNW11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/Tamaki11, author = {Hisao Tamaki}, editor = {Petr Kolman and Jan Kratochv{\'{\i}}l}, title = {A Polynomial Time Algorithm for Bounded Directed Pathwidth}, booktitle = {Graph-Theoretic Concepts in Computer Science - 37th International Workshop, {WG} 2011, Tepl{\'{a}} Monastery, Czech Republic, June 21-24, 2011. Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {6986}, pages = {331--342}, publisher = {Springer}, year = {2011}, url = {https://doi.org/10.1007/978-3-642-25870-1\_30}, doi = {10.1007/978-3-642-25870-1\_30}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/Tamaki11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@proceedings{DBLP:conf/wg/2011, editor = {Petr Kolman and Jan Kratochv{\'{\i}}l}, title = {Graph-Theoretic Concepts in Computer Science - 37th International Workshop, {WG} 2011, Tepl{\'{a}} Monastery, Czech Republic, June 21-24, 2011. Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {6986}, publisher = {Springer}, year = {2011}, url = {https://doi.org/10.1007/978-3-642-25870-1}, doi = {10.1007/978-3-642-25870-1}, isbn = {978-3-642-25869-5}, timestamp = {Tue, 14 May 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/2011.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/Achlioptas10, author = {Dimitris Achlioptas}, editor = {Dimitrios M. Thilikos}, title = {Algorithmic Barriers from Phase Transitions in Graphs}, booktitle = {Graph Theoretic Concepts in Computer Science - 36th International Workshop, {WG} 2010, Zar{\'{o}}s, Crete, Greece, June 28-30, 2010 Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {6410}, pages = {1}, year = {2010}, url = {https://doi.org/10.1007/978-3-642-16926-7\_1}, doi = {10.1007/978-3-642-16926-7\_1}, timestamp = {Tue, 14 May 2019 10:00:40 +0200}, biburl = {https://dblp.org/rec/conf/wg/Achlioptas10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/AdlerBRRTV10, author = {Isolde Adler and Binh{-}Minh Bui{-}Xuan and Yuri Rabinovich and Gabriel Renault and Jan Arne Telle and Martin Vatshelle}, editor = {Dimitrios M. Thilikos}, title = {On the Boolean-Width of a Graph: Structure and Applications}, booktitle = {Graph Theoretic Concepts in Computer Science - 36th International Workshop, {WG} 2010, Zar{\'{o}}s, Crete, Greece, June 28-30, 2010 Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {6410}, pages = {159--170}, year = {2010}, url = {https://doi.org/10.1007/978-3-642-16926-7\_16}, doi = {10.1007/978-3-642-16926-7\_16}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/AdlerBRRTV10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/ArikushiFKMT10, author = {Karin Arikushi and Radoslav Fulek and Bal{\'{a}}zs Keszegh and Filip Moric and Csaba D. T{\'{o}}th}, editor = {Dimitrios M. Thilikos}, title = {Graphs that Admit Right Angle Crossing Drawings}, booktitle = {Graph Theoretic Concepts in Computer Science - 36th International Workshop, {WG} 2010, Zar{\'{o}}s, Crete, Greece, June 28-30, 2010 Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {6410}, pages = {135--146}, year = {2010}, url = {https://doi.org/10.1007/978-3-642-16926-7\_14}, doi = {10.1007/978-3-642-16926-7\_14}, timestamp = {Thu, 15 Jun 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/ArikushiFKMT10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/BergerM10, author = {Annabell Berger and Matthias M{\"{u}}ller{-}Hannemann}, editor = {Dimitrios M. Thilikos}, title = {Uniform Sampling of Digraphs with a Fixed Degree Sequence}, booktitle = {Graph Theoretic Concepts in Computer Science - 36th International Workshop, {WG} 2010, Zar{\'{o}}s, Crete, Greece, June 28-30, 2010 Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {6410}, pages = {220--231}, year = {2010}, url = {https://doi.org/10.1007/978-3-642-16926-7\_21}, doi = {10.1007/978-3-642-16926-7\_21}, timestamp = {Wed, 14 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/wg/BergerM10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/BevernKMN10, author = {Ren{\'{e}} van Bevern and Christian Komusiewicz and Hannes Moser and Rolf Niedermeier}, editor = {Dimitrios M. Thilikos}, title = {Measuring Indifference: Unit Interval Vertex Deletion}, booktitle = {Graph Theoretic Concepts in Computer Science - 36th International Workshop, {WG} 2010, Zar{\'{o}}s, Crete, Greece, June 28-30, 2010 Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {6410}, pages = {232--243}, year = {2010}, url = {https://doi.org/10.1007/978-3-642-16926-7\_22}, doi = {10.1007/978-3-642-16926-7\_22}, timestamp = {Mon, 05 Jun 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/BevernKMN10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/BonichonGHI10, author = {Nicolas Bonichon and Cyril Gavoille and Nicolas Hanusse and David Ilcinkas}, editor = {Dimitrios M. Thilikos}, title = {Connections between Theta-Graphs, Delaunay Triangulations, and Orthogonal Surfaces}, booktitle = {Graph Theoretic Concepts in Computer Science - 36th International Workshop, {WG} 2010, Zar{\'{o}}s, Crete, Greece, June 28-30, 2010 Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {6410}, pages = {266--278}, year = {2010}, url = {https://doi.org/10.1007/978-3-642-16926-7\_25}, doi = {10.1007/978-3-642-16926-7\_25}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/BonichonGHI10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/BroersmaGPS10, author = {Hajo Broersma and Petr A. Golovach and Dani{\"{e}}l Paulusma and Jian Song}, editor = {Dimitrios M. Thilikos}, title = {Narrowing Down the Gap on the Complexity of Coloring \emph{P}\({}_{\mbox{\emph{k}}}\)-Free Graphs}, booktitle = {Graph Theoretic Concepts in Computer Science - 36th International Workshop, {WG} 2010, Zar{\'{o}}s, Crete, Greece, June 28-30, 2010 Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {6410}, pages = {63--74}, year = {2010}, url = {https://doi.org/10.1007/978-3-642-16926-7\_8}, doi = {10.1007/978-3-642-16926-7\_8}, timestamp = {Tue, 21 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/wg/BroersmaGPS10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/ChalopinFMS10, author = {J{\'{e}}r{\'{e}}mie Chalopin and Paola Flocchini and Bernard Mans and Nicola Santoro}, editor = {Dimitrios M. Thilikos}, title = {Network Exploration by Silent and Oblivious Robots}, booktitle = {Graph Theoretic Concepts in Computer Science - 36th International Workshop, {WG} 2010, Zar{\'{o}}s, Crete, Greece, June 28-30, 2010 Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {6410}, pages = {208--219}, year = {2010}, url = {https://doi.org/10.1007/978-3-642-16926-7\_20}, doi = {10.1007/978-3-642-16926-7\_20}, timestamp = {Tue, 07 May 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/ChalopinFMS10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/ChaplickGLT10, author = {Steven Chaplick and Marisa Gutierrez and Benjamin L{\'{e}}v{\^{e}}que and Silvia B. Tondato}, editor = {Dimitrios M. Thilikos}, title = {From Path Graphs to Directed Path Graphs}, booktitle = {Graph Theoretic Concepts in Computer Science - 36th International Workshop, {WG} 2010, Zar{\'{o}}s, Crete, Greece, June 28-30, 2010 Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {6410}, pages = {256--265}, year = {2010}, url = {https://doi.org/10.1007/978-3-642-16926-7\_24}, doi = {10.1007/978-3-642-16926-7\_24}, timestamp = {Mon, 05 Jun 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/ChaplickGLT10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/CyganPPW10, author = {Marek Cygan and Marcin Pilipczuk and Michal Pilipczuk and Jakub Onufry Wojtaszczyk}, editor = {Dimitrios M. Thilikos}, title = {Kernelization Hardness of Connectivity Problems in \emph{d}-Degenerate Graphs}, booktitle = {Graph Theoretic Concepts in Computer Science - 36th International Workshop, {WG} 2010, Zar{\'{o}}s, Crete, Greece, June 28-30, 2010 Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {6410}, pages = {147--158}, year = {2010}, url = {https://doi.org/10.1007/978-3-642-16926-7\_15}, doi = {10.1007/978-3-642-16926-7\_15}, timestamp = {Sun, 25 Jul 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/CyganPPW10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/DabrowskiLRR10, author = {Konrad K. Dabrowski and Vadim V. Lozin and Rajiv Raman and Bernard Ries}, editor = {Dimitrios M. Thilikos}, title = {Colouring Vertices of Triangle-Free Graphs}, booktitle = {Graph Theoretic Concepts in Computer Science - 36th International Workshop, {WG} 2010, Zar{\'{o}}s, Crete, Greece, June 28-30, 2010 Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {6410}, pages = {184--195}, year = {2010}, url = {https://doi.org/10.1007/978-3-642-16926-7\_18}, doi = {10.1007/978-3-642-16926-7\_18}, timestamp = {Mon, 17 Aug 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/DabrowskiLRR10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/Demaine10, author = {Erik D. Demaine}, editor = {Dimitrios M. Thilikos}, title = {Algorithmic Graph Minors and Bidimensionality}, booktitle = {Graph Theoretic Concepts in Computer Science - 36th International Workshop, {WG} 2010, Zar{\'{o}}s, Crete, Greece, June 28-30, 2010 Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {6410}, pages = {2}, year = {2010}, url = {https://doi.org/10.1007/978-3-642-16926-7\_2}, doi = {10.1007/978-3-642-16926-7\_2}, timestamp = {Tue, 26 Jun 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/Demaine10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/DornMNW10, author = {Frederic Dorn and Hannes Moser and Rolf Niedermeier and Mathias Weller}, editor = {Dimitrios M. Thilikos}, title = {Efficient Algorithms for Eulerian Extension}, booktitle = {Graph Theoretic Concepts in Computer Science - 36th International Workshop, {WG} 2010, Zar{\'{o}}s, Crete, Greece, June 28-30, 2010 Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {6410}, pages = {100--111}, year = {2010}, url = {https://doi.org/10.1007/978-3-642-16926-7\_11}, doi = {10.1007/978-3-642-16926-7\_11}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/DornMNW10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/ElsasserO10, author = {Robert Els{\"{a}}sser and Adrian Ogierman}, editor = {Dimitrios M. Thilikos}, title = {Efficient Broadcasting in Random Power Law Networks}, booktitle = {Graph Theoretic Concepts in Computer Science - 36th International Workshop, {WG} 2010, Zar{\'{o}}s, Crete, Greece, June 28-30, 2010 Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {6410}, pages = {279--291}, year = {2010}, url = {https://doi.org/10.1007/978-3-642-16926-7\_26}, doi = {10.1007/978-3-642-16926-7\_26}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/ElsasserO10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/FellowsGKPRWY10, author = {Mike Fellows and Panos Giannopoulos and Christian Knauer and Christophe Paul and Frances A. Rosamond and Sue Whitesides and Nathan Yu}, editor = {Dimitrios M. Thilikos}, title = {Milling a Graph with Turn Costs: {A} Parameterized Complexity Perspective}, booktitle = {Graph Theoretic Concepts in Computer Science - 36th International Workshop, {WG} 2010, Zar{\'{o}}s, Crete, Greece, June 28-30, 2010 Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {6410}, pages = {123--134}, year = {2010}, url = {https://doi.org/10.1007/978-3-642-16926-7\_13}, doi = {10.1007/978-3-642-16926-7\_13}, timestamp = {Wed, 14 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/wg/FellowsGKPRWY10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/Fleiner10, author = {Tam{\'{a}}s Fleiner}, editor = {Dimitrios M. Thilikos}, title = {On Stable Matchings and Flows}, booktitle = {Graph Theoretic Concepts in Computer Science - 36th International Workshop, {WG} 2010, Zar{\'{o}}s, Crete, Greece, June 28-30, 2010 Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {6410}, pages = {51--62}, year = {2010}, url = {https://doi.org/10.1007/978-3-642-16926-7\_7}, doi = {10.1007/978-3-642-16926-7\_7}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/Fleiner10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/GolovachKC10, author = {Petr A. Golovach and Dieter Kratsch and Jean{-}Fran{\c{c}}ois Couturier}, editor = {Dimitrios M. Thilikos}, title = {Colorings with Few Colors: Counting, Enumeration and Combinatorial Bounds}, booktitle = {Graph Theoretic Concepts in Computer Science - 36th International Workshop, {WG} 2010, Zar{\'{o}}s, Crete, Greece, June 28-30, 2010 Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {6410}, pages = {39--50}, year = {2010}, url = {https://doi.org/10.1007/978-3-642-16926-7\_6}, doi = {10.1007/978-3-642-16926-7\_6}, timestamp = {Fri, 02 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/wg/GolovachKC10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/HeggernesHLN10, author = {Pinar Heggernes and Pim van 't Hof and Daniel Lokshtanov and Jesper Nederlof}, editor = {Dimitrios M. Thilikos}, title = {Computing the Cutwidth of Bipartite Permutation Graphs in Linear Time}, booktitle = {Graph Theoretic Concepts in Computer Science - 36th International Workshop, {WG} 2010, Zar{\'{o}}s, Crete, Greece, June 28-30, 2010 Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {6410}, pages = {75--87}, year = {2010}, url = {https://doi.org/10.1007/978-3-642-16926-7\_9}, doi = {10.1007/978-3-642-16926-7\_9}, timestamp = {Thu, 14 Oct 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/HeggernesHLN10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/HeggernesLNPT10, author = {Pinar Heggernes and Daniel Lokshtanov and Jesper Nederlof and Christophe Paul and Jan Arne Telle}, editor = {Dimitrios M. Thilikos}, title = {Generalized Graph Clustering: Recognizing (\emph{p}, \emph{q})-Cluster Graphs}, booktitle = {Graph Theoretic Concepts in Computer Science - 36th International Workshop, {WG} 2010, Zar{\'{o}}s, Crete, Greece, June 28-30, 2010 Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {6410}, pages = {171--183}, year = {2010}, url = {https://doi.org/10.1007/978-3-642-16926-7\_17}, doi = {10.1007/978-3-642-16926-7\_17}, timestamp = {Mon, 06 Nov 2017 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/wg/HeggernesLNPT10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/IoannidouN10, author = {Kyriaki Ioannidou and Stavros D. Nikolopoulos}, editor = {Dimitrios M. Thilikos}, title = {The Longest Path Problem is Polynomial on Cocomparability Graphs}, booktitle = {Graph Theoretic Concepts in Computer Science - 36th International Workshop, {WG} 2010, Zar{\'{o}}s, Crete, Greece, June 28-30, 2010 Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {6410}, pages = {27--38}, year = {2010}, url = {https://doi.org/10.1007/978-3-642-16926-7\_5}, doi = {10.1007/978-3-642-16926-7\_5}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/IoannidouN10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/Kaminski10, author = {Marcin Kaminski}, editor = {Dimitrios M. Thilikos}, title = {max-cut and Containment Relations in Graphs}, booktitle = {Graph Theoretic Concepts in Computer Science - 36th International Workshop, {WG} 2010, Zar{\'{o}}s, Crete, Greece, June 28-30, 2010 Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {6410}, pages = {15--26}, year = {2010}, url = {https://doi.org/10.1007/978-3-642-16926-7\_4}, doi = {10.1007/978-3-642-16926-7\_4}, timestamp = {Wed, 28 Feb 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/wg/Kaminski10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/LiedloffTV10, author = {Mathieu Liedloff and Ioan Todinca and Yngve Villanger}, editor = {Dimitrios M. Thilikos}, title = {Solving Capacitated Dominating Set by Using Covering by Subsets and Maximum Matching}, booktitle = {Graph Theoretic Concepts in Computer Science - 36th International Workshop, {WG} 2010, Zar{\'{o}}s, Crete, Greece, June 28-30, 2010 Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {6410}, pages = {88--99}, year = {2010}, url = {https://doi.org/10.1007/978-3-642-16926-7\_10}, doi = {10.1007/978-3-642-16926-7\_10}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/LiedloffTV10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/MarxS10, author = {D{\'{a}}niel Marx and Ildik{\'{o}} Schlotter}, editor = {Dimitrios M. Thilikos}, title = {Parameterized Complexity of the Arc-Preserving Subsequence Problem}, booktitle = {Graph Theoretic Concepts in Computer Science - 36th International Workshop, {WG} 2010, Zar{\'{o}}s, Crete, Greece, June 28-30, 2010 Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {6410}, pages = {244--255}, year = {2010}, url = {https://doi.org/10.1007/978-3-642-16926-7\_23}, doi = {10.1007/978-3-642-16926-7\_23}, timestamp = {Mon, 26 Jun 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/MarxS10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/MatuschkeP10, author = {Jannik Matuschke and Britta Peis}, editor = {Dimitrios M. Thilikos}, title = {Lattices and Maximum Flow Algorithms in Planar Graphs}, booktitle = {Graph Theoretic Concepts in Computer Science - 36th International Workshop, {WG} 2010, Zar{\'{o}}s, Crete, Greece, June 28-30, 2010 Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {6410}, pages = {324--335}, year = {2010}, url = {https://doi.org/10.1007/978-3-642-16926-7\_30}, doi = {10.1007/978-3-642-16926-7\_30}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/MatuschkeP10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/McDiarmidM10, author = {Colin McDiarmid and Tobias M{\"{u}}ller}, editor = {Dimitrios M. Thilikos}, title = {The Number of Bits Needed to Represent a Unit Disk Graph}, booktitle = {Graph Theoretic Concepts in Computer Science - 36th International Workshop, {WG} 2010, Zar{\'{o}}s, Crete, Greece, June 28-30, 2010 Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {6410}, pages = {315--323}, year = {2010}, url = {https://doi.org/10.1007/978-3-642-16926-7\_29}, doi = {10.1007/978-3-642-16926-7\_29}, timestamp = {Tue, 27 Oct 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/wg/McDiarmidM10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/MukkamalaPS10, author = {Padmini Mukkamala and J{\'{a}}nos Pach and Deniz Sari{\"{o}}z}, editor = {Dimitrios M. Thilikos}, title = {Graphs with Large Obstacle Numbers}, booktitle = {Graph Theoretic Concepts in Computer Science - 36th International Workshop, {WG} 2010, Zar{\'{o}}s, Crete, Greece, June 28-30, 2010 Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {6410}, pages = {292--303}, year = {2010}, url = {https://doi.org/10.1007/978-3-642-16926-7\_27}, doi = {10.1007/978-3-642-16926-7\_27}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/MukkamalaPS10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/OtachiBL10, author = {Yota Otachi and Hans L. Bodlaender and Erik Jan van Leeuwen}, editor = {Dimitrios M. Thilikos}, title = {Complexity Results for the Spanning Tree Congestion Problem}, booktitle = {Graph Theoretic Concepts in Computer Science - 36th International Workshop, {WG} 2010, Zar{\'{o}}s, Crete, Greece, June 28-30, 2010 Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {6410}, pages = {3--14}, year = {2010}, url = {https://doi.org/10.1007/978-3-642-16926-7\_3}, doi = {10.1007/978-3-642-16926-7\_3}, timestamp = {Sun, 02 Jun 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/OtachiBL10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/PhilipRV10, author = {Geevarghese Philip and Venkatesh Raman and Yngve Villanger}, editor = {Dimitrios M. Thilikos}, title = {A Quartic Kernel for Pathwidth-One Vertex Deletion}, booktitle = {Graph Theoretic Concepts in Computer Science - 36th International Workshop, {WG} 2010, Zar{\'{o}}s, Crete, Greece, June 28-30, 2010 Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {6410}, pages = {196--207}, year = {2010}, url = {https://doi.org/10.1007/978-3-642-16926-7\_19}, doi = {10.1007/978-3-642-16926-7\_19}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/PhilipRV10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/Szymanska10, author = {Edyta Szymanska}, editor = {Dimitrios M. Thilikos}, title = {The Complexity of Vertex Coloring Problems in Uniform Hypergraphs with High Degree}, booktitle = {Graph Theoretic Concepts in Computer Science - 36th International Workshop, {WG} 2010, Zar{\'{o}}s, Crete, Greece, June 28-30, 2010 Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {6410}, pages = {304--314}, year = {2010}, url = {https://doi.org/10.1007/978-3-642-16926-7\_28}, doi = {10.1007/978-3-642-16926-7\_28}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/Szymanska10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/XiaZ10, author = {Ge Xia and Yong Zhang}, editor = {Dimitrios M. Thilikos}, title = {On the Small Cycle Transversal of Planar Graphs}, booktitle = {Graph Theoretic Concepts in Computer Science - 36th International Workshop, {WG} 2010, Zar{\'{o}}s, Crete, Greece, June 28-30, 2010 Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {6410}, pages = {112--122}, year = {2010}, url = {https://doi.org/10.1007/978-3-642-16926-7\_12}, doi = {10.1007/978-3-642-16926-7\_12}, timestamp = {Wed, 14 Jul 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/XiaZ10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@proceedings{DBLP:conf/wg/2009, editor = {Christophe Paul and Michel Habib}, title = {Graph-Theoretic Concepts in Computer Science, 35th International Workshop, {WG} 2009, Montpellier, France, June 24-26, 2009. Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {5911}, year = {2010}, url = {https://doi.org/10.1007/978-3-642-11409-0}, doi = {10.1007/978-3-642-11409-0}, isbn = {978-3-642-11408-3}, timestamp = {Tue, 14 May 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/2009.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@proceedings{DBLP:conf/wg/2010, editor = {Dimitrios M. Thilikos}, title = {Graph Theoretic Concepts in Computer Science - 36th International Workshop, {WG} 2010, Zar{\'{o}}s, Crete, Greece, June 28-30, 2010 Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {6410}, year = {2010}, url = {https://doi.org/10.1007/978-3-642-16926-7}, doi = {10.1007/978-3-642-16926-7}, isbn = {978-3-642-16925-0}, timestamp = {Tue, 14 May 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/2010.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/AverbouchMT09, author = {Ilya Averbouch and Johann A. Makowsky and Peter Tittmann}, editor = {Christophe Paul and Michel Habib}, title = {A Graph Polynomial Arising from Community Structure (Extended Abstract)}, booktitle = {Graph-Theoretic Concepts in Computer Science, 35th International Workshop, {WG} 2009, Montpellier, France, June 24-26, 2009. Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {5911}, pages = {33--43}, year = {2009}, url = {https://doi.org/10.1007/978-3-642-11409-0\_3}, doi = {10.1007/978-3-642-11409-0\_3}, timestamp = {Tue, 30 Jun 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/AverbouchMT09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/BroersmaFHP09, author = {Hajo Broersma and Fedor V. Fomin and Pim van 't Hof and Dani{\"{e}}l Paulusma}, editor = {Christophe Paul and Michel Habib}, title = {Fast Exact Algorithms for Hamiltonicity in Claw-Free Graphs}, booktitle = {Graph-Theoretic Concepts in Computer Science, 35th International Workshop, {WG} 2009, Montpellier, France, June 24-26, 2009. Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {5911}, pages = {44--53}, year = {2009}, url = {https://doi.org/10.1007/978-3-642-11409-0\_4}, doi = {10.1007/978-3-642-11409-0\_4}, timestamp = {Thu, 14 Oct 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/BroersmaFHP09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/CalinescuFK09, author = {Gruia C{u{a}}linescu and Cristina G. Fernandes and Hemanshu Kaul}, editor = {Christophe Paul and Michel Habib}, title = {Maximum Series-Parallel Subgraph}, booktitle = {Graph-Theoretic Concepts in Computer Science, 35th International Workshop, {WG} 2009, Montpellier, France, June 24-26, 2009. Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {5911}, pages = {54--65}, year = {2009}, url = {https://doi.org/10.1007/978-3-642-11409-0\_5}, doi = {10.1007/978-3-642-11409-0\_5}, timestamp = {Sun, 06 Oct 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/CalinescuFK09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/ChechikP09, author = {Shiri Chechik and David Peleg}, editor = {Christophe Paul and Michel Habib}, title = {Low-Port Tree Representations}, booktitle = {Graph-Theoretic Concepts in Computer Science, 35th International Workshop, {WG} 2009, Montpellier, France, June 24-26, 2009. Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {5911}, pages = {66--76}, year = {2009}, url = {https://doi.org/10.1007/978-3-642-11409-0\_6}, doi = {10.1007/978-3-642-11409-0\_6}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/ChechikP09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/Crespelle09, author = {Christophe Crespelle}, editor = {Christophe Paul and Michel Habib}, title = {Fully Dynamic Representations of Interval Graphs}, booktitle = {Graph-Theoretic Concepts in Computer Science, 35th International Workshop, {WG} 2009, Montpellier, France, June 24-26, 2009. Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {5911}, pages = {77--87}, year = {2009}, url = {https://doi.org/10.1007/978-3-642-11409-0\_7}, doi = {10.1007/978-3-642-11409-0\_7}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/Crespelle09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/DvorakK09, author = {Zdenek Dvor{\'{a}}k and Daniel Kr{\'{a}}l}, editor = {Christophe Paul and Michel Habib}, title = {Algorithms for Classes of Graphs with Bounded Expansion}, booktitle = {Graph-Theoretic Concepts in Computer Science, 35th International Workshop, {WG} 2009, Montpellier, France, June 24-26, 2009. Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {5911}, pages = {17--32}, year = {2009}, url = {https://doi.org/10.1007/978-3-642-11409-0\_2}, doi = {10.1007/978-3-642-11409-0\_2}, timestamp = {Fri, 01 Dec 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/wg/DvorakK09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/Eppstein09, author = {David Eppstein}, editor = {Christophe Paul and Michel Habib}, title = {Graph-Theoretic Solutions to Computational Geometry Problems}, booktitle = {Graph-Theoretic Concepts in Computer Science, 35th International Workshop, {WG} 2009, Montpellier, France, June 24-26, 2009. Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {5911}, pages = {1--16}, year = {2009}, url = {https://doi.org/10.1007/978-3-642-11409-0\_1}, doi = {10.1007/978-3-642-11409-0\_1}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/Eppstein09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/FellowsGK09, author = {Michael R. Fellows and Jiong Guo and Iyad A. Kanj}, editor = {Christophe Paul and Michel Habib}, title = {The Parameterized Complexity of Some Minimum Label Problems}, booktitle = {Graph-Theoretic Concepts in Computer Science, 35th International Workshop, {WG} 2009, Montpellier, France, June 24-26, 2009. Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {5911}, pages = {88--99}, year = {2009}, url = {https://doi.org/10.1007/978-3-642-11409-0\_8}, doi = {10.1007/978-3-642-11409-0\_8}, timestamp = {Wed, 14 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/wg/FellowsGK09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/FernauGR09, author = {Henning Fernau and Serge Gaspers and Daniel Raible}, editor = {Christophe Paul and Michel Habib}, title = {Exact and Parameterized Algorithms for Max Internal Spanning Tree}, booktitle = {Graph-Theoretic Concepts in Computer Science, 35th International Workshop, {WG} 2009, Montpellier, France, June 24-26, 2009. Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {5911}, pages = {100--111}, year = {2009}, url = {https://doi.org/10.1007/978-3-642-11409-0\_9}, doi = {10.1007/978-3-642-11409-0\_9}, timestamp = {Tue, 21 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/wg/FernauGR09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/FominLS09, author = {Fedor V. Fomin and Daniel Lokshtanov and Saket Saurabh}, editor = {Christophe Paul and Michel Habib}, title = {An Exact Algorithm for Minimum Distortion Embedding}, booktitle = {Graph-Theoretic Concepts in Computer Science, 35th International Workshop, {WG} 2009, Montpellier, France, June 24-26, 2009. Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {5911}, pages = {112--121}, year = {2009}, url = {https://doi.org/10.1007/978-3-642-11409-0\_10}, doi = {10.1007/978-3-642-11409-0\_10}, timestamp = {Sun, 02 Jun 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/FominLS09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/GandhiGPR09, author = {Rajiv Gandhi and Bradford Greening and Sriram V. Pemmaraju and Rajiv Raman}, editor = {Christophe Paul and Michel Habib}, title = {Sub-coloring and Hypo-coloring Interval Graphs}, booktitle = {Graph-Theoretic Concepts in Computer Science, 35th International Workshop, {WG} 2009, Montpellier, France, June 24-26, 2009. Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {5911}, pages = {122--132}, year = {2009}, url = {https://doi.org/10.1007/978-3-642-11409-0\_11}, doi = {10.1007/978-3-642-11409-0\_11}, timestamp = {Mon, 17 Aug 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/GandhiGPR09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/GolovachKS09, author = {Petr A. Golovach and Jan Kratochv{\'{\i}}l and Ondrej Such{\'{y}}}, editor = {Christophe Paul and Michel Habib}, title = {Parameterized Complexity of Generalized Domination Problems}, booktitle = {Graph-Theoretic Concepts in Computer Science, 35th International Workshop, {WG} 2009, Montpellier, France, June 24-26, 2009. Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {5911}, pages = {133--142}, year = {2009}, url = {https://doi.org/10.1007/978-3-642-11409-0\_12}, doi = {10.1007/978-3-642-11409-0\_12}, timestamp = {Tue, 07 May 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/GolovachKS09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/GrigorievS09, author = {Alexander Grigoriev and Ren{\'{e}} Sitters}, editor = {Christophe Paul and Michel Habib}, title = {Connected Feedback Vertex Set in Planar Graphs}, booktitle = {Graph-Theoretic Concepts in Computer Science, 35th International Workshop, {WG} 2009, Montpellier, France, June 24-26, 2009. Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {5911}, pages = {143--153}, year = {2009}, url = {https://doi.org/10.1007/978-3-642-11409-0\_13}, doi = {10.1007/978-3-642-11409-0\_13}, timestamp = {Mon, 15 Jun 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/GrigorievS09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/GrumbachW09, author = {St{\'{e}}phane Grumbach and Zhilin Wu}, editor = {Christophe Paul and Michel Habib}, title = {Logical Locality Entails Frugal Distributed Computation over Graphs (Extended Abstract)}, booktitle = {Graph-Theoretic Concepts in Computer Science, 35th International Workshop, {WG} 2009, Montpellier, France, June 24-26, 2009. Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {5911}, pages = {154--165}, year = {2009}, url = {https://doi.org/10.1007/978-3-642-11409-0\_14}, doi = {10.1007/978-3-642-11409-0\_14}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/GrumbachW09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/GurskiW09, author = {Frank Gurski and Egon Wanke}, editor = {Christophe Paul and Michel Habib}, title = {On Module-Composed Graphs}, booktitle = {Graph-Theoretic Concepts in Computer Science, 35th International Workshop, {WG} 2009, Montpellier, France, June 24-26, 2009. Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {5911}, pages = {166--177}, year = {2009}, url = {https://doi.org/10.1007/978-3-642-11409-0\_15}, doi = {10.1007/978-3-642-11409-0\_15}, timestamp = {Sun, 25 Oct 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/GurskiW09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/Hagerup09, author = {Torben Hagerup}, editor = {Christophe Paul and Michel Habib}, title = {An Even Simpler Linear-Time Algorithm for Verifying Minimum Spanning Trees}, booktitle = {Graph-Theoretic Concepts in Computer Science, 35th International Workshop, {WG} 2009, Montpellier, France, June 24-26, 2009. Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {5911}, pages = {178--189}, year = {2009}, url = {https://doi.org/10.1007/978-3-642-11409-0\_16}, doi = {10.1007/978-3-642-11409-0\_16}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/Hagerup09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/HofKP09, author = {Pim van 't Hof and Marcin Kaminski and Dani{\"{e}}l Paulusma}, editor = {Christophe Paul and Michel Habib}, title = {Finding Induced Paths of Given Parity in Claw-Free Graphs}, booktitle = {Graph-Theoretic Concepts in Computer Science, 35th International Workshop, {WG} 2009, Montpellier, France, June 24-26, 2009. Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {5911}, pages = {341--352}, year = {2009}, url = {https://doi.org/10.1007/978-3-642-11409-0\_30}, doi = {10.1007/978-3-642-11409-0\_30}, timestamp = {Thu, 14 Oct 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/HofKP09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/KammerT09, author = {Frank Kammer and Torsten Tholey}, editor = {Christophe Paul and Michel Habib}, title = {The k-Disjoint Paths Problem on Chordal Graphs}, booktitle = {Graph-Theoretic Concepts in Computer Science, 35th International Workshop, {WG} 2009, Montpellier, France, June 24-26, 2009. Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {5911}, pages = {190--201}, year = {2009}, url = {https://doi.org/10.1007/978-3-642-11409-0\_17}, doi = {10.1007/978-3-642-11409-0\_17}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/KammerT09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/KanjWZ09, author = {Iyad A. Kanj and Andreas Wiese and Fenghui Zhang}, editor = {Christophe Paul and Michel Habib}, title = {Local Algorithms for Edge Colorings in UDGs}, booktitle = {Graph-Theoretic Concepts in Computer Science, 35th International Workshop, {WG} 2009, Montpellier, France, June 24-26, 2009. Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {5911}, pages = {202--213}, year = {2009}, url = {https://doi.org/10.1007/978-3-642-11409-0\_18}, doi = {10.1007/978-3-642-11409-0\_18}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/KanjWZ09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/KanteR09, author = {Mamadou Moustapha Kant{\'{e}} and Micha{\"{e}}l Rao}, editor = {Christophe Paul and Michel Habib}, title = {Directed Rank-Width and Displit Decomposition}, booktitle = {Graph-Theoretic Concepts in Computer Science, 35th International Workshop, {WG} 2009, Montpellier, France, June 24-26, 2009. Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {5911}, pages = {214--225}, year = {2009}, url = {https://doi.org/10.1007/978-3-642-11409-0\_19}, doi = {10.1007/978-3-642-11409-0\_19}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/KanteR09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/KatzRW09, author = {Bastian Katz and Ignaz Rutter and Gerhard J. Woeginger}, editor = {Christophe Paul and Michel Habib}, title = {An Algorithmic Study of Switch Graphs}, booktitle = {Graph-Theoretic Concepts in Computer Science, 35th International Workshop, {WG} 2009, Montpellier, France, June 24-26, 2009. Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {5911}, pages = {226--237}, year = {2009}, url = {https://doi.org/10.1007/978-3-642-11409-0\_20}, doi = {10.1007/978-3-642-11409-0\_20}, timestamp = {Fri, 02 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/wg/KatzRW09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/KreutzerO09, author = {Stephan Kreutzer and Sebastian Ordyniak}, editor = {Christophe Paul and Michel Habib}, title = {Distance \emph{d}-Domination Games}, booktitle = {Graph-Theoretic Concepts in Computer Science, 35th International Workshop, {WG} 2009, Montpellier, France, June 24-26, 2009. Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {5911}, pages = {308--319}, year = {2009}, url = {https://doi.org/10.1007/978-3-642-11409-0\_27}, doi = {10.1007/978-3-642-11409-0\_27}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/KreutzerO09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/LeT09, author = {Van Bang Le and Nguyen Ngoc Tuy}, editor = {Christophe Paul and Michel Habib}, title = {Hardness Results and Efficient Algorithms for Graph Powers}, booktitle = {Graph-Theoretic Concepts in Computer Science, 35th International Workshop, {WG} 2009, Montpellier, France, June 24-26, 2009. Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {5911}, pages = {238--249}, year = {2009}, url = {https://doi.org/10.1007/978-3-642-11409-0\_21}, doi = {10.1007/978-3-642-11409-0\_21}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/LeT09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/LiS09, author = {Zhentao Li and Ignasi Sau}, editor = {Christophe Paul and Michel Habib}, title = {Graph Partitioning and Traffic Grooming with Bounded Degree Request Graph}, booktitle = {Graph-Theoretic Concepts in Computer Science, 35th International Workshop, {WG} 2009, Montpellier, France, June 24-26, 2009. Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {5911}, pages = {250--261}, year = {2009}, url = {https://doi.org/10.1007/978-3-642-11409-0\_22}, doi = {10.1007/978-3-642-11409-0\_22}, timestamp = {Sat, 16 Sep 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/LiS09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/MacGillivrayRS09, author = {Gary MacGillivray and Andr{\'{e}} Raspaud and Jacobus Swarts}, editor = {Christophe Paul and Michel Habib}, title = {Injective Oriented Colourings}, booktitle = {Graph-Theoretic Concepts in Computer Science, 35th International Workshop, {WG} 2009, Montpellier, France, June 24-26, 2009. Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {5911}, pages = {262--272}, year = {2009}, url = {https://doi.org/10.1007/978-3-642-11409-0\_23}, doi = {10.1007/978-3-642-11409-0\_23}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/MacGillivrayRS09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/MeisterT09, author = {Daniel Meister and Jan Arne Telle}, editor = {Christophe Paul and Michel Habib}, title = {Chordal Digraphs}, booktitle = {Graph-Theoretic Concepts in Computer Science, 35th International Workshop, {WG} 2009, Montpellier, France, June 24-26, 2009. Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {5911}, pages = {273--284}, year = {2009}, url = {https://doi.org/10.1007/978-3-642-11409-0\_24}, doi = {10.1007/978-3-642-11409-0\_24}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/MeisterT09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/MertziosSZ09, author = {George B. Mertzios and Ignasi Sau and Shmuel Zaks}, editor = {Christophe Paul and Michel Habib}, title = {A New Intersection Model and Improved Algorithms for Tolerance Graphs}, booktitle = {Graph-Theoretic Concepts in Computer Science, 35th International Workshop, {WG} 2009, Montpellier, France, June 24-26, 2009. Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {5911}, pages = {285--295}, year = {2009}, url = {https://doi.org/10.1007/978-3-642-11409-0\_25}, doi = {10.1007/978-3-642-11409-0\_25}, timestamp = {Sat, 16 Sep 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/MertziosSZ09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/OkamotoUU09, author = {Yoshio Okamoto and Ryuhei Uehara and Takeaki Uno}, editor = {Christophe Paul and Michel Habib}, title = {Counting the Number of Matchings in Chordal and Chordal Bipartite Graph Classes}, booktitle = {Graph-Theoretic Concepts in Computer Science, 35th International Workshop, {WG} 2009, Montpellier, France, June 24-26, 2009. Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {5911}, pages = {296--307}, year = {2009}, url = {https://doi.org/10.1007/978-3-642-11409-0\_26}, doi = {10.1007/978-3-642-11409-0\_26}, timestamp = {Tue, 29 Dec 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/wg/OkamotoUU09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/PensoRS09, author = {Lucia Draque Penso and Dieter Rautenbach and Jayme Luiz Szwarcfiter}, editor = {Christophe Paul and Michel Habib}, title = {Cycles, Paths, Connectivity and Diameter in Distance Graphs}, booktitle = {Graph-Theoretic Concepts in Computer Science, 35th International Workshop, {WG} 2009, Montpellier, France, June 24-26, 2009. Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {5911}, pages = {320--328}, year = {2009}, url = {https://doi.org/10.1007/978-3-642-11409-0\_28}, doi = {10.1007/978-3-642-11409-0\_28}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/PensoRS09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/ShremSG09, author = {Shimon Shrem and Michal Stern and Martin Charles Golumbic}, editor = {Christophe Paul and Michel Habib}, title = {Smallest Odd Holes in Claw-Free Graphs (Extended Abstract)}, booktitle = {Graph-Theoretic Concepts in Computer Science, 35th International Workshop, {WG} 2009, Montpellier, France, June 24-26, 2009. Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {5911}, pages = {329--340}, year = {2009}, url = {https://doi.org/10.1007/978-3-642-11409-0\_29}, doi = {10.1007/978-3-642-11409-0\_29}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/ShremSG09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/AverbouchGM08, author = {Ilya Averbouch and Benny Godlin and Johann A. Makowsky}, editor = {Hajo Broersma and Thomas Erlebach and Tom Friedetzky and Dani{\"{e}}l Paulusma}, title = {A Most General Edge Elimination Polynomial}, booktitle = {Graph-Theoretic Concepts in Computer Science, 34th International Workshop, {WG} 2008, Durham, UK, June 30 - July 2, 2008. Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {5344}, pages = {31--42}, year = {2008}, url = {https://doi.org/10.1007/978-3-540-92248-3\_4}, doi = {10.1007/978-3-540-92248-3\_4}, timestamp = {Sun, 25 Oct 2020 23:07:56 +0100}, biburl = {https://dblp.org/rec/conf/wg/AverbouchGM08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/BiloFP08, author = {Davide Bil{\`{o}} and Luca Forlizzi and Guido Proietti}, editor = {Hajo Broersma and Thomas Erlebach and Tom Friedetzky and Dani{\"{e}}l Paulusma}, title = {Approximating the Metric {TSP} in Linear Time}, booktitle = {Graph-Theoretic Concepts in Computer Science, 34th International Workshop, {WG} 2008, Durham, UK, June 30 - July 2, 2008. Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {5344}, pages = {43--54}, year = {2008}, url = {https://doi.org/10.1007/978-3-540-92248-3\_5}, doi = {10.1007/978-3-540-92248-3\_5}, timestamp = {Thu, 23 Jun 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/BiloFP08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/BodlaenderGGH08, author = {Hans L. Bodlaender and Alexander Grigoriev and Nadejda V. Grigorieva and Albert Hendriks}, editor = {Hajo Broersma and Thomas Erlebach and Tom Friedetzky and Dani{\"{e}}l Paulusma}, title = {The Valve Location Problem in Simple Network Topologies}, booktitle = {Graph-Theoretic Concepts in Computer Science, 34th International Workshop, {WG} 2008, Durham, UK, June 30 - July 2, 2008. Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {5344}, pages = {55--65}, year = {2008}, url = {https://doi.org/10.1007/978-3-540-92248-3\_6}, doi = {10.1007/978-3-540-92248-3\_6}, timestamp = {Mon, 15 Jun 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/BodlaenderGGH08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/BonsmaZ08, author = {Paul S. Bonsma and Florian Zickfeld}, editor = {Hajo Broersma and Thomas Erlebach and Tom Friedetzky and Dani{\"{e}}l Paulusma}, title = {A 3/2-Approximation Algorithm for Finding Spanning Trees with Many Leaves in Cubic Graphs}, booktitle = {Graph-Theoretic Concepts in Computer Science, 34th International Workshop, {WG} 2008, Durham, UK, June 30 - July 2, 2008. Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {5344}, pages = {66--77}, year = {2008}, url = {https://doi.org/10.1007/978-3-540-92248-3\_7}, doi = {10.1007/978-3-540-92248-3\_7}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/BonsmaZ08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/ChenKMXZ08, author = {Jianer Chen and Iyad A. Kanj and Jie Meng and Ge Xia and Fenghui Zhang}, editor = {Hajo Broersma and Thomas Erlebach and Tom Friedetzky and Dani{\"{e}}l Paulusma}, title = {On the Pseudo-achromatic Number Problem}, booktitle = {Graph-Theoretic Concepts in Computer Science, 34th International Workshop, {WG} 2008, Durham, UK, June 30 - July 2, 2008. Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {5344}, pages = {78--89}, year = {2008}, url = {https://doi.org/10.1007/978-3-540-92248-3\_8}, doi = {10.1007/978-3-540-92248-3\_8}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/ChenKMXZ08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/CittadiniBR08, author = {Luca Cittadini and Giuseppe Di Battista and Massimo Rimondini}, editor = {Hajo Broersma and Thomas Erlebach and Tom Friedetzky and Dani{\"{e}}l Paulusma}, title = {(Un)-Stable Routing in the Internet: {A} Survey from the Algorithmic Perspective}, booktitle = {Graph-Theoretic Concepts in Computer Science, 34th International Workshop, {WG} 2008, Durham, UK, June 30 - July 2, 2008. Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {5344}, pages = {1--13}, year = {2008}, url = {https://doi.org/10.1007/978-3-540-92248-3\_1}, doi = {10.1007/978-3-540-92248-3\_1}, timestamp = {Mon, 05 Jun 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/CittadiniBR08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/CohenGLS08, author = {Elad Cohen and Martin Charles Golumbic and Marina Lipshteyn and Michal Stern}, editor = {Hajo Broersma and Thomas Erlebach and Tom Friedetzky and Dani{\"{e}}l Paulusma}, title = {What Is between Chordal and Weakly Chordal Graphs?}, booktitle = {Graph-Theoretic Concepts in Computer Science, 34th International Workshop, {WG} 2008, Durham, UK, June 30 - July 2, 2008. Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {5344}, pages = {275--286}, year = {2008}, url = {https://doi.org/10.1007/978-3-540-92248-3\_25}, doi = {10.1007/978-3-540-92248-3\_25}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/CohenGLS08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/CrescenziIGRV08, author = {Pilu Crescenzi and Miriam Di Ianni and Federico Greco and Gianluca Rossi and Paola Vocca}, editor = {Hajo Broersma and Thomas Erlebach and Tom Friedetzky and Dani{\"{e}}l Paulusma}, title = {Making Role Assignment Feasible: {A} Polynomial-Time Algorithm for Computing Ecological Colorings}, booktitle = {Graph-Theoretic Concepts in Computer Science, 34th International Workshop, {WG} 2008, Durham, UK, June 30 - July 2, 2008. Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {5344}, pages = {90--100}, year = {2008}, url = {https://doi.org/10.1007/978-3-540-92248-3\_9}, doi = {10.1007/978-3-540-92248-3\_9}, timestamp = {Sun, 12 Feb 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/wg/CrescenziIGRV08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/CyganP08, author = {Marek Cygan and Marcin Pilipczuk}, editor = {Hajo Broersma and Thomas Erlebach and Tom Friedetzky and Dani{\"{e}}l Paulusma}, title = {Faster Exact Bandwidth}, booktitle = {Graph-Theoretic Concepts in Computer Science, 34th International Workshop, {WG} 2008, Durham, UK, June 30 - July 2, 2008. Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {5344}, pages = {101--109}, year = {2008}, url = {https://doi.org/10.1007/978-3-540-92248-3\_10}, doi = {10.1007/978-3-540-92248-3\_10}, timestamp = {Sat, 19 Oct 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/CyganP08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/DraganCKX08, author = {Feodor F. Dragan and Derek G. Corneil and Ekkehard K{\"{o}}hler and Yang Xiang}, editor = {Hajo Broersma and Thomas Erlebach and Tom Friedetzky and Dani{\"{e}}l Paulusma}, title = {Additive Spanners for Circle Graphs and Polygonal Graphs}, booktitle = {Graph-Theoretic Concepts in Computer Science, 34th International Workshop, {WG} 2008, Durham, UK, June 30 - July 2, 2008. Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {5344}, pages = {110--121}, year = {2008}, url = {https://doi.org/10.1007/978-3-540-92248-3\_11}, doi = {10.1007/978-3-540-92248-3\_11}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/DraganCKX08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/Estrella-BalderramaFK08, author = {Alejandro Estrella{-}Balderrama and Fabrizio Frati and Stephen G. Kobourov}, editor = {Hajo Broersma and Thomas Erlebach and Tom Friedetzky and Dani{\"{e}}l Paulusma}, title = {Upward Straight-Line Embeddings of Directed Graphs into Point Sets}, booktitle = {Graph-Theoretic Concepts in Computer Science, 34th International Workshop, {WG} 2008, Durham, UK, June 30 - July 2, 2008. Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {5344}, pages = {122--133}, year = {2008}, url = {https://doi.org/10.1007/978-3-540-92248-3\_12}, doi = {10.1007/978-3-540-92248-3\_12}, timestamp = {Fri, 09 Apr 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/Estrella-BalderramaFK08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/FialaG08, author = {Jir{\'{\i}} Fiala and Petr A. Golovach}, editor = {Hajo Broersma and Thomas Erlebach and Tom Friedetzky and Dani{\"{e}}l Paulusma}, title = {Complexity of the Packing Coloring Problem for Trees}, booktitle = {Graph-Theoretic Concepts in Computer Science, 34th International Workshop, {WG} 2008, Durham, UK, June 30 - July 2, 2008. Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {5344}, pages = {134--145}, year = {2008}, url = {https://doi.org/10.1007/978-3-540-92248-3\_13}, doi = {10.1007/978-3-540-92248-3\_13}, timestamp = {Fri, 02 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/wg/FialaG08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/FowlerJKS08, author = {J. Joseph Fowler and Michael J{\"{u}}nger and Stephen G. Kobourov and Michael Schulz}, editor = {Hajo Broersma and Thomas Erlebach and Tom Friedetzky and Dani{\"{e}}l Paulusma}, title = {Characterizations of Restricted Pairs of Planar Graphs Allowing Simultaneous Embedding with Fixed Edges}, booktitle = {Graph-Theoretic Concepts in Computer Science, 34th International Workshop, {WG} 2008, Durham, UK, June 30 - July 2, 2008. Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {5344}, pages = {146--158}, year = {2008}, url = {https://doi.org/10.1007/978-3-540-92248-3\_14}, doi = {10.1007/978-3-540-92248-3\_14}, timestamp = {Tue, 25 Jul 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/FowlerJKS08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/Frati08, author = {Fabrizio Frati}, editor = {Hajo Broersma and Thomas Erlebach and Tom Friedetzky and Dani{\"{e}}l Paulusma}, title = {A Lower Bound on the Area Requirements of Series-Parallel Graphs}, booktitle = {Graph-Theoretic Concepts in Computer Science, 34th International Workshop, {WG} 2008, Durham, UK, June 30 - July 2, 2008. Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {5344}, pages = {159--170}, year = {2008}, url = {https://doi.org/10.1007/978-3-540-92248-3\_15}, doi = {10.1007/978-3-540-92248-3\_15}, timestamp = {Fri, 09 Apr 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/Frati08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/GasieniecR08, author = {Leszek Gasieniec and Tomasz Radzik}, editor = {Hajo Broersma and Thomas Erlebach and Tom Friedetzky and Dani{\"{e}}l Paulusma}, title = {Memory Efficient Anonymous Graph Exploration}, booktitle = {Graph-Theoretic Concepts in Computer Science, 34th International Workshop, {WG} 2008, Durham, UK, June 30 - July 2, 2008. Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {5344}, pages = {14--29}, year = {2008}, url = {https://doi.org/10.1007/978-3-540-92248-3\_2}, doi = {10.1007/978-3-540-92248-3\_2}, timestamp = {Thu, 15 Jun 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/GasieniecR08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/GaspersKL08, author = {Serge Gaspers and Dieter Kratsch and Mathieu Liedloff}, editor = {Hajo Broersma and Thomas Erlebach and Tom Friedetzky and Dani{\"{e}}l Paulusma}, title = {On Independent Sets and Bicliques in Graphs}, booktitle = {Graph-Theoretic Concepts in Computer Science, 34th International Workshop, {WG} 2008, Durham, UK, June 30 - July 2, 2008. Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {5344}, pages = {171--182}, year = {2008}, url = {https://doi.org/10.1007/978-3-540-92248-3\_16}, doi = {10.1007/978-3-540-92248-3\_16}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/GaspersKL08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/GodlinKM08, author = {Benny Godlin and Tomer Kotek and Johann A. Makowsky}, editor = {Hajo Broersma and Thomas Erlebach and Tom Friedetzky and Dani{\"{e}}l Paulusma}, title = {Evaluations of Graph Polynomials}, booktitle = {Graph-Theoretic Concepts in Computer Science, 34th International Workshop, {WG} 2008, Durham, UK, June 30 - July 2, 2008. Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {5344}, pages = {183--194}, year = {2008}, url = {https://doi.org/10.1007/978-3-540-92248-3\_17}, doi = {10.1007/978-3-540-92248-3\_17}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/GodlinKM08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/GolovachV08, author = {Petr A. Golovach and Yngve Villanger}, editor = {Hajo Broersma and Thomas Erlebach and Tom Friedetzky and Dani{\"{e}}l Paulusma}, title = {Parameterized Complexity for Domination Problems on Degenerate Graphs}, booktitle = {Graph-Theoretic Concepts in Computer Science, 34th International Workshop, {WG} 2008, Durham, UK, June 30 - July 2, 2008. Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {5344}, pages = {195--205}, year = {2008}, url = {https://doi.org/10.1007/978-3-540-92248-3\_18}, doi = {10.1007/978-3-540-92248-3\_18}, timestamp = {Fri, 02 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/wg/GolovachV08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/Grohe08, author = {Martin Grohe}, editor = {Hajo Broersma and Thomas Erlebach and Tom Friedetzky and Dani{\"{e}}l Paulusma}, title = {Algorithmic Meta Theorems}, booktitle = {Graph-Theoretic Concepts in Computer Science, 34th International Workshop, {WG} 2008, Durham, UK, June 30 - July 2, 2008. Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {5344}, pages = {30}, year = {2008}, url = {https://doi.org/10.1007/978-3-540-92248-3\_3}, doi = {10.1007/978-3-540-92248-3\_3}, timestamp = {Tue, 26 Jun 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/Grohe08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/GutinJRSY08, author = {Gregory Z. Gutin and Adrian Johnstone and Joseph Reddington and Elizabeth Scott and Anders Yeo}, editor = {Hajo Broersma and Thomas Erlebach and Tom Friedetzky and Dani{\"{e}}l Paulusma}, title = {An Algorithm for Finding Input-Output Constrained Convex Sets in an Acyclic Digraph}, booktitle = {Graph-Theoretic Concepts in Computer Science, 34th International Workshop, {WG} 2008, Durham, UK, June 30 - July 2, 2008. Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {5344}, pages = {206--217}, year = {2008}, url = {https://doi.org/10.1007/978-3-540-92248-3\_19}, doi = {10.1007/978-3-540-92248-3\_19}, timestamp = {Thu, 22 Feb 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/wg/GutinJRSY08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/HeggernesLMP08, author = {Pinar Heggernes and Daniel Lokshtanov and Rodica Mihai and Charis Papadopoulos}, editor = {Hajo Broersma and Thomas Erlebach and Tom Friedetzky and Dani{\"{e}}l Paulusma}, title = {Cutwidth of Split Graphs, Threshold Graphs, and Proper Interval Graphs}, booktitle = {Graph-Theoretic Concepts in Computer Science, 34th International Workshop, {WG} 2008, Durham, UK, June 30 - July 2, 2008. Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {5344}, pages = {218--229}, year = {2008}, url = {https://doi.org/10.1007/978-3-540-92248-3\_20}, doi = {10.1007/978-3-540-92248-3\_20}, timestamp = {Fri, 09 Apr 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/HeggernesLMP08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/Jelinek08, author = {V{\'{\i}}t Jel{\'{\i}}nek}, editor = {Hajo Broersma and Thomas Erlebach and Tom Friedetzky and Dani{\"{e}}l Paulusma}, title = {The Rank-Width of the Square Grid}, booktitle = {Graph-Theoretic Concepts in Computer Science, 34th International Workshop, {WG} 2008, Durham, UK, June 30 - July 2, 2008. Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {5344}, pages = {230--239}, year = {2008}, url = {https://doi.org/10.1007/978-3-540-92248-3\_21}, doi = {10.1007/978-3-540-92248-3\_21}, timestamp = {Sun, 25 Jul 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/Jelinek08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/KneisLR08, author = {Joachim Kneis and Alexander Langer and Peter Rossmanith}, editor = {Hajo Broersma and Thomas Erlebach and Tom Friedetzky and Dani{\"{e}}l Paulusma}, title = {Improved Upper Bounds for Partial Vertex Cover}, booktitle = {Graph-Theoretic Concepts in Computer Science, 34th International Workshop, {WG} 2008, Durham, UK, June 30 - July 2, 2008. Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {5344}, pages = {240--251}, year = {2008}, url = {https://doi.org/10.1007/978-3-540-92248-3\_22}, doi = {10.1007/978-3-540-92248-3\_22}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/KneisLR08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/KoiranMH08, author = {Pascal Koiran and Klaus Meer}, editor = {Hajo Broersma and Thomas Erlebach and Tom Friedetzky and Dani{\"{e}}l Paulusma}, title = {On the Expressive Power of {CNF} Formulas of Bounded Tree- and Clique-Width}, booktitle = {Graph-Theoretic Concepts in Computer Science, 34th International Workshop, {WG} 2008, Durham, UK, June 30 - July 2, 2008. Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {5344}, pages = {252--263}, year = {2008}, url = {https://doi.org/10.1007/978-3-540-92248-3\_23}, doi = {10.1007/978-3-540-92248-3\_23}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/KoiranMH08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/KoutsonasT08, author = {Athanassios Koutsonas and Dimitrios M. Thilikos}, editor = {Hajo Broersma and Thomas Erlebach and Tom Friedetzky and Dani{\"{e}}l Paulusma}, title = {Planar Feedback Vertex Set and Face Cover: Combinatorial Bounds and Subexponential Algorithms}, booktitle = {Graph-Theoretic Concepts in Computer Science, 34th International Workshop, {WG} 2008, Durham, UK, June 30 - July 2, 2008. Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {5344}, pages = {264--274}, year = {2008}, url = {https://doi.org/10.1007/978-3-540-92248-3\_24}, doi = {10.1007/978-3-540-92248-3\_24}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/KoutsonasT08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/KreutzerO08, author = {Stephan Kreutzer and Sebastian Ordyniak}, editor = {Hajo Broersma and Thomas Erlebach and Tom Friedetzky and Dani{\"{e}}l Paulusma}, title = {Digraph Decompositions and Monotonicity in Digraph Searching}, booktitle = {Graph-Theoretic Concepts in Computer Science, 34th International Workshop, {WG} 2008, Durham, UK, June 30 - July 2, 2008. Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {5344}, pages = {336--347}, year = {2008}, url = {https://doi.org/10.1007/978-3-540-92248-3\_30}, doi = {10.1007/978-3-540-92248-3\_30}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/KreutzerO08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/MarxS08, author = {D{\'{a}}niel Marx and Ildik{\'{o}} Schlotter}, editor = {Hajo Broersma and Thomas Erlebach and Tom Friedetzky and Dani{\"{e}}l Paulusma}, title = {Parameterized Graph Cleaning Problems}, booktitle = {Graph-Theoretic Concepts in Computer Science, 34th International Workshop, {WG} 2008, Durham, UK, June 30 - July 2, 2008. Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {5344}, pages = {287--299}, year = {2008}, url = {https://doi.org/10.1007/978-3-540-92248-3\_26}, doi = {10.1007/978-3-540-92248-3\_26}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/MarxS08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/MunozS08, author = {Xavier Mu{\~{n}}oz and Ignasi Sau}, editor = {Hajo Broersma and Thomas Erlebach and Tom Friedetzky and Dani{\"{e}}l Paulusma}, title = {Traffic Grooming in Unidirectional {WDM} Rings with Bounded Degree Request Graph}, booktitle = {Graph-Theoretic Concepts in Computer Science, 34th International Workshop, {WG} 2008, Durham, UK, June 30 - July 2, 2008. Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {5344}, pages = {300--311}, year = {2008}, url = {https://doi.org/10.1007/978-3-540-92248-3\_27}, doi = {10.1007/978-3-540-92248-3\_27}, timestamp = {Sat, 16 Sep 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/MunozS08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/NisseS08, author = {Nicolas Nisse and Karol Suchan}, editor = {Hajo Broersma and Thomas Erlebach and Tom Friedetzky and Dani{\"{e}}l Paulusma}, title = {Fast Robber in Planar Graphs}, booktitle = {Graph-Theoretic Concepts in Computer Science, 34th International Workshop, {WG} 2008, Durham, UK, June 30 - July 2, 2008. Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {5344}, pages = {312--323}, year = {2008}, url = {https://doi.org/10.1007/978-3-540-92248-3\_28}, doi = {10.1007/978-3-540-92248-3\_28}, timestamp = {Sun, 02 Jun 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/NisseS08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/Nussbaum08, author = {Yahav Nussbaum}, editor = {Hajo Broersma and Thomas Erlebach and Tom Friedetzky and Dani{\"{e}}l Paulusma}, title = {From a Circular-Arc Model to a Proper Circular-Arc Model}, booktitle = {Graph-Theoretic Concepts in Computer Science, 34th International Workshop, {WG} 2008, Durham, UK, June 30 - July 2, 2008. Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {5344}, pages = {324--335}, year = {2008}, url = {https://doi.org/10.1007/978-3-540-92248-3\_29}, doi = {10.1007/978-3-540-92248-3\_29}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/Nussbaum08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/RicherbyT08, author = {David Richerby and Dimitrios M. Thilikos}, editor = {Hajo Broersma and Thomas Erlebach and Tom Friedetzky and Dani{\"{e}}l Paulusma}, title = {Searching for a Visible, Lazy Fugitive}, booktitle = {Graph-Theoretic Concepts in Computer Science, 34th International Workshop, {WG} 2008, Durham, UK, June 30 - July 2, 2008. Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {5344}, pages = {348--359}, year = {2008}, url = {https://doi.org/10.1007/978-3-540-92248-3\_31}, doi = {10.1007/978-3-540-92248-3\_31}, timestamp = {Sun, 02 Oct 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/RicherbyT08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/TazariM08, author = {Siamak Tazari and Matthias M{\"{u}}ller{-}Hannemann}, editor = {Hajo Broersma and Thomas Erlebach and Tom Friedetzky and Dani{\"{e}}l Paulusma}, title = {A Faster Shortest-Paths Algorithm for Minor-Closed Graph Classes}, booktitle = {Graph-Theoretic Concepts in Computer Science, 34th International Workshop, {WG} 2008, Durham, UK, June 30 - July 2, 2008. Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {5344}, pages = {360--371}, year = {2008}, url = {https://doi.org/10.1007/978-3-540-92248-3\_32}, doi = {10.1007/978-3-540-92248-3\_32}, timestamp = {Wed, 14 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/wg/TazariM08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/WieseK08, author = {Andreas Wiese and Evangelos Kranakis}, editor = {Hajo Broersma and Thomas Erlebach and Tom Friedetzky and Dani{\"{e}}l Paulusma}, title = {Local Construction and Coloring of Spanners of Location Aware Unit Disk Graphs}, booktitle = {Graph-Theoretic Concepts in Computer Science, 34th International Workshop, {WG} 2008, Durham, UK, June 30 - July 2, 2008. Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {5344}, pages = {372--383}, year = {2008}, url = {https://doi.org/10.1007/978-3-540-92248-3\_33}, doi = {10.1007/978-3-540-92248-3\_33}, timestamp = {Fri, 02 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/wg/WieseK08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@proceedings{DBLP:conf/wg/2008, editor = {Hajo Broersma and Thomas Erlebach and Tom Friedetzky and Dani{\"{e}}l Paulusma}, title = {Graph-Theoretic Concepts in Computer Science, 34th International Workshop, {WG} 2008, Durham, UK, June 30 - July 2, 2008. Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {5344}, year = {2008}, url = {https://doi.org/10.1007/978-3-540-92248-3}, doi = {10.1007/978-3-540-92248-3}, isbn = {978-3-540-92247-6}, timestamp = {Sun, 25 Oct 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/2008.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/BrandesDGGHNW07, author = {Ulrik Brandes and Daniel Delling and Marco Gaertler and Robert G{\"{o}}rke and Martin Hoefer and Zoran Nikoloski and Dorothea Wagner}, editor = {Andreas Brandst{\"{a}}dt and Dieter Kratsch and Haiko M{\"{u}}ller}, title = {On Finding Graph Clusterings with Maximum Modularity}, booktitle = {Graph-Theoretic Concepts in Computer Science, 33rd International Workshop, {WG} 2007, Dornburg, Germany, June 21-23, 2007. Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {4769}, pages = {121--132}, publisher = {Springer}, year = {2007}, url = {https://doi.org/10.1007/978-3-540-74839-7\_12}, doi = {10.1007/978-3-540-74839-7\_12}, timestamp = {Sun, 02 Oct 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/BrandesDGGHNW07.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/BuschI07, author = {Arthur H. Busch and Garth Isaak}, editor = {Andreas Brandst{\"{a}}dt and Dieter Kratsch and Haiko M{\"{u}}ller}, title = {Recognizing Bipartite Tolerance Graphs in Linear Time}, booktitle = {Graph-Theoretic Concepts in Computer Science, 33rd International Workshop, {WG} 2007, Dornburg, Germany, June 21-23, 2007. Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {4769}, pages = {12--20}, publisher = {Springer}, year = {2007}, url = {https://doi.org/10.1007/978-3-540-74839-7\_2}, doi = {10.1007/978-3-540-74839-7\_2}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/BuschI07.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/CerecedaHJ07, author = {Luis Cereceda and Jan van den Heuvel and Matthew Johnson}, editor = {Andreas Brandst{\"{a}}dt and Dieter Kratsch and Haiko M{\"{u}}ller}, title = {Mixing 3-Colourings in Bipartite Graphs}, booktitle = {Graph-Theoretic Concepts in Computer Science, 33rd International Workshop, {WG} 2007, Dornburg, Germany, June 21-23, 2007. Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {4769}, pages = {166--177}, publisher = {Springer}, year = {2007}, url = {https://doi.org/10.1007/978-3-540-74839-7\_17}, doi = {10.1007/978-3-540-74839-7\_17}, timestamp = {Fri, 02 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/wg/CerecedaHJ07.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/ChangK07, author = {Maw{-}Shang Chang and Ming{-}Tat Ko}, editor = {Andreas Brandst{\"{a}}dt and Dieter Kratsch and Haiko M{\"{u}}ller}, title = {The 3-Steiner Root Problem}, booktitle = {Graph-Theoretic Concepts in Computer Science, 33rd International Workshop, {WG} 2007, Dornburg, Germany, June 21-23, 2007. Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {4769}, pages = {109--120}, publisher = {Springer}, year = {2007}, url = {https://doi.org/10.1007/978-3-540-74839-7\_11}, doi = {10.1007/978-3-540-74839-7\_11}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/ChangK07.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/CourcelleK07, author = {Bruno Courcelle and Mamadou Moustapha Kant{\'{e}}}, editor = {Andreas Brandst{\"{a}}dt and Dieter Kratsch and Haiko M{\"{u}}ller}, title = {Graph Operations Characterizing Rank-Width and Balanced Graph Expressions}, booktitle = {Graph-Theoretic Concepts in Computer Science, 33rd International Workshop, {WG} 2007, Dornburg, Germany, June 21-23, 2007. Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {4769}, pages = {66--75}, publisher = {Springer}, year = {2007}, url = {https://doi.org/10.1007/978-3-540-74839-7\_7}, doi = {10.1007/978-3-540-74839-7\_7}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/CourcelleK07.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/Damaschke07, author = {Peter Damaschke}, editor = {Andreas Brandst{\"{a}}dt and Dieter Kratsch and Haiko M{\"{u}}ller}, title = {Segmenting Strings Homogeneously Via Trees}, booktitle = {Graph-Theoretic Concepts in Computer Science, 33rd International Workshop, {WG} 2007, Dornburg, Germany, June 21-23, 2007. Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {4769}, pages = {214--225}, publisher = {Springer}, year = {2007}, url = {https://doi.org/10.1007/978-3-540-74839-7\_21}, doi = {10.1007/978-3-540-74839-7\_21}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/Damaschke07.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/Dorn07, author = {Frederic Dorn}, editor = {Andreas Brandst{\"{a}}dt and Dieter Kratsch and Haiko M{\"{u}}ller}, title = {How to Use Planarity Efficiently: New Tree-Decomposition Based Algorithms}, booktitle = {Graph-Theoretic Concepts in Computer Science, 33rd International Workshop, {WG} 2007, Dornburg, Germany, June 21-23, 2007. Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {4769}, pages = {280--291}, publisher = {Springer}, year = {2007}, url = {https://doi.org/10.1007/978-3-540-74839-7\_27}, doi = {10.1007/978-3-540-74839-7\_27}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/Dorn07.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/EscoffierGM07, author = {Bruno Escoffier and Laurent Gourv{\`{e}}s and J{\'{e}}r{\^{o}}me Monnot}, editor = {Andreas Brandst{\"{a}}dt and Dieter Kratsch and Haiko M{\"{u}}ller}, title = {Complexity and Approximation Results for the Connected Vertex Cover Problem}, booktitle = {Graph-Theoretic Concepts in Computer Science, 33rd International Workshop, {WG} 2007, Dornburg, Germany, June 21-23, 2007. Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {4769}, pages = {202--213}, publisher = {Springer}, year = {2007}, url = {https://doi.org/10.1007/978-3-540-74839-7\_20}, doi = {10.1007/978-3-540-74839-7\_20}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/EscoffierGM07.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/FelsnerZ07, author = {Stefan Felsner and Florian Zickfeld}, editor = {Andreas Brandst{\"{a}}dt and Dieter Kratsch and Haiko M{\"{u}}ller}, title = {On the Number of \emph{alpha} -Orientations}, booktitle = {Graph-Theoretic Concepts in Computer Science, 33rd International Workshop, {WG} 2007, Dornburg, Germany, June 21-23, 2007. Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {4769}, pages = {190--201}, publisher = {Springer}, year = {2007}, url = {https://doi.org/10.1007/978-3-540-74839-7\_19}, doi = {10.1007/978-3-540-74839-7\_19}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/FelsnerZ07.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/FominHM07, author = {Fedor V. Fomin and Pinar Heggernes and Rodica Mihai}, editor = {Andreas Brandst{\"{a}}dt and Dieter Kratsch and Haiko M{\"{u}}ller}, title = {Mixed Search Number and Linear-Width of Interval and Split Graphs}, booktitle = {Graph-Theoretic Concepts in Computer Science, 33rd International Workshop, {WG} 2007, Dornburg, Germany, June 21-23, 2007. Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {4769}, pages = {304--315}, publisher = {Springer}, year = {2007}, url = {https://doi.org/10.1007/978-3-540-74839-7\_29}, doi = {10.1007/978-3-540-74839-7\_29}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/FominHM07.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/Frati07, author = {Fabrizio Frati}, editor = {Andreas Brandst{\"{a}}dt and Dieter Kratsch and Haiko M{\"{u}}ller}, title = {On Minimum Area Planar Upward Drawings of Directed Trees and Other Families of Directed Acyclic Graphs}, booktitle = {Graph-Theoretic Concepts in Computer Science, 33rd International Workshop, {WG} 2007, Dornburg, Germany, June 21-23, 2007. Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {4769}, pages = {133--144}, publisher = {Springer}, year = {2007}, url = {https://doi.org/10.1007/978-3-540-74839-7\_13}, doi = {10.1007/978-3-540-74839-7\_13}, timestamp = {Fri, 09 Apr 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/Frati07.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/GambetteV07, author = {Philippe Gambette and St{\'{e}}phane Vialette}, editor = {Andreas Brandst{\"{a}}dt and Dieter Kratsch and Haiko M{\"{u}}ller}, title = {On Restrictions of Balanced 2-Interval Graphs}, booktitle = {Graph-Theoretic Concepts in Computer Science, 33rd International Workshop, {WG} 2007, Dornburg, Germany, June 21-23, 2007. Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {4769}, pages = {55--65}, publisher = {Springer}, year = {2007}, url = {https://doi.org/10.1007/978-3-540-74839-7\_6}, doi = {10.1007/978-3-540-74839-7\_6}, timestamp = {Wed, 14 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/wg/GambetteV07.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/GolovachK07, author = {Petr A. Golovach and Jan Kratochv{\'{\i}}l}, editor = {Andreas Brandst{\"{a}}dt and Dieter Kratsch and Haiko M{\"{u}}ller}, title = {Computational Complexity of Generalized Domination: {A} Complete Dichotomy for Chordal Graphs}, booktitle = {Graph-Theoretic Concepts in Computer Science, 33rd International Workshop, {WG} 2007, Dornburg, Germany, June 21-23, 2007. Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {4769}, pages = {1--11}, publisher = {Springer}, year = {2007}, url = {https://doi.org/10.1007/978-3-540-74839-7\_1}, doi = {10.1007/978-3-540-74839-7\_1}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/GolovachK07.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/GurskiW07, author = {Frank Gurski and Egon Wanke}, editor = {Andreas Brandst{\"{a}}dt and Dieter Kratsch and Haiko M{\"{u}}ller}, title = {The Clique-Width of Tree-Power and Leaf-Power Graphs}, booktitle = {Graph-Theoretic Concepts in Computer Science, 33rd International Workshop, {WG} 2007, Dornburg, Germany, June 21-23, 2007. Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {4769}, pages = {76--85}, publisher = {Springer}, year = {2007}, url = {https://doi.org/10.1007/978-3-540-74839-7\_8}, doi = {10.1007/978-3-540-74839-7\_8}, timestamp = {Sun, 25 Oct 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/GurskiW07.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/Hagen07, author = {Matthias Hagen}, editor = {Andreas Brandst{\"{a}}dt and Dieter Kratsch and Haiko M{\"{u}}ller}, title = {Lower Bounds for Three Algorithms for the Transversal Hypergraph Generation}, booktitle = {Graph-Theoretic Concepts in Computer Science, 33rd International Workshop, {WG} 2007, Dornburg, Germany, June 21-23, 2007. Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {4769}, pages = {316--327}, publisher = {Springer}, year = {2007}, url = {https://doi.org/10.1007/978-3-540-74839-7\_30}, doi = {10.1007/978-3-540-74839-7\_30}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/Hagen07.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/Hagerup07, author = {Torben Hagerup}, editor = {Andreas Brandst{\"{a}}dt and Dieter Kratsch and Haiko M{\"{u}}ller}, title = {A Very Practical Algorithm for the Two-Paths Problem in 3-Connected Planar Graphs}, booktitle = {Graph-Theoretic Concepts in Computer Science, 33rd International Workshop, {WG} 2007, Dornburg, Germany, June 21-23, 2007. Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {4769}, pages = {145--150}, publisher = {Springer}, year = {2007}, url = {https://doi.org/10.1007/978-3-540-74839-7\_14}, doi = {10.1007/978-3-540-74839-7\_14}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/Hagerup07.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/HassinMS07, author = {Refael Hassin and J{\'{e}}r{\^{o}}me Monnot and Danny Segev}, editor = {Andreas Brandst{\"{a}}dt and Dieter Kratsch and Haiko M{\"{u}}ller}, title = {The Complexity of Bottleneck Labeled Graph Problems}, booktitle = {Graph-Theoretic Concepts in Computer Science, 33rd International Workshop, {WG} 2007, Dornburg, Germany, June 21-23, 2007. Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {4769}, pages = {328--340}, publisher = {Springer}, year = {2007}, url = {https://doi.org/10.1007/978-3-540-74839-7\_31}, doi = {10.1007/978-3-540-74839-7\_31}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/HassinMS07.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/Jansen07, author = {Klaus Jansen}, editor = {Andreas Brandst{\"{a}}dt and Dieter Kratsch and Haiko M{\"{u}}ller}, title = {Approximation Algorithms for Geometric Intersection Graphs}, booktitle = {Graph-Theoretic Concepts in Computer Science, 33rd International Workshop, {WG} 2007, Dornburg, Germany, June 21-23, 2007. Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {4769}, pages = {151--153}, publisher = {Springer}, year = {2007}, url = {https://doi.org/10.1007/978-3-540-74839-7\_15}, doi = {10.1007/978-3-540-74839-7\_15}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/Jansen07.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/LeR07, author = {Van Bang Le and H. N. de Ridder}, editor = {Andreas Brandst{\"{a}}dt and Dieter Kratsch and Haiko M{\"{u}}ller}, title = {Characterisations and Linear-Time Recognition of Probe Cographs}, booktitle = {Graph-Theoretic Concepts in Computer Science, 33rd International Workshop, {WG} 2007, Dornburg, Germany, June 21-23, 2007. Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {4769}, pages = {226--237}, publisher = {Springer}, year = {2007}, url = {https://doi.org/10.1007/978-3-540-74839-7\_22}, doi = {10.1007/978-3-540-74839-7\_22}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/LeR07.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/LimouzyMR07, author = {Vincent Limouzy and Fabien de Montgolfier and Micha{\"{e}}l Rao}, editor = {Andreas Brandst{\"{a}}dt and Dieter Kratsch and Haiko M{\"{u}}ller}, title = {{NLC-2} Graph Recognition and Isomorphism}, booktitle = {Graph-Theoretic Concepts in Computer Science, 33rd International Workshop, {WG} 2007, Dornburg, Germany, June 21-23, 2007. Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {4769}, pages = {86--98}, publisher = {Springer}, year = {2007}, url = {https://doi.org/10.1007/978-3-540-74839-7\_9}, doi = {10.1007/978-3-540-74839-7\_9}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/LimouzyMR07.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/LinSS07, author = {Min Chih Lin and Francisco J. Soulignac and Jayme Luiz Szwarcfiter}, editor = {Andreas Brandst{\"{a}}dt and Dieter Kratsch and Haiko M{\"{u}}ller}, title = {Proper Helly Circular-Arc Graphs}, booktitle = {Graph-Theoretic Concepts in Computer Science, 33rd International Workshop, {WG} 2007, Dornburg, Germany, June 21-23, 2007. Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {4769}, pages = {248--257}, publisher = {Springer}, year = {2007}, url = {https://doi.org/10.1007/978-3-540-74839-7\_24}, doi = {10.1007/978-3-540-74839-7\_24}, timestamp = {Sat, 16 Sep 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/LinSS07.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/LozinM07, author = {Vadim V. Lozin and Martin Milanic}, editor = {Andreas Brandst{\"{a}}dt and Dieter Kratsch and Haiko M{\"{u}}ller}, title = {Tree-Width and Optimization in Bounded Degree Graphs}, booktitle = {Graph-Theoretic Concepts in Computer Science, 33rd International Workshop, {WG} 2007, Dornburg, Germany, June 21-23, 2007. Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {4769}, pages = {45--54}, publisher = {Springer}, year = {2007}, url = {https://doi.org/10.1007/978-3-540-74839-7\_5}, doi = {10.1007/978-3-540-74839-7\_5}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/LozinM07.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/Manthey07, author = {Bodo Manthey}, editor = {Andreas Brandst{\"{a}}dt and Dieter Kratsch and Haiko M{\"{u}}ller}, title = {Minimum-Weight Cycle Covers and Their Approximability}, booktitle = {Graph-Theoretic Concepts in Computer Science, 33rd International Workshop, {WG} 2007, Dornburg, Germany, June 21-23, 2007. Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {4769}, pages = {178--189}, publisher = {Springer}, year = {2007}, url = {https://doi.org/10.1007/978-3-540-74839-7\_18}, doi = {10.1007/978-3-540-74839-7\_18}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/Manthey07.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/MarxS07, author = {D{\'{a}}niel Marx and Ildik{\'{o}} Schlotter}, editor = {Andreas Brandst{\"{a}}dt and Dieter Kratsch and Haiko M{\"{u}}ller}, title = {Obtaining a Planar Graph by Vertex Deletion}, booktitle = {Graph-Theoretic Concepts in Computer Science, 33rd International Workshop, {WG} 2007, Dornburg, Germany, June 21-23, 2007. Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {4769}, pages = {292--303}, publisher = {Springer}, year = {2007}, url = {https://doi.org/10.1007/978-3-540-74839-7\_28}, doi = {10.1007/978-3-540-74839-7\_28}, timestamp = {Mon, 26 Jun 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/MarxS07.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/MazoitN07, author = {Fr{\'{e}}d{\'{e}}ric Mazoit and Nicolas Nisse}, editor = {Andreas Brandst{\"{a}}dt and Dieter Kratsch and Haiko M{\"{u}}ller}, title = {Monotonicity of Non-deterministic Graph Searching}, booktitle = {Graph-Theoretic Concepts in Computer Science, 33rd International Workshop, {WG} 2007, Dornburg, Germany, June 21-23, 2007. Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {4769}, pages = {33--44}, publisher = {Springer}, year = {2007}, url = {https://doi.org/10.1007/978-3-540-74839-7\_4}, doi = {10.1007/978-3-540-74839-7\_4}, timestamp = {Sun, 04 Aug 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/MazoitN07.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/Meister07, author = {Daniel Meister}, editor = {Andreas Brandst{\"{a}}dt and Dieter Kratsch and Haiko M{\"{u}}ller}, title = {A Characterisation of the Minimal Triangulations of Permutation Graphs}, booktitle = {Graph-Theoretic Concepts in Computer Science, 33rd International Workshop, {WG} 2007, Dornburg, Germany, June 21-23, 2007. Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {4769}, pages = {99--108}, publisher = {Springer}, year = {2007}, url = {https://doi.org/10.1007/978-3-540-74839-7\_10}, doi = {10.1007/978-3-540-74839-7\_10}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/Meister07.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/MeisterTV07, author = {Daniel Meister and Jan Arne Telle and Martin Vatshelle}, editor = {Andreas Brandst{\"{a}}dt and Dieter Kratsch and Haiko M{\"{u}}ller}, title = {Characterization and Recognition of Digraphs of Bounded Kelly-width}, booktitle = {Graph-Theoretic Concepts in Computer Science, 33rd International Workshop, {WG} 2007, Dornburg, Germany, June 21-23, 2007. Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {4769}, pages = {270--279}, publisher = {Springer}, year = {2007}, url = {https://doi.org/10.1007/978-3-540-74839-7\_26}, doi = {10.1007/978-3-540-74839-7\_26}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/MeisterTV07.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/MontiPS07, author = {Angelo Monti and Paolo Penna and Riccardo Silvestri}, editor = {Andreas Brandst{\"{a}}dt and Dieter Kratsch and Haiko M{\"{u}}ller}, title = {An Equivalent Version of the Caccetta-H{\"{a}}ggkvist Conjecture in an Online Load Balancing Problem}, booktitle = {Graph-Theoretic Concepts in Computer Science, 33rd International Workshop, {WG} 2007, Dornburg, Germany, June 21-23, 2007. Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {4769}, pages = {154--165}, publisher = {Springer}, year = {2007}, url = {https://doi.org/10.1007/978-3-540-74839-7\_16}, doi = {10.1007/978-3-540-74839-7\_16}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/MontiPS07.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/Pergel07, author = {Martin Pergel}, editor = {Andreas Brandst{\"{a}}dt and Dieter Kratsch and Haiko M{\"{u}}ller}, title = {Recognition of Polygon-Circle Graphs and Graphs of Interval Filaments Is NP-Complete}, booktitle = {Graph-Theoretic Concepts in Computer Science, 33rd International Workshop, {WG} 2007, Dornburg, Germany, June 21-23, 2007. Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {4769}, pages = {238--247}, publisher = {Springer}, year = {2007}, url = {https://doi.org/10.1007/978-3-540-74839-7\_23}, doi = {10.1007/978-3-540-74839-7\_23}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/Pergel07.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/RicherbyT07, author = {David Richerby and Dimitrios M. Thilikos}, editor = {Andreas Brandst{\"{a}}dt and Dieter Kratsch and Haiko M{\"{u}}ller}, title = {Graph Searching in a Crime Wave}, booktitle = {Graph-Theoretic Concepts in Computer Science, 33rd International Workshop, {WG} 2007, Dornburg, Germany, June 21-23, 2007. Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {4769}, pages = {21--32}, publisher = {Springer}, year = {2007}, url = {https://doi.org/10.1007/978-3-540-74839-7\_3}, doi = {10.1007/978-3-540-74839-7\_3}, timestamp = {Sun, 02 Oct 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/RicherbyT07.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/SuchanT07, author = {Karol Suchan and Ioan Todinca}, editor = {Andreas Brandst{\"{a}}dt and Dieter Kratsch and Haiko M{\"{u}}ller}, title = {Pathwidth of Circular-Arc Graphs}, booktitle = {Graph-Theoretic Concepts in Computer Science, 33rd International Workshop, {WG} 2007, Dornburg, Germany, June 21-23, 2007. Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {4769}, pages = {258--269}, publisher = {Springer}, year = {2007}, url = {https://doi.org/10.1007/978-3-540-74839-7\_25}, doi = {10.1007/978-3-540-74839-7\_25}, timestamp = {Tue, 07 May 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/SuchanT07.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@proceedings{DBLP:conf/wg/2007, editor = {Andreas Brandst{\"{a}}dt and Dieter Kratsch and Haiko M{\"{u}}ller}, title = {Graph-Theoretic Concepts in Computer Science, 33rd International Workshop, {WG} 2007, Dornburg, Germany, June 21-23, 2007. Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {4769}, publisher = {Springer}, year = {2007}, url = {https://doi.org/10.1007/978-3-540-74839-7}, doi = {10.1007/978-3-540-74839-7}, isbn = {978-3-540-74838-0}, timestamp = {Tue, 14 May 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/2007.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/AlconFFG06, author = {Liliana Alc{\'{o}}n and Lu{\'{e}}rbio Faria and Celina M. H. de Figueiredo and Marisa Gutierrez}, editor = {Fedor V. Fomin}, title = {Clique Graph Recognition Is NP-Complete}, booktitle = {Graph-Theoretic Concepts in Computer Science, 32nd International Workshop, {WG} 2006, Bergen, Norway, June 22-24, 2006, Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {4271}, pages = {269--277}, publisher = {Springer}, year = {2006}, url = {https://doi.org/10.1007/11917496\_24}, doi = {10.1007/11917496\_24}, timestamp = {Tue, 14 May 2019 10:00:40 +0200}, biburl = {https://dblp.org/rec/conf/wg/AlconFFG06.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/BarthaK06, author = {Mikl{\'{o}}s Bartha and Mikl{\'{o}}s Kr{\'{e}}sz}, editor = {Fedor V. Fomin}, title = {Flexible Matchings}, booktitle = {Graph-Theoretic Concepts in Computer Science, 32nd International Workshop, {WG} 2006, Bergen, Norway, June 22-24, 2006, Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {4271}, pages = {313--324}, publisher = {Springer}, year = {2006}, url = {https://doi.org/10.1007/11917496\_28}, doi = {10.1007/11917496\_28}, timestamp = {Tue, 07 May 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/BarthaK06.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/Bodlaender06, author = {Hans L. Bodlaender}, editor = {Fedor V. Fomin}, title = {Treewidth: Characterizations, Applications, and Computations}, booktitle = {Graph-Theoretic Concepts in Computer Science, 32nd International Workshop, {WG} 2006, Bergen, Norway, June 22-24, 2006, Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {4271}, pages = {1--14}, publisher = {Springer}, year = {2006}, url = {https://doi.org/10.1007/11917496\_1}, doi = {10.1007/11917496\_1}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/Bodlaender06.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/ChalopinP06, author = {J{\'{e}}r{\'{e}}mie Chalopin and Dani{\"{e}}l Paulusma}, editor = {Fedor V. Fomin}, title = {Graph Labelings Derived from Models in Distributed Computing}, booktitle = {Graph-Theoretic Concepts in Computer Science, 32nd International Workshop, {WG} 2006, Bergen, Norway, June 22-24, 2006, Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {4271}, pages = {301--312}, publisher = {Springer}, year = {2006}, url = {https://doi.org/10.1007/11917496\_27}, doi = {10.1007/11917496\_27}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/ChalopinP06.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/ChandlerCKLP06, author = {David B. Chandler and Maw{-}Shang Chang and Ton Kloks and Jiping Liu and Sheng{-}Lung Peng}, editor = {Fedor V. Fomin}, title = {Partitioned Probe Comparability Graphs}, booktitle = {Graph-Theoretic Concepts in Computer Science, 32nd International Workshop, {WG} 2006, Bergen, Norway, June 22-24, 2006, Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {4271}, pages = {179--190}, publisher = {Springer}, year = {2006}, url = {https://doi.org/10.1007/11917496\_17}, doi = {10.1007/11917496\_17}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/ChandlerCKLP06.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/Coulonges06, author = {Sylvain Coulonges}, editor = {Fedor V. Fomin}, title = {Circular-Perfect Concave-Round Graphs}, booktitle = {Graph-Theoretic Concepts in Computer Science, 32nd International Workshop, {WG} 2006, Bergen, Norway, June 22-24, 2006, Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {4271}, pages = {348--355}, publisher = {Springer}, year = {2006}, url = {https://doi.org/10.1007/11917496\_31}, doi = {10.1007/11917496\_31}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/Coulonges06.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/CurtisIJLM06, author = {Andrew R. Curtis and Clemente Izurieta and Benson L. Joeris and Scott M. Lundberg and Ross M. McConnell}, editor = {Fedor V. Fomin}, title = {An Implicit Representation of Chordal Comparabilty Graphs in Linear-Time}, booktitle = {Graph-Theoretic Concepts in Computer Science, 32nd International Workshop, {WG} 2006, Bergen, Norway, June 22-24, 2006, Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {4271}, pages = {168--178}, publisher = {Springer}, year = {2006}, url = {https://doi.org/10.1007/11917496\_16}, doi = {10.1007/11917496\_16}, timestamp = {Fri, 26 Nov 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/wg/CurtisIJLM06.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/FialaK06, author = {Jir{\'{\i}} Fiala and Jan Kratochv{\'{\i}}l}, editor = {Fedor V. Fomin}, title = {Locally Injective Graph Homomorphism: Lists Guarantee Dichotomy}, booktitle = {Graph-Theoretic Concepts in Computer Science, 32nd International Workshop, {WG} 2006, Bergen, Norway, June 22-24, 2006, Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {4271}, pages = {15--26}, publisher = {Springer}, year = {2006}, url = {https://doi.org/10.1007/11917496\_2}, doi = {10.1007/11917496\_2}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/FialaK06.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/FlamminiMMSZ06, author = {Michele Flammini and Gianpiero Monaco and Luca Moscardelli and Mordechai Shalom and Shmuel Zaks}, editor = {Fedor V. Fomin}, title = {Approximating the Traffic Grooming Problem in Tree and Star Networks}, booktitle = {Graph-Theoretic Concepts in Computer Science, 32nd International Workshop, {WG} 2006, Bergen, Norway, June 22-24, 2006, Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {4271}, pages = {147--158}, publisher = {Springer}, year = {2006}, url = {https://doi.org/10.1007/11917496\_14}, doi = {10.1007/11917496\_14}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/FlamminiMMSZ06.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/FoniokNT06, author = {Jan Foniok and Jaroslav Nesetril and Claude Tardif}, editor = {Fedor V. Fomin}, title = {Generalised Dualities and Finite Maximal Antichains}, booktitle = {Graph-Theoretic Concepts in Computer Science, 32nd International Workshop, {WG} 2006, Bergen, Norway, June 22-24, 2006, Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {4271}, pages = {27--36}, publisher = {Springer}, year = {2006}, url = {https://doi.org/10.1007/11917496\_3}, doi = {10.1007/11917496\_3}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/FoniokNT06.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/FraigniaudN06, author = {Pierre Fraigniaud and Nicolas Nisse}, editor = {Fedor V. Fomin}, title = {Monotony Properties of Connected Visible Graph Searching}, booktitle = {Graph-Theoretic Concepts in Computer Science, 32nd International Workshop, {WG} 2006, Bergen, Norway, June 22-24, 2006, Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {4271}, pages = {229--240}, publisher = {Springer}, year = {2006}, url = {https://doi.org/10.1007/11917496\_21}, doi = {10.1007/11917496\_21}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/FraigniaudN06.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/GaspersL06, author = {Serge Gaspers and Mathieu Liedloff}, editor = {Fedor V. Fomin}, title = {A Branch-and-Reduce Algorithm for Finding a Minimum Independent Dominating Set in Graphs}, booktitle = {Graph-Theoretic Concepts in Computer Science, 32nd International Workshop, {WG} 2006, Bergen, Norway, June 22-24, 2006, Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {4271}, pages = {78--89}, publisher = {Springer}, year = {2006}, url = {https://doi.org/10.1007/11917496\_8}, doi = {10.1007/11917496\_8}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/GaspersL06.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/GassnerJPSS06, author = {Elisabeth Gassner and Michael J{\"{u}}nger and Merijam Percan and Marcus Schaefer and Michael Schulz}, editor = {Fedor V. Fomin}, title = {Simultaneous Graph Embeddings with Fixed Edges}, booktitle = {Graph-Theoretic Concepts in Computer Science, 32nd International Workshop, {WG} 2006, Bergen, Norway, June 22-24, 2006, Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {4271}, pages = {325--335}, publisher = {Springer}, year = {2006}, url = {https://doi.org/10.1007/11917496\_29}, doi = {10.1007/11917496\_29}, timestamp = {Thu, 17 Jun 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/GassnerJPSS06.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/GoelG06, author = {Gaurav Goel and Jens Gustedt}, editor = {Fedor V. Fomin}, title = {Bounded Arboricity to Determine the Local Structure of Sparse Graphs}, booktitle = {Graph-Theoretic Concepts in Computer Science, 32nd International Workshop, {WG} 2006, Bergen, Norway, June 22-24, 2006, Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {4271}, pages = {159--167}, publisher = {Springer}, year = {2006}, url = {https://doi.org/10.1007/11917496\_15}, doi = {10.1007/11917496\_15}, timestamp = {Mon, 05 Jun 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/GoelG06.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/GolumbicLS06, author = {Martin Charles Golumbic and Marina Lipshteyn and Michal Stern}, editor = {Fedor V. Fomin}, title = {Finding Intersection Models of Weakly Chordal Graphs}, booktitle = {Graph-Theoretic Concepts in Computer Science, 32nd International Workshop, {WG} 2006, Bergen, Norway, June 22-24, 2006, Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {4271}, pages = {241--255}, publisher = {Springer}, year = {2006}, url = {https://doi.org/10.1007/11917496\_22}, doi = {10.1007/11917496\_22}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/GolumbicLS06.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/GrigorievLSU06, author = {Alexander Grigoriev and Joyce van Loon and Ren{\'{e}} Sitters and Marc Uetz}, editor = {Fedor V. Fomin}, title = {How to Sell a Graph: Guidelines for Graph Retailers}, booktitle = {Graph-Theoretic Concepts in Computer Science, 32nd International Workshop, {WG} 2006, Bergen, Norway, June 22-24, 2006, Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {4271}, pages = {125--136}, publisher = {Springer}, year = {2006}, url = {https://doi.org/10.1007/11917496\_12}, doi = {10.1007/11917496\_12}, timestamp = {Mon, 15 Jun 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/GrigorievLSU06.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/HalldorssonK06, author = {Magn{\'{u}}s M. Halld{\'{o}}rsson and Ragnar K. Karlsson}, editor = {Fedor V. Fomin}, title = {Strip Graphs: Recognition and Scheduling}, booktitle = {Graph-Theoretic Concepts in Computer Science, 32nd International Workshop, {WG} 2006, Bergen, Norway, June 22-24, 2006, Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {4271}, pages = {137--146}, publisher = {Springer}, year = {2006}, url = {https://doi.org/10.1007/11917496\_13}, doi = {10.1007/11917496\_13}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/HalldorssonK06.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/HongN06, author = {Seok{-}Hee Hong and Hiroshi Nagamochi}, editor = {Fedor V. Fomin}, title = {Convex Drawings of Graphs with Non-convex Boundary}, booktitle = {Graph-Theoretic Concepts in Computer Science, 32nd International Workshop, {WG} 2006, Bergen, Norway, June 22-24, 2006, Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {4271}, pages = {113--124}, publisher = {Springer}, year = {2006}, url = {https://doi.org/10.1007/11917496\_11}, doi = {10.1007/11917496\_11}, timestamp = {Thu, 27 Apr 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/HongN06.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/KaplanN06, author = {Haim Kaplan and Yahav Nussbaum}, editor = {Fedor V. Fomin}, title = {Certifying Algorithms for Recognizing Proper Circular-Arc Graphs and Unit Circular-Arc Graphs}, booktitle = {Graph-Theoretic Concepts in Computer Science, 32nd International Workshop, {WG} 2006, Bergen, Norway, June 22-24, 2006, Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {4271}, pages = {289--300}, publisher = {Springer}, year = {2006}, url = {https://doi.org/10.1007/11917496\_26}, doi = {10.1007/11917496\_26}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/KaplanN06.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/KiyomiKU06, author = {Masashi Kiyomi and Shuji Kijima and Takeaki Uno}, editor = {Fedor V. Fomin}, title = {Listing Chordal Graphs and Interval Graphs}, booktitle = {Graph-Theoretic Concepts in Computer Science, 32nd International Workshop, {WG} 2006, Bergen, Norway, June 22-24, 2006, Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {4271}, pages = {68--77}, publisher = {Springer}, year = {2006}, url = {https://doi.org/10.1007/11917496\_7}, doi = {10.1007/11917496\_7}, timestamp = {Mon, 15 Jun 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/KiyomiKU06.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/KnauerS06, author = {Christian Knauer and Andreas Spillner}, editor = {Fedor V. Fomin}, title = {A Fixed-Parameter Algorithm for the Minimum Weight Triangulation Problem Based on Small Graph Separators}, booktitle = {Graph-Theoretic Concepts in Computer Science, 32nd International Workshop, {WG} 2006, Bergen, Norway, June 22-24, 2006, Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {4271}, pages = {49--57}, publisher = {Springer}, year = {2006}, url = {https://doi.org/10.1007/11917496\_5}, doi = {10.1007/11917496\_5}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/KnauerS06.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/KneisMRR06, author = {Joachim Kneis and Daniel M{\"{o}}lle and Stefan Richter and Peter Rossmanith}, editor = {Fedor V. Fomin}, title = {Divide-and-Color}, booktitle = {Graph-Theoretic Concepts in Computer Science, 32nd International Workshop, {WG} 2006, Bergen, Norway, June 22-24, 2006, Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {4271}, pages = {58--67}, publisher = {Springer}, year = {2006}, url = {https://doi.org/10.1007/11917496\_6}, doi = {10.1007/11917496\_6}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/KneisMRR06.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/Kowalik06, author = {Lukasz Kowalik}, editor = {Fedor V. Fomin}, title = {Improved Edge-Coloring with Three Colors}, booktitle = {Graph-Theoretic Concepts in Computer Science, 32nd International Workshop, {WG} 2006, Bergen, Norway, June 22-24, 2006, Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {4271}, pages = {90--101}, publisher = {Springer}, year = {2006}, url = {https://doi.org/10.1007/11917496\_9}, doi = {10.1007/11917496\_9}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/Kowalik06.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/MakowskyRAG06, author = {Johann A. Makowsky and Udi Rotics and Ilya Averbouch and Benny Godlin}, editor = {Fedor V. Fomin}, title = {Computing Graph Polynomials on Graphs of Bounded Clique-Width}, booktitle = {Graph-Theoretic Concepts in Computer Science, 32nd International Workshop, {WG} 2006, Bergen, Norway, June 22-24, 2006, Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {4271}, pages = {191--204}, publisher = {Springer}, year = {2006}, url = {https://doi.org/10.1007/11917496\_18}, doi = {10.1007/11917496\_18}, timestamp = {Wed, 14 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/wg/MakowskyRAG06.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/Manthey06, author = {Bodo Manthey}, editor = {Fedor V. Fomin}, title = {Approximation Algorithms for Restricted Cycle Covers Based on Cycle Decompositions}, booktitle = {Graph-Theoretic Concepts in Computer Science, 32nd International Workshop, {WG} 2006, Bergen, Norway, June 22-24, 2006, Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {4271}, pages = {336--347}, publisher = {Springer}, year = {2006}, url = {https://doi.org/10.1007/11917496\_30}, doi = {10.1007/11917496\_30}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/Manthey06.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/Marx06, author = {D{\'{a}}niel Marx}, editor = {Fedor V. Fomin}, title = {Chordal Deletion Is Fixed-Parameter Tractable}, booktitle = {Graph-Theoretic Concepts in Computer Science, 32nd International Workshop, {WG} 2006, Bergen, Norway, June 22-24, 2006, Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {4271}, pages = {37--48}, publisher = {Springer}, year = {2006}, url = {https://doi.org/10.1007/11917496\_4}, doi = {10.1007/11917496\_4}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/Marx06.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/NikolopoulosPP06, author = {Stavros D. Nikolopoulos and Leonidas Palios and Charis Papadopoulos}, editor = {Fedor V. Fomin}, title = {A Fully Dynamic Algorithm for the Recognition of \emph{P}\({}_{\mbox{4}}\)-Sparse Graphs}, booktitle = {Graph-Theoretic Concepts in Computer Science, 32nd International Workshop, {WG} 2006, Bergen, Norway, June 22-24, 2006, Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {4271}, pages = {256--268}, publisher = {Springer}, year = {2006}, url = {https://doi.org/10.1007/11917496\_23}, doi = {10.1007/11917496\_23}, timestamp = {Fri, 09 Apr 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/NikolopoulosPP06.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/PaulPT06, author = {Christophe Paul and Andrzej Proskurowski and Jan Arne Telle}, editor = {Fedor V. Fomin}, title = {Generation of Graphs with Bounded Branchwidth}, booktitle = {Graph-Theoretic Concepts in Computer Science, 32nd International Workshop, {WG} 2006, Bergen, Norway, June 22-24, 2006, Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {4271}, pages = {205--216}, publisher = {Springer}, year = {2006}, url = {https://doi.org/10.1007/11917496\_19}, doi = {10.1007/11917496\_19}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/PaulPT06.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/RapaportST06, author = {Ivan Rapaport and Karol Suchan and Ioan Todinca}, editor = {Fedor V. Fomin}, title = {Minimal Proper Interval Completions}, booktitle = {Graph-Theoretic Concepts in Computer Science, 32nd International Workshop, {WG} 2006, Bergen, Norway, June 22-24, 2006, Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {4271}, pages = {217--228}, publisher = {Springer}, year = {2006}, url = {https://doi.org/10.1007/11917496\_20}, doi = {10.1007/11917496\_20}, timestamp = {Tue, 07 May 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/RapaportST06.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/TakenagaH06, author = {Yasuhiko Takenaga and Kenichi Higashide}, editor = {Fedor V. Fomin}, title = {Vertex Coloring of Comparability+\emph{k}e and -\emph{k}e Graphs}, booktitle = {Graph-Theoretic Concepts in Computer Science, 32nd International Workshop, {WG} 2006, Bergen, Norway, June 22-24, 2006, Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {4271}, pages = {102--112}, publisher = {Springer}, year = {2006}, url = {https://doi.org/10.1007/11917496\_10}, doi = {10.1007/11917496\_10}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/TakenagaH06.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/XuanHLM06, author = {Binh{-}Minh Bui{-}Xuan and Michel Habib and Vincent Limouzy and Fabien de Montgolfier}, editor = {Fedor V. Fomin}, title = {Homogeneity vs. Adjacency: Generalising Some Graph Decomposition Algorithms}, booktitle = {Graph-Theoretic Concepts in Computer Science, 32nd International Workshop, {WG} 2006, Bergen, Norway, June 22-24, 2006, Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {4271}, pages = {278--288}, publisher = {Springer}, year = {2006}, url = {https://doi.org/10.1007/11917496\_25}, doi = {10.1007/11917496\_25}, timestamp = {Thu, 14 Oct 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/XuanHLM06.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@proceedings{DBLP:conf/wg/2006, editor = {Fedor V. Fomin}, title = {Graph-Theoretic Concepts in Computer Science, 32nd International Workshop, {WG} 2006, Bergen, Norway, June 22-24, 2006, Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {4271}, publisher = {Springer}, year = {2006}, url = {https://doi.org/10.1007/11917496}, doi = {10.1007/11917496}, isbn = {3-540-48381-0}, timestamp = {Tue, 14 May 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/2006.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/AggarwalMD05, author = {Divesh Aggarwal and Shashank K. Mehta and Jitender S. Deogun}, editor = {Dieter Kratsch}, title = {Domination Search on Graphs with Low Dominating-Target-Number}, booktitle = {Graph-Theoretic Concepts in Computer Science, 31st International Workshop, {WG} 2005, Metz, France, June 23-25, 2005, Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {3787}, pages = {28--37}, publisher = {Springer}, year = {2005}, url = {https://doi.org/10.1007/11604686\_3}, doi = {10.1007/11604686\_3}, timestamp = {Tue, 14 May 2019 10:00:40 +0200}, biburl = {https://dblp.org/rec/conf/wg/AggarwalMD05.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/AngelBG05, author = {Eric Angel and Evripidis Bampis and Laurent Gourv{\`{e}}s}, editor = {Dieter Kratsch}, title = {Approximation Algorithms for the Bi-criteria Weighted max-cut Problem}, booktitle = {Graph-Theoretic Concepts in Computer Science, 31st International Workshop, {WG} 2005, Metz, France, June 23-25, 2005, Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {3787}, pages = {331--340}, publisher = {Springer}, year = {2005}, url = {https://doi.org/10.1007/11604686\_29}, doi = {10.1007/11604686\_29}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/AngelBG05.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/BeerliovaEEHHMR05, author = {Zuzana Beerliova and Felix Eberhard and Thomas Erlebach and Alexander Hall and Michael Hoffmann and Mat{\'{u}}s Mihal{\'{a}}k and L. Shankar Ram}, editor = {Dieter Kratsch}, title = {Network Discovery and Verification}, booktitle = {Graph-Theoretic Concepts in Computer Science, 31st International Workshop, {WG} 2005, Metz, France, June 23-25, 2005, Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {3787}, pages = {127--138}, publisher = {Springer}, year = {2005}, url = {https://doi.org/10.1007/11604686\_12}, doi = {10.1007/11604686\_12}, timestamp = {Mon, 05 Jun 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/BeerliovaEEHHMR05.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/BerryKS05, author = {Anne Berry and Richard Krueger and Genevi{\`{e}}ve Simonet}, editor = {Dieter Kratsch}, title = {Ultimate Generalizations of LexBFS and {LEX} {M}}, booktitle = {Graph-Theoretic Concepts in Computer Science, 31st International Workshop, {WG} 2005, Metz, France, June 23-25, 2005, Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {3787}, pages = {199--213}, publisher = {Springer}, year = {2005}, url = {https://doi.org/10.1007/11604686\_18}, doi = {10.1007/11604686\_18}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/BerryKS05.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/BerrySS05, author = {Anne Berry and Alain Sigayret and Jeremy P. Spinrad}, editor = {Dieter Kratsch}, title = {Faster Dynamic Algorithms for Chordal Graphs, and an Application to Phylogeny}, booktitle = {Graph-Theoretic Concepts in Computer Science, 31st International Workshop, {WG} 2005, Metz, France, June 23-25, 2005, Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {3787}, pages = {445--455}, publisher = {Springer}, year = {2005}, url = {https://doi.org/10.1007/11604686\_39}, doi = {10.1007/11604686\_39}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/BerrySS05.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/BerthomeLN05, author = {Pascal Berthom{\'{e}} and Sylvain Lebresne and Kim Nguyen}, editor = {Dieter Kratsch}, title = {Computation of Chromatic Polynomials Using Triangulations and Clique Trees}, booktitle = {Graph-Theoretic Concepts in Computer Science, 31st International Workshop, {WG} 2005, Metz, France, June 23-25, 2005, Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {3787}, pages = {362--373}, publisher = {Springer}, year = {2005}, url = {https://doi.org/10.1007/11604686\_32}, doi = {10.1007/11604686\_32}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/BerthomeLN05.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/BlinFHV05, author = {Guillaume Blin and Guillaume Fertin and Danny Hermelin and St{\'{e}}phane Vialette}, editor = {Dieter Kratsch}, title = {Fixed-Parameter Algorithms for Protein Similarity Search Under mRNA Structure Constraints}, booktitle = {Graph-Theoretic Concepts in Computer Science, 31st International Workshop, {WG} 2005, Metz, France, June 23-25, 2005, Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {3787}, pages = {271--282}, publisher = {Springer}, year = {2005}, url = {https://doi.org/10.1007/11604686\_24}, doi = {10.1007/11604686\_24}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/BlinFHV05.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/BodirskyK05, author = {Manuel Bodirsky and Daniel Kr{\'{a}}l}, editor = {Dieter Kratsch}, title = {Locally Consistent Constraint Satisfaction Problems with Binary Constraints}, booktitle = {Graph-Theoretic Concepts in Computer Science, 31st International Workshop, {WG} 2005, Metz, France, June 23-25, 2005, Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {3787}, pages = {295--306}, publisher = {Springer}, year = {2005}, url = {https://doi.org/10.1007/11604686\_26}, doi = {10.1007/11604686\_26}, timestamp = {Wed, 14 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/wg/BodirskyK05.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/BoseDW05, author = {Prosenjit Bose and Vida Dujmovic and David R. Wood}, editor = {Dieter Kratsch}, title = {Induced Subgraphs of Bounded Degree and Bounded Treewidth}, booktitle = {Graph-Theoretic Concepts in Computer Science, 31st International Workshop, {WG} 2005, Metz, France, June 23-25, 2005, Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {3787}, pages = {175--186}, publisher = {Springer}, year = {2005}, url = {https://doi.org/10.1007/11604686\_16}, doi = {10.1007/11604686\_16}, timestamp = {Fri, 02 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/wg/BoseDW05.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/BouvelGK05, author = {Mathilde Bouvel and Vladimir Grebinski and Gregory Kucherov}, editor = {Dieter Kratsch}, title = {Combinatorial Search on Graphs Motivated by Bioinformatics Applications: {A} Brief Survey}, booktitle = {Graph-Theoretic Concepts in Computer Science, 31st International Workshop, {WG} 2005, Metz, France, June 23-25, 2005, Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {3787}, pages = {16--27}, publisher = {Springer}, year = {2005}, url = {https://doi.org/10.1007/11604686\_2}, doi = {10.1007/11604686\_2}, timestamp = {Wed, 14 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/wg/BouvelGK05.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/CorneilDKY05, author = {Derek G. Corneil and Feodor F. Dragan and Ekkehard K{\"{o}}hler and Chenyu Yan}, editor = {Dieter Kratsch}, title = {Collective Tree 1-Spanners for Interval Graphs}, booktitle = {Graph-Theoretic Concepts in Computer Science, 31st International Workshop, {WG} 2005, Metz, France, June 23-25, 2005, Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {3787}, pages = {151--162}, publisher = {Springer}, year = {2005}, url = {https://doi.org/10.1007/11604686\_14}, doi = {10.1007/11604686\_14}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/CorneilDKY05.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/CrespelleP05, author = {Christophe Crespelle and Christophe Paul}, editor = {Dieter Kratsch}, title = {Fully Dynamic Algorithm for Recognition and Modular Decomposition of Permutation Graphs}, booktitle = {Graph-Theoretic Concepts in Computer Science, 31st International Workshop, {WG} 2005, Metz, France, June 23-25, 2005, Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {3787}, pages = {38--48}, publisher = {Springer}, year = {2005}, url = {https://doi.org/10.1007/11604686\_4}, doi = {10.1007/11604686\_4}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/CrespelleP05.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/Damaschke05, author = {Peter Damaschke}, editor = {Dieter Kratsch}, title = {On the Fixed-Parameter Enumerability of Cluster Editing}, booktitle = {Graph-Theoretic Concepts in Computer Science, 31st International Workshop, {WG} 2005, Metz, France, June 23-25, 2005, Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {3787}, pages = {283--294}, publisher = {Springer}, year = {2005}, url = {https://doi.org/10.1007/11604686\_25}, doi = {10.1007/11604686\_25}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/Damaschke05.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/DomGHN05, author = {Michael Dom and Jiong Guo and Falk H{\"{u}}ffner and Rolf Niedermeier}, editor = {Dieter Kratsch}, title = {Extending the Tractability Border for Closest Leaf Powers}, booktitle = {Graph-Theoretic Concepts in Computer Science, 31st International Workshop, {WG} 2005, Metz, France, June 23-25, 2005, Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {3787}, pages = {397--408}, publisher = {Springer}, year = {2005}, url = {https://doi.org/10.1007/11604686\_35}, doi = {10.1007/11604686\_35}, timestamp = {Sun, 25 Oct 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/DomGHN05.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/ElsasserS05, author = {Robert Els{\"{a}}sser and Thomas Sauerwald}, editor = {Dieter Kratsch}, title = {On Randomized Broadcasting in Star Graphs}, booktitle = {Graph-Theoretic Concepts in Computer Science, 31st International Workshop, {WG} 2005, Metz, France, June 23-25, 2005, Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {3787}, pages = {307--318}, publisher = {Springer}, year = {2005}, url = {https://doi.org/10.1007/11604686\_27}, doi = {10.1007/11604686\_27}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/ElsasserS05.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/FialaPT05, author = {Jir{\'{\i}} Fiala and Dani{\"{e}}l Paulusma and Jan Arne Telle}, editor = {Dieter Kratsch}, title = {Algorithms for Comparability of Matrices in Partial Orders Imposed by Graph Homomorphisms}, booktitle = {Graph-Theoretic Concepts in Computer Science, 31st International Workshop, {WG} 2005, Metz, France, June 23-25, 2005, Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {3787}, pages = {115--126}, publisher = {Springer}, year = {2005}, url = {https://doi.org/10.1007/11604686\_11}, doi = {10.1007/11604686\_11}, timestamp = {Sat, 05 Sep 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/FialaPT05.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/FominMT05, author = {Fedor V. Fomin and Fr{\'{e}}d{\'{e}}ric Mazoit and Ioan Todinca}, editor = {Dieter Kratsch}, title = {Computing Branchwidth Via Efficient Triangulations and Blocks}, booktitle = {Graph-Theoretic Concepts in Computer Science, 31st International Workshop, {WG} 2005, Metz, France, June 23-25, 2005, Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {3787}, pages = {374--384}, publisher = {Springer}, year = {2005}, url = {https://doi.org/10.1007/11604686\_33}, doi = {10.1007/11604686\_33}, timestamp = {Sun, 04 Aug 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/FominMT05.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/GattoJPS05, author = {Michael Gatto and Riko Jacob and Leon Peeters and Anita Sch{\"{o}}bel}, editor = {Dieter Kratsch}, title = {The Computational Complexity of Delay Management}, booktitle = {Graph-Theoretic Concepts in Computer Science, 31st International Workshop, {WG} 2005, Metz, France, June 23-25, 2005, Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {3787}, pages = {227--238}, publisher = {Springer}, year = {2005}, url = {https://doi.org/10.1007/11604686\_20}, doi = {10.1007/11604686\_20}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/GattoJPS05.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/GiesenM05, author = {Joachim Giesen and Dieter Mitsche}, editor = {Dieter Kratsch}, title = {Bounding the Misclassification Error in Spectral Partitioning in the Planted Partition Model}, booktitle = {Graph-Theoretic Concepts in Computer Science, 31st International Workshop, {WG} 2005, Metz, France, June 23-25, 2005, Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {3787}, pages = {409--420}, publisher = {Springer}, year = {2005}, url = {https://doi.org/10.1007/11604686\_36}, doi = {10.1007/11604686\_36}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/GiesenM05.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/GimenezHN05, author = {Omer Gim{\'{e}}nez and Petr Hlinen{\'{y}} and Marc Noy}, editor = {Dieter Kratsch}, title = {Computing the Tutte Polynomial on Graphs of Bounded Clique-Width}, booktitle = {Graph-Theoretic Concepts in Computer Science, 31st International Workshop, {WG} 2005, Metz, France, June 23-25, 2005, Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {3787}, pages = {59--68}, publisher = {Springer}, year = {2005}, url = {https://doi.org/10.1007/11604686\_6}, doi = {10.1007/11604686\_6}, timestamp = {Wed, 14 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/wg/GimenezHN05.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/Gioan05, author = {Emeric Gioan}, editor = {Dieter Kratsch}, title = {Complete Graph Drawings Up to Triangle Mutations}, booktitle = {Graph-Theoretic Concepts in Computer Science, 31st International Workshop, {WG} 2005, Metz, France, June 23-25, 2005, Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {3787}, pages = {139--150}, publisher = {Springer}, year = {2005}, url = {https://doi.org/10.1007/11604686\_13}, doi = {10.1007/11604686\_13}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/Gioan05.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/GoncalvesM05, author = {Daniel Gon{\c{c}}alves and Micka{\"{e}}l Montassier}, editor = {Dieter Kratsch}, title = {Acyclic Choosability of Graphs with Small Maximum Degree}, booktitle = {Graph-Theoretic Concepts in Computer Science, 31st International Workshop, {WG} 2005, Metz, France, June 23-25, 2005, Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {3787}, pages = {239--248}, publisher = {Springer}, year = {2005}, url = {https://doi.org/10.1007/11604686\_21}, doi = {10.1007/11604686\_21}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/GoncalvesM05.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/GottlobGMSS05, author = {Georg Gottlob and Martin Grohe and Nysret Musliu and Marko Samer and Francesco Scarcello}, editor = {Dieter Kratsch}, title = {Hypertree Decompositions: Structure, Algorithms, and Applications}, booktitle = {Graph-Theoretic Concepts in Computer Science, 31st International Workshop, {WG} 2005, Metz, France, June 23-25, 2005, Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {3787}, pages = {1--15}, publisher = {Springer}, year = {2005}, url = {https://doi.org/10.1007/11604686\_1}, doi = {10.1007/11604686\_1}, timestamp = {Tue, 29 Dec 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/wg/GottlobGMSS05.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/GurskiW05, author = {Frank Gurski and Egon Wanke}, editor = {Dieter Kratsch}, title = {Minimizing NLC-Width is NP-Complete}, booktitle = {Graph-Theoretic Concepts in Computer Science, 31st International Workshop, {WG} 2005, Metz, France, June 23-25, 2005, Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {3787}, pages = {69--80}, publisher = {Springer}, year = {2005}, url = {https://doi.org/10.1007/11604686\_7}, doi = {10.1007/11604686\_7}, timestamp = {Sun, 25 Oct 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/GurskiW05.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/HavetS05, author = {Fr{\'{e}}d{\'{e}}ric Havet and Jean{-}S{\'{e}}bastien Sereni}, editor = {Dieter Kratsch}, title = {Channel Assignment and Improper Choosability of Graphs}, booktitle = {Graph-Theoretic Concepts in Computer Science, 31st International Workshop, {WG} 2005, Metz, France, June 23-25, 2005, Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {3787}, pages = {81--90}, publisher = {Springer}, year = {2005}, url = {https://doi.org/10.1007/11604686\_8}, doi = {10.1007/11604686\_8}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/HavetS05.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/HeggernesL05, author = {Pinar Heggernes and Daniel Lokshtanov}, editor = {Dieter Kratsch}, title = {Optimal Broadcast Domination of Arbitrary Graphs in Polynomial Time}, booktitle = {Graph-Theoretic Concepts in Computer Science, 31st International Workshop, {WG} 2005, Metz, France, June 23-25, 2005, Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {3787}, pages = {187--198}, publisher = {Springer}, year = {2005}, url = {https://doi.org/10.1007/11604686\_17}, doi = {10.1007/11604686\_17}, timestamp = {Mon, 05 Jun 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/HeggernesL05.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/KakoOHH05, author = {Akihisa Kako and Takao Ono and Tomio Hirata and Magn{\'{u}}s M. Halld{\'{o}}rsson}, editor = {Dieter Kratsch}, title = {Approximation Algorithms for the Weighted Independent Set Problem}, booktitle = {Graph-Theoretic Concepts in Computer Science, 31st International Workshop, {WG} 2005, Metz, France, June 23-25, 2005, Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {3787}, pages = {341--350}, publisher = {Springer}, year = {2005}, url = {https://doi.org/10.1007/11604686\_30}, doi = {10.1007/11604686\_30}, timestamp = {Fri, 27 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/wg/KakoOHH05.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/KneisMRR05, author = {Joachim Kneis and Daniel M{\"{o}}lle and Stefan Richter and Peter Rossmanith}, editor = {Dieter Kratsch}, title = {Algorithms Based on the Treewidth of Sparse Graphs}, booktitle = {Graph-Theoretic Concepts in Computer Science, 31st International Workshop, {WG} 2005, Metz, France, June 23-25, 2005, Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {3787}, pages = {385--396}, publisher = {Springer}, year = {2005}, url = {https://doi.org/10.1007/11604686\_34}, doi = {10.1007/11604686\_34}, timestamp = {Wed, 14 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/wg/KneisMRR05.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/KorachR05, author = {Ephraim Korach and Margarita Razgon}, editor = {Dieter Kratsch}, title = {Optimal Hypergraph Tree-Realization}, booktitle = {Graph-Theoretic Concepts in Computer Science, 31st International Workshop, {WG} 2005, Metz, France, June 23-25, 2005, Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {3787}, pages = {261--270}, publisher = {Springer}, year = {2005}, url = {https://doi.org/10.1007/11604686\_23}, doi = {10.1007/11604686\_23}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/KorachR05.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/LeMM05, author = {Van Bang Le and Raffaele Mosca and Haiko M{\"{u}}ller}, editor = {Dieter Kratsch}, title = {On Stable Cutsets in Claw-Free Graphs and Planar Graphs}, booktitle = {Graph-Theoretic Concepts in Computer Science, 31st International Workshop, {WG} 2005, Metz, France, June 23-25, 2005, Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {3787}, pages = {163--174}, publisher = {Springer}, year = {2005}, url = {https://doi.org/10.1007/11604686\_15}, doi = {10.1007/11604686\_15}, timestamp = {Sun, 12 Nov 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/wg/LeMM05.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/Leeuwen05, author = {Erik Jan van Leeuwen}, editor = {Dieter Kratsch}, title = {Approximation Algorithms for Unit Disk Graphs}, booktitle = {Graph-Theoretic Concepts in Computer Science, 31st International Workshop, {WG} 2005, Metz, France, June 23-25, 2005, Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {3787}, pages = {351--361}, publisher = {Springer}, year = {2005}, url = {https://doi.org/10.1007/11604686\_31}, doi = {10.1007/11604686\_31}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/Leeuwen05.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/LiedloffKLP05, author = {Mathieu Liedloff and Ton Kloks and Jiping Liu and Sheng{-}Lung Peng}, editor = {Dieter Kratsch}, title = {Roman Domination over Some Graph Classes}, booktitle = {Graph-Theoretic Concepts in Computer Science, 31st International Workshop, {WG} 2005, Metz, France, June 23-25, 2005, Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {3787}, pages = {103--114}, publisher = {Springer}, year = {2005}, url = {https://doi.org/10.1007/11604686\_10}, doi = {10.1007/11604686\_10}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/LiedloffKLP05.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/McConnellM05, author = {Ross M. McConnell and Fabien de Montgolfier}, editor = {Dieter Kratsch}, title = {Algebraic Operations on {PQ} Trees and Modular Decomposition Trees}, booktitle = {Graph-Theoretic Concepts in Computer Science, 31st International Workshop, {WG} 2005, Metz, France, June 23-25, 2005, Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {3787}, pages = {421--432}, publisher = {Springer}, year = {2005}, url = {https://doi.org/10.1007/11604686\_37}, doi = {10.1007/11604686\_37}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/McConnellM05.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/Meister05, author = {Daniel Meister}, editor = {Dieter Kratsch}, title = {Computing Treewidth and Minimum Fill-In for Permutation Graphs in Linear Time}, booktitle = {Graph-Theoretic Concepts in Computer Science, 31st International Workshop, {WG} 2005, Metz, France, June 23-25, 2005, Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {3787}, pages = {91--102}, publisher = {Springer}, year = {2005}, url = {https://doi.org/10.1007/11604686\_9}, doi = {10.1007/11604686\_9}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/Meister05.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/NakanoU05, author = {Shin{-}Ichi Nakano and Takeaki Uno}, editor = {Dieter Kratsch}, title = {Generating Colored Trees}, booktitle = {Graph-Theoretic Concepts in Computer Science, 31st International Workshop, {WG} 2005, Metz, France, June 23-25, 2005, Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {3787}, pages = {249--260}, publisher = {Springer}, year = {2005}, url = {https://doi.org/10.1007/11604686\_22}, doi = {10.1007/11604686\_22}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/NakanoU05.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/NikolopoulosP05, author = {Stavros D. Nikolopoulos and Leonidas Palios}, editor = {Dieter Kratsch}, title = {Adding an Edge in a Cograph}, booktitle = {Graph-Theoretic Concepts in Computer Science, 31st International Workshop, {WG} 2005, Metz, France, June 23-25, 2005, Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {3787}, pages = {214--226}, publisher = {Springer}, year = {2005}, url = {https://doi.org/10.1007/11604686\_19}, doi = {10.1007/11604686\_19}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/NikolopoulosP05.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/NikolopoulosP05a, author = {Stavros D. Nikolopoulos and Leonidas Palios}, editor = {Dieter Kratsch}, title = {Recognizing HHDS-Free Graphs}, booktitle = {Graph-Theoretic Concepts in Computer Science, 31st International Workshop, {WG} 2005, Metz, France, June 23-25, 2005, Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {3787}, pages = {456--467}, publisher = {Springer}, year = {2005}, url = {https://doi.org/10.1007/11604686\_40}, doi = {10.1007/11604686\_40}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/NikolopoulosP05a.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/OkamotoUU05, author = {Yoshio Okamoto and Takeaki Uno and Ryuhei Uehara}, editor = {Dieter Kratsch}, title = {Linear-Time Counting Algorithms for Independent Sets in Chordal Graphs}, booktitle = {Graph-Theoretic Concepts in Computer Science, 31st International Workshop, {WG} 2005, Metz, France, June 23-25, 2005, Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {3787}, pages = {433--444}, publisher = {Springer}, year = {2005}, url = {https://doi.org/10.1007/11604686\_38}, doi = {10.1007/11604686\_38}, timestamp = {Tue, 29 Dec 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/wg/OkamotoUU05.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/Oum05, author = {Sang{-}il Oum}, editor = {Dieter Kratsch}, title = {Approximating Rank-Width and Clique-Width Quickly}, booktitle = {Graph-Theoretic Concepts in Computer Science, 31st International Workshop, {WG} 2005, Metz, France, June 23-25, 2005, Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {3787}, pages = {49--58}, publisher = {Springer}, year = {2005}, url = {https://doi.org/10.1007/11604686\_5}, doi = {10.1007/11604686\_5}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/Oum05.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/Tholey05, author = {Torsten Tholey}, editor = {Dieter Kratsch}, title = {Finding Disjoint Paths on Directed Acyclic Graphs}, booktitle = {Graph-Theoretic Concepts in Computer Science, 31st International Workshop, {WG} 2005, Metz, France, June 23-25, 2005, Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {3787}, pages = {319--330}, publisher = {Springer}, year = {2005}, url = {https://doi.org/10.1007/11604686\_28}, doi = {10.1007/11604686\_28}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/Tholey05.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@proceedings{DBLP:conf/wg/2005, editor = {Dieter Kratsch}, title = {Graph-Theoretic Concepts in Computer Science, 31st International Workshop, {WG} 2005, Metz, France, June 23-25, 2005, Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {3787}, publisher = {Springer}, year = {2005}, url = {https://doi.org/10.1007/11604686}, doi = {10.1007/11604686}, isbn = {3-540-31000-2}, timestamp = {Tue, 14 May 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/2005.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/ApollonioCI04, author = {Nicola Apollonio and Massimiliano Caramia and Giuseppe F. Italiano}, editor = {Juraj Hromkovic and Manfred Nagl and Bernhard Westfechtel}, title = {A Stochastic Location Problem with Applications to Tele-diagnostic}, booktitle = {Graph-Theoretic Concepts in Computer Science, 30th International Workshop,WG 2004, Bad Honnef, Germany, June 21-23, 2004, Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {3353}, pages = {201--213}, publisher = {Springer}, year = {2004}, url = {https://doi.org/10.1007/978-3-540-30559-0\_17}, doi = {10.1007/978-3-540-30559-0\_17}, timestamp = {Tue, 14 May 2019 10:00:40 +0200}, biburl = {https://dblp.org/rec/conf/wg/ApollonioCI04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/Baader04, author = {Franz Baader}, editor = {Juraj Hromkovic and Manfred Nagl and Bernhard Westfechtel}, title = {A Graph-Theoretic Generalization of the Least Common Subsumer and the Most Specific Concept in the Description Logic {EL}}, booktitle = {Graph-Theoretic Concepts in Computer Science, 30th International Workshop,WG 2004, Bad Honnef, Germany, June 21-23, 2004, Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {3353}, pages = {177--188}, publisher = {Springer}, year = {2004}, url = {https://doi.org/10.1007/978-3-540-30559-0\_15}, doi = {10.1007/978-3-540-30559-0\_15}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/Baader04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/BaurB04, author = {Michael Baur and Ulrik Brandes}, editor = {Juraj Hromkovic and Manfred Nagl and Bernhard Westfechtel}, title = {Crossing Reduction in Circular Layouts}, booktitle = {Graph-Theoretic Concepts in Computer Science, 30th International Workshop,WG 2004, Bad Honnef, Germany, June 21-23, 2004, Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {3353}, pages = {332--343}, publisher = {Springer}, year = {2004}, url = {https://doi.org/10.1007/978-3-540-30559-0\_28}, doi = {10.1007/978-3-540-30559-0\_28}, timestamp = {Wed, 14 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/wg/BaurB04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/BietenhaderO04, author = {Thomas Bietenhader and Yoshio Okamoto}, editor = {Juraj Hromkovic and Manfred Nagl and Bernhard Westfechtel}, title = {Core Stability of Minimum Coloring Games}, booktitle = {Graph-Theoretic Concepts in Computer Science, 30th International Workshop,WG 2004, Bad Honnef, Germany, June 21-23, 2004, Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {3353}, pages = {389--401}, publisher = {Springer}, year = {2004}, url = {https://doi.org/10.1007/978-3-540-30559-0\_33}, doi = {10.1007/978-3-540-30559-0\_33}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/BietenhaderO04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/BodlaenderK04, author = {Hans L. Bodlaender and Arie M. C. A. Koster}, editor = {Juraj Hromkovic and Manfred Nagl and Bernhard Westfechtel}, title = {On the Maximum Cardinality Search Lower Bound for Treewidth}, booktitle = {Graph-Theoretic Concepts in Computer Science, 30th International Workshop,WG 2004, Bad Honnef, Germany, June 21-23, 2004, Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {3353}, pages = {81--92}, publisher = {Springer}, year = {2004}, url = {https://doi.org/10.1007/978-3-540-30559-0\_7}, doi = {10.1007/978-3-540-30559-0\_7}, timestamp = {Sun, 02 Oct 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/BodlaenderK04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/BonichonGHPS04, author = {Nicolas Bonichon and Cyril Gavoille and Nicolas Hanusse and Dominique Poulalhon and Gilles Schaeffer}, editor = {Juraj Hromkovic and Manfred Nagl and Bernhard Westfechtel}, title = {Planar Graphs, via Well-Orderly Maps and Trees}, booktitle = {Graph-Theoretic Concepts in Computer Science, 30th International Workshop,WG 2004, Bad Honnef, Germany, June 21-23, 2004, Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {3353}, pages = {270--284}, publisher = {Springer}, year = {2004}, url = {https://doi.org/10.1007/978-3-540-30559-0\_23}, doi = {10.1007/978-3-540-30559-0\_23}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/BonichonGHPS04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/BrimkovBKS04, author = {Valentin E. Brimkov and Reneta P. Barneva and Reinhard Klette and Joseph Straight}, editor = {Juraj Hromkovic and Manfred Nagl and Bernhard Westfechtel}, title = {Efficient Computation of the Lov{\'{a}}sz Theta Function for a Class of Circulant Graphs}, booktitle = {Graph-Theoretic Concepts in Computer Science, 30th International Workshop,WG 2004, Bad Honnef, Germany, June 21-23, 2004, Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {3353}, pages = {285--295}, publisher = {Springer}, year = {2004}, url = {https://doi.org/10.1007/978-3-540-30559-0\_24}, doi = {10.1007/978-3-540-30559-0\_24}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/BrimkovBKS04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/BroersmaPSVW04, author = {Hajo Broersma and Dani{\"{e}}l Paulusma and Gerard J. M. Smit and Frank Vlaardingerbroek and Gerhard J. Woeginger}, editor = {Juraj Hromkovic and Manfred Nagl and Bernhard Westfechtel}, title = {The Computational Complexity of the Minimum Weight Processor Assignment Problem}, booktitle = {Graph-Theoretic Concepts in Computer Science, 30th International Workshop,WG 2004, Bad Honnef, Germany, June 21-23, 2004, Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {3353}, pages = {189--200}, publisher = {Springer}, year = {2004}, url = {https://doi.org/10.1007/978-3-540-30559-0\_16}, doi = {10.1007/978-3-540-30559-0\_16}, timestamp = {Sat, 05 Sep 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/BroersmaPSVW04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/ChenT04, author = {Zhi{-}Zhong Chen and Tatsuie Tsukiji}, editor = {Juraj Hromkovic and Manfred Nagl and Bernhard Westfechtel}, title = {Computing Bounded-Degree Phylogenetic Roots of Disconnected Graphs}, booktitle = {Graph-Theoretic Concepts in Computer Science, 30th International Workshop,WG 2004, Bad Honnef, Germany, June 21-23, 2004, Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {3353}, pages = {308--319}, publisher = {Springer}, year = {2004}, url = {https://doi.org/10.1007/978-3-540-30559-0\_26}, doi = {10.1007/978-3-540-30559-0\_26}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/ChenT04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/ChorFJ04, author = {Benny Chor and Mike Fellows and David W. Juedes}, editor = {Juraj Hromkovic and Manfred Nagl and Bernhard Westfechtel}, title = {Linear Kernels in Linear Time, or How to Save k Colors in O(n\({}^{\mbox{2}}\)) Steps}, booktitle = {Graph-Theoretic Concepts in Computer Science, 30th International Workshop,WG 2004, Bad Honnef, Germany, June 21-23, 2004, Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {3353}, pages = {257--269}, publisher = {Springer}, year = {2004}, url = {https://doi.org/10.1007/978-3-540-30559-0\_22}, doi = {10.1007/978-3-540-30559-0\_22}, timestamp = {Mon, 26 Jun 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/ChorFJ04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/ConfortiGP04, author = {Michele Conforti and Anna Galluccio and Guido Proietti}, editor = {Juraj Hromkovic and Manfred Nagl and Bernhard Westfechtel}, title = {Edge-Connectivity Augmentation and Network Matrices}, booktitle = {Graph-Theoretic Concepts in Computer Science, 30th International Workshop,WG 2004, Bad Honnef, Germany, June 21-23, 2004, Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {3353}, pages = {355--364}, publisher = {Springer}, year = {2004}, url = {https://doi.org/10.1007/978-3-540-30559-0\_30}, doi = {10.1007/978-3-540-30559-0\_30}, timestamp = {Thu, 23 Jun 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/ConfortiGP04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/Corneil04, author = {Derek G. Corneil}, editor = {Juraj Hromkovic and Manfred Nagl and Bernhard Westfechtel}, title = {Lexicographic Breadth First Search - {A} Survey}, booktitle = {Graph-Theoretic Concepts in Computer Science, 30th International Workshop,WG 2004, Bad Honnef, Germany, June 21-23, 2004, Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {3353}, pages = {1--19}, publisher = {Springer}, year = {2004}, url = {https://doi.org/10.1007/978-3-540-30559-0\_1}, doi = {10.1007/978-3-540-30559-0\_1}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/Corneil04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/CornelsenS04, author = {Sabine Cornelsen and Gabriele Di Stefano}, editor = {Juraj Hromkovic and Manfred Nagl and Bernhard Westfechtel}, title = {Treelike Comparability Graphs: Characterization, Recognition, and Applications}, booktitle = {Graph-Theoretic Concepts in Computer Science, 30th International Workshop,WG 2004, Bad Honnef, Germany, June 21-23, 2004, Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {3353}, pages = {46--57}, publisher = {Springer}, year = {2004}, url = {https://doi.org/10.1007/978-3-540-30559-0\_4}, doi = {10.1007/978-3-540-30559-0\_4}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/CornelsenS04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/CrespelleP04, author = {Christophe Crespelle and Christophe Paul}, editor = {Juraj Hromkovic and Manfred Nagl and Bernhard Westfechtel}, title = {Fully-Dynamic Recognition Algorithm and Certificate for Directed Cographs}, booktitle = {Graph-Theoretic Concepts in Computer Science, 30th International Workshop,WG 2004, Bad Honnef, Germany, June 21-23, 2004, Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {3353}, pages = {93--104}, publisher = {Springer}, year = {2004}, url = {https://doi.org/10.1007/978-3-540-30559-0\_8}, doi = {10.1007/978-3-540-30559-0\_8}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/CrespelleP04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/DouradoPS04, author = {Mitre Costa Dourado and F{\'{a}}bio Protti and Jayme Luiz Szwarcfiter}, editor = {Juraj Hromkovic and Manfred Nagl and Bernhard Westfechtel}, title = {Characterization and Recognition of Generalized Clique-Helly Graphs}, booktitle = {Graph-Theoretic Concepts in Computer Science, 30th International Workshop,WG 2004, Bad Honnef, Germany, June 21-23, 2004, Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {3353}, pages = {344--354}, publisher = {Springer}, year = {2004}, url = {https://doi.org/10.1007/978-3-540-30559-0\_29}, doi = {10.1007/978-3-540-30559-0\_29}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/DouradoPS04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/DraganYC04, author = {Feodor F. Dragan and Chenyu Yan and Derek G. Corneil}, editor = {Juraj Hromkovic and Manfred Nagl and Bernhard Westfechtel}, title = {Collective Tree Spanners and Routing in AT-free Related Graphs}, booktitle = {Graph-Theoretic Concepts in Computer Science, 30th International Workshop,WG 2004, Bad Honnef, Germany, June 21-23, 2004, Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {3353}, pages = {68--80}, publisher = {Springer}, year = {2004}, url = {https://doi.org/10.1007/978-3-540-30559-0\_6}, doi = {10.1007/978-3-540-30559-0\_6}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/DraganYC04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/FellowsHRST04, author = {Mike Fellows and Pinar Heggernes and Frances A. Rosamond and Christian Sloper and Jan Arne Telle}, editor = {Juraj Hromkovic and Manfred Nagl and Bernhard Westfechtel}, title = {Finding k Disjoint Triangles in an Arbitrary Graph}, booktitle = {Graph-Theoretic Concepts in Computer Science, 30th International Workshop,WG 2004, Bad Honnef, Germany, June 21-23, 2004, Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {3353}, pages = {235--244}, publisher = {Springer}, year = {2004}, url = {https://doi.org/10.1007/978-3-540-30559-0\_20}, doi = {10.1007/978-3-540-30559-0\_20}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/FellowsHRST04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/FialaGK04, author = {Jir{\'{\i}} Fiala and Petr A. Golovach and Jan Kratochv{\'{\i}}l}, editor = {Juraj Hromkovic and Manfred Nagl and Bernhard Westfechtel}, title = {Elegant Distance Constrained Labelings of Trees}, booktitle = {Graph-Theoretic Concepts in Computer Science, 30th International Workshop,WG 2004, Bad Honnef, Germany, June 21-23, 2004, Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {3353}, pages = {58--67}, publisher = {Springer}, year = {2004}, url = {https://doi.org/10.1007/978-3-540-30559-0\_5}, doi = {10.1007/978-3-540-30559-0\_5}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/FialaGK04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/FominKW04, author = {Fedor V. Fomin and Dieter Kratsch and Gerhard J. Woeginger}, editor = {Juraj Hromkovic and Manfred Nagl and Bernhard Westfechtel}, title = {Exact (Exponential) Algorithms for the Dominating Set Problem}, booktitle = {Graph-Theoretic Concepts in Computer Science, 30th International Workshop,WG 2004, Bad Honnef, Germany, June 21-23, 2004, Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {3353}, pages = {245--256}, publisher = {Springer}, year = {2004}, url = {https://doi.org/10.1007/978-3-540-30559-0\_21}, doi = {10.1007/978-3-540-30559-0\_21}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/FominKW04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/FouquetHMV04, author = {Jean{-}Luc Fouquet and Michel Habib and Fabien de Montgolfier and Jean{-}Marie Vanherpe}, editor = {Juraj Hromkovic and Manfred Nagl and Bernhard Westfechtel}, title = {Bimodular Decomposition of Bipartite Graphs}, booktitle = {Graph-Theoretic Concepts in Computer Science, 30th International Workshop,WG 2004, Bad Honnef, Germany, June 21-23, 2004, Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {3353}, pages = {117--128}, publisher = {Springer}, year = {2004}, url = {https://doi.org/10.1007/978-3-540-30559-0\_10}, doi = {10.1007/978-3-540-30559-0\_10}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/FouquetHMV04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/GoldengorinST04, author = {Boris Goldengorin and Gerard Sierksma and Marcel Turkensteen}, editor = {Juraj Hromkovic and Manfred Nagl and Bernhard Westfechtel}, title = {Tolerance Based Algorithms for the {ATSP}}, booktitle = {Graph-Theoretic Concepts in Computer Science, 30th International Workshop,WG 2004, Bad Honnef, Germany, June 21-23, 2004, Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {3353}, pages = {222--234}, publisher = {Springer}, year = {2004}, url = {https://doi.org/10.1007/978-3-540-30559-0\_19}, doi = {10.1007/978-3-540-30559-0\_19}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/GoldengorinST04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/GolinL04, author = {Mordecai J. Golin and Yiu{-}Cho Leung}, editor = {Juraj Hromkovic and Manfred Nagl and Bernhard Westfechtel}, title = {Unhooking Circulant Graphs: {A} Combinatorial Method for Counting Spanning Trees and Other Parameters}, booktitle = {Graph-Theoretic Concepts in Computer Science, 30th International Workshop,WG 2004, Bad Honnef, Germany, June 21-23, 2004, Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {3353}, pages = {296--307}, publisher = {Springer}, year = {2004}, url = {https://doi.org/10.1007/978-3-540-30559-0\_25}, doi = {10.1007/978-3-540-30559-0\_25}, timestamp = {Mon, 05 Jun 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/GolinL04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/GrandoniI04, author = {Fabrizio Grandoni and Giuseppe F. Italiano}, editor = {Juraj Hromkovic and Manfred Nagl and Bernhard Westfechtel}, title = {Decremental Clique Problem}, booktitle = {Graph-Theoretic Concepts in Computer Science, 30th International Workshop,WG 2004, Bad Honnef, Germany, June 21-23, 2004, Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {3353}, pages = {142--153}, publisher = {Springer}, year = {2004}, url = {https://doi.org/10.1007/978-3-540-30559-0\_12}, doi = {10.1007/978-3-540-30559-0\_12}, timestamp = {Mon, 11 Dec 2017 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/wg/GrandoniI04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/ItoZN04, author = {Takehiro Ito and Xiao Zhou and Takao Nishizeki}, editor = {Juraj Hromkovic and Manfred Nagl and Bernhard Westfechtel}, title = {Partitioning a Weighted Graph to Connected Subgraphs of Almost Uniform Size}, booktitle = {Graph-Theoretic Concepts in Computer Science, 30th International Workshop,WG 2004, Bad Honnef, Germany, June 21-23, 2004, Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {3353}, pages = {365--376}, publisher = {Springer}, year = {2004}, url = {https://doi.org/10.1007/978-3-540-30559-0\_31}, doi = {10.1007/978-3-540-30559-0\_31}, timestamp = {Mon, 15 Jun 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/ItoZN04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/MorenoM04, author = {Eduardo Moreno and Mart{\'{\i}}n Matamala}, editor = {Juraj Hromkovic and Manfred Nagl and Bernhard Westfechtel}, title = {Minimal de Bruijn Sequence in a Language with Forbidden Substrings}, booktitle = {Graph-Theoretic Concepts in Computer Science, 30th International Workshop,WG 2004, Bad Honnef, Germany, June 21-23, 2004, Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {3353}, pages = {168--176}, publisher = {Springer}, year = {2004}, url = {https://doi.org/10.1007/978-3-540-30559-0\_14}, doi = {10.1007/978-3-540-30559-0\_14}, timestamp = {Thu, 05 Nov 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/wg/MorenoM04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/NakanoU04, author = {Shin{-}Ichi Nakano and Takeaki Uno}, editor = {Juraj Hromkovic and Manfred Nagl and Bernhard Westfechtel}, title = {Constant Time Generation of Trees with Specified Diameter}, booktitle = {Graph-Theoretic Concepts in Computer Science, 30th International Workshop,WG 2004, Bad Honnef, Germany, June 21-23, 2004, Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {3353}, pages = {33--45}, publisher = {Springer}, year = {2004}, url = {https://doi.org/10.1007/978-3-540-30559-0\_3}, doi = {10.1007/978-3-540-30559-0\_3}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/NakanoU04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/NiebergHK04, author = {Tim Nieberg and Johann L. Hurink and Walter Kern}, editor = {Juraj Hromkovic and Manfred Nagl and Bernhard Westfechtel}, title = {A Robust {PTAS} for Maximum Weight Independent Sets in Unit Disk Graphs}, booktitle = {Graph-Theoretic Concepts in Computer Science, 30th International Workshop,WG 2004, Bad Honnef, Germany, June 21-23, 2004, Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {3353}, pages = {214--221}, publisher = {Springer}, year = {2004}, url = {https://doi.org/10.1007/978-3-540-30559-0\_18}, doi = {10.1007/978-3-540-30559-0\_18}, timestamp = {Mon, 06 Apr 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/NiebergHK04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/NikolopoulosP04, author = {Stavros D. Nikolopoulos and Leonidas Palios}, editor = {Juraj Hromkovic and Manfred Nagl and Bernhard Westfechtel}, title = {Recognizing HHD-free and Welsh-Powell Opposition Graphs}, booktitle = {Graph-Theoretic Concepts in Computer Science, 30th International Workshop,WG 2004, Bad Honnef, Germany, June 21-23, 2004, Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {3353}, pages = {105--116}, publisher = {Springer}, year = {2004}, url = {https://doi.org/10.1007/978-3-540-30559-0\_9}, doi = {10.1007/978-3-540-30559-0\_9}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/NikolopoulosP04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/RahmanMN04, author = {Md. Saidur Rahman and Kazuyuki Miura and Takao Nishizeki}, editor = {Juraj Hromkovic and Manfred Nagl and Bernhard Westfechtel}, title = {Octagonal Drawings of Plane Graphs with Prescribed Face Areas}, booktitle = {Graph-Theoretic Concepts in Computer Science, 30th International Workshop,WG 2004, Bad Honnef, Germany, June 21-23, 2004, Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {3353}, pages = {320--331}, publisher = {Springer}, year = {2004}, url = {https://doi.org/10.1007/978-3-540-30559-0\_27}, doi = {10.1007/978-3-540-30559-0\_27}, timestamp = {Tue, 21 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/wg/RahmanMN04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/Rao04, author = {Micha{\"{e}}l Rao}, editor = {Juraj Hromkovic and Manfred Nagl and Bernhard Westfechtel}, title = {Coloring a Graph Using Split Decomposition}, booktitle = {Graph-Theoretic Concepts in Computer Science, 30th International Workshop,WG 2004, Bad Honnef, Germany, June 21-23, 2004, Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {3353}, pages = {129--141}, publisher = {Springer}, year = {2004}, url = {https://doi.org/10.1007/978-3-540-30559-0\_11}, doi = {10.1007/978-3-540-30559-0\_11}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/Rao04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/Sawitzki04, author = {Daniel Sawitzki}, editor = {Juraj Hromkovic and Manfred Nagl and Bernhard Westfechtel}, title = {A Symbolic Approach to the All-Pairs Shortest-Paths Problem}, booktitle = {Graph-Theoretic Concepts in Computer Science, 30th International Workshop,WG 2004, Bad Honnef, Germany, June 21-23, 2004, Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {3353}, pages = {154--167}, publisher = {Springer}, year = {2004}, url = {https://doi.org/10.1007/978-3-540-30559-0\_13}, doi = {10.1007/978-3-540-30559-0\_13}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/Sawitzki04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/Wattenhofer04, author = {Roger Wattenhofer}, editor = {Juraj Hromkovic and Manfred Nagl and Bernhard Westfechtel}, title = {Wireless Networking: Graph Theory Unplugged}, booktitle = {Graph-Theoretic Concepts in Computer Science, 30th International Workshop,WG 2004, Bad Honnef, Germany, June 21-23, 2004, Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {3353}, pages = {20--32}, publisher = {Springer}, year = {2004}, url = {https://doi.org/10.1007/978-3-540-30559-0\_2}, doi = {10.1007/978-3-540-30559-0\_2}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/Wattenhofer04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/WerraDMP04, author = {Dominique de Werra and Marc Demange and J{\'{e}}r{\^{o}}me Monnot and Vangelis Th. Paschos}, editor = {Juraj Hromkovic and Manfred Nagl and Bernhard Westfechtel}, title = {The Hypocoloring Problem: Complexity and Approximability Results when the Chromatic Number Is Small}, booktitle = {Graph-Theoretic Concepts in Computer Science, 30th International Workshop,WG 2004, Bad Honnef, Germany, June 21-23, 2004, Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {3353}, pages = {377--388}, publisher = {Springer}, year = {2004}, url = {https://doi.org/10.1007/978-3-540-30559-0\_32}, doi = {10.1007/978-3-540-30559-0\_32}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/WerraDMP04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@proceedings{DBLP:conf/wg/2004, editor = {Juraj Hromkovic and Manfred Nagl and Bernhard Westfechtel}, title = {Graph-Theoretic Concepts in Computer Science, 30th International Workshop,WG 2004, Bad Honnef, Germany, June 21-23, 2004, Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {3353}, publisher = {Springer}, year = {2004}, url = {https://doi.org/10.1007/b104584}, doi = {10.1007/B104584}, isbn = {3-540-24132-9}, timestamp = {Tue, 14 May 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/2004.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@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 = {Sun, 06 Oct 2024 01:00:00 +0200}, 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} }
@inproceedings{DBLP:conf/wg/BerryBH02, author = {Anne Berry and Jean R. S. Blair and Pinar Heggernes}, editor = {Ludek Kucera}, title = {Maximum Cardinality Search for Computing Minimal Triangulations}, booktitle = {Graph-Theoretic Concepts in Computer Science, 28th International Workshop, {WG} 2002, Cesky Krumlov, Czech Republic, June 13-15, 2002, Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {2573}, pages = {1--12}, publisher = {Springer}, year = {2002}, url = {https://doi.org/10.1007/3-540-36379-3\_1}, doi = {10.1007/3-540-36379-3\_1}, timestamp = {Tue, 14 May 2019 10:00:40 +0200}, biburl = {https://dblp.org/rec/conf/wg/BerryBH02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/BlazewiczFKSW02, author = {Jacek Blazewicz and Piotr Formanowicz and Marta Kasprzak and Petra Schuurman and Gerhard J. Woeginger}, editor = {Ludek Kucera}, title = {{DNA} Sequencing, Eulerian Graphs, and the Exact Perfect Matching Problem}, booktitle = {Graph-Theoretic Concepts in Computer Science, 28th International Workshop, {WG} 2002, Cesky Krumlov, Czech Republic, June 13-15, 2002, Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {2573}, pages = {13--24}, publisher = {Springer}, year = {2002}, url = {https://doi.org/10.1007/3-540-36379-3\_2}, doi = {10.1007/3-540-36379-3\_2}, timestamp = {Tue, 07 May 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/BlazewiczFKSW02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/Bodini02, author = {Olivier Bodini}, editor = {Ludek Kucera}, title = {On the Minimum Size of a Contraction-Universal Tree}, booktitle = {Graph-Theoretic Concepts in Computer Science, 28th International Workshop, {WG} 2002, Cesky Krumlov, Czech Republic, June 13-15, 2002, Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {2573}, pages = {25--34}, publisher = {Springer}, year = {2002}, url = {https://doi.org/10.1007/3-540-36379-3\_3}, doi = {10.1007/3-540-36379-3\_3}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/Bodini02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/BonichonSM02, author = {Nicolas Bonichon and Bertrand Le Sa{\"{e}}c and Mohamed Mosbah}, editor = {Ludek Kucera}, title = {Optimal Area Algorithm for Planar Polyline Drawings}, booktitle = {Graph-Theoretic Concepts in Computer Science, 28th International Workshop, {WG} 2002, Cesky Krumlov, Czech Republic, June 13-15, 2002, Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {2573}, pages = {35--46}, publisher = {Springer}, year = {2002}, url = {https://doi.org/10.1007/3-540-36379-3\_4}, doi = {10.1007/3-540-36379-3\_4}, timestamp = {Tue, 11 Oct 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/BonichonSM02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/Brandenburg02, author = {Franz{-}Josef Brandenburg}, editor = {Ludek Kucera}, title = {Cycles in Generalized Networks}, booktitle = {Graph-Theoretic Concepts in Computer Science, 28th International Workshop, {WG} 2002, Cesky Krumlov, Czech Republic, June 13-15, 2002, Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {2573}, pages = {47--56}, publisher = {Springer}, year = {2002}, url = {https://doi.org/10.1007/3-540-36379-3\_5}, doi = {10.1007/3-540-36379-3\_5}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/Brandenburg02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/BrandstadtDLM02, author = {Andreas Brandst{\"{a}}dt and Feodor F. Dragan and Ho{\`{a}}ng{-}Oanh Le and Raffaele Mosca}, editor = {Ludek Kucera}, title = {New Graph Classes of Bounded Clique-Width}, booktitle = {Graph-Theoretic Concepts in Computer Science, 28th International Workshop, {WG} 2002, Cesky Krumlov, Czech Republic, June 13-15, 2002, Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {2573}, pages = {57--67}, publisher = {Springer}, year = {2002}, url = {https://doi.org/10.1007/3-540-36379-3\_6}, doi = {10.1007/3-540-36379-3\_6}, timestamp = {Sun, 06 Oct 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/BrandstadtDLM02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/BroersmaFNW02, author = {Hajo Broersma and Fedor V. Fomin and Jaroslav Nesetril and Gerhard J. Woeginger}, editor = {Ludek Kucera}, title = {More about Subcolorings}, booktitle = {Graph-Theoretic Concepts in Computer Science, 28th International Workshop, {WG} 2002, Cesky Krumlov, Czech Republic, June 13-15, 2002, Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {2573}, pages = {68--79}, publisher = {Springer}, year = {2002}, url = {https://doi.org/10.1007/3-540-36379-3\_7}, doi = {10.1007/3-540-36379-3\_7}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/BroersmaFNW02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/Cournier02, author = {Alain Cournier}, editor = {Ludek Kucera}, title = {Search in Indecomposable Graphs}, booktitle = {Graph-Theoretic Concepts in Computer Science, 28th International Workshop, {WG} 2002, Cesky Krumlov, Czech Republic, June 13-15, 2002, Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {2573}, pages = {80--91}, publisher = {Springer}, year = {2002}, url = {https://doi.org/10.1007/3-540-36379-3\_8}, doi = {10.1007/3-540-36379-3\_8}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/Cournier02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/DantasFF02, author = {Simone Dantas and Celina M. H. de Figueiredo and Lu{\'{e}}rbio Faria}, editor = {Ludek Kucera}, title = {On the Complexity of (k, l)-Graph Sandwich Problems}, booktitle = {Graph-Theoretic Concepts in Computer Science, 28th International Workshop, {WG} 2002, Cesky Krumlov, Czech Republic, June 13-15, 2002, Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {2573}, pages = {92--101}, publisher = {Springer}, year = {2002}, url = {https://doi.org/10.1007/3-540-36379-3\_9}, doi = {10.1007/3-540-36379-3\_9}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/DantasFF02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/DemangeP02, author = {Marc Demange and Vangelis Th. Paschos}, editor = {Ludek Kucera}, title = {Algorithms and Models for the On-Line Vertex-Covering}, booktitle = {Graph-Theoretic Concepts in Computer Science, 28th International Workshop, {WG} 2002, Cesky Krumlov, Czech Republic, June 13-15, 2002, Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {2573}, pages = {102--113}, publisher = {Springer}, year = {2002}, url = {https://doi.org/10.1007/3-540-36379-3\_10}, doi = {10.1007/3-540-36379-3\_10}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/DemangeP02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/DemangeWMP02, author = {Marc Demange and Dominique de Werra and J{\'{e}}r{\^{o}}me Monnot and Vangelis Th. Paschos}, editor = {Ludek Kucera}, title = {Weighted Node Coloring: When Stable Sets Are Expensive}, booktitle = {Graph-Theoretic Concepts in Computer Science, 28th International Workshop, {WG} 2002, Cesky Krumlov, Czech Republic, June 13-15, 2002, Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {2573}, pages = {114--125}, publisher = {Springer}, year = {2002}, url = {https://doi.org/10.1007/3-540-36379-3\_11}, doi = {10.1007/3-540-36379-3\_11}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/DemangeWMP02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/DiazST02, author = {Josep D{\'{\i}}az and Maria J. Serna and Dimitrios M. Thilikos}, editor = {Ludek Kucera}, title = {The Complexity of Restrictive H-Coloring}, booktitle = {Graph-Theoretic Concepts in Computer Science, 28th International Workshop, {WG} 2002, Cesky Krumlov, Czech Republic, June 13-15, 2002, Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {2573}, pages = {126--137}, publisher = {Springer}, year = {2002}, url = {https://doi.org/10.1007/3-540-36379-3\_12}, doi = {10.1007/3-540-36379-3\_12}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/DiazST02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/DiksKK02, author = {Krzysztof Diks and Lukasz Kowalik and Maciej Kurowski}, editor = {Ludek Kucera}, title = {A New 3-Color Criterion for Planar Graphs}, booktitle = {Graph-Theoretic Concepts in Computer Science, 28th International Workshop, {WG} 2002, Cesky Krumlov, Czech Republic, June 13-15, 2002, Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {2573}, pages = {138--149}, publisher = {Springer}, year = {2002}, url = {https://doi.org/10.1007/3-540-36379-3\_13}, doi = {10.1007/3-540-36379-3\_13}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/DiksKK02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/Dourisboure02, author = {Yon Dourisboure}, editor = {Ludek Kucera}, title = {An Additive Stretched Routing Scheme for Chordal Graphs}, booktitle = {Graph-Theoretic Concepts in Computer Science, 28th International Workshop, {WG} 2002, Cesky Krumlov, Czech Republic, June 13-15, 2002, Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {2573}, pages = {150--163}, publisher = {Springer}, year = {2002}, url = {https://doi.org/10.1007/3-540-36379-3\_14}, doi = {10.1007/3-540-36379-3\_14}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/Dourisboure02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/DvorakKKP02, author = {Zdenek Dvor{\'{a}}k and Jan K{\'{a}}ra and Daniel Kr{\'{a}}l and Ondrej Pangr{\'{a}}c}, editor = {Ludek Kucera}, title = {Complexity of Pattern Coloring of Cycle Systems}, booktitle = {Graph-Theoretic Concepts in Computer Science, 28th International Workshop, {WG} 2002, Cesky Krumlov, Czech Republic, June 13-15, 2002, Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {2573}, pages = {164--175}, publisher = {Springer}, year = {2002}, url = {https://doi.org/10.1007/3-540-36379-3\_15}, doi = {10.1007/3-540-36379-3\_15}, timestamp = {Sun, 06 Oct 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/DvorakKKP02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/EijkhofB02, author = {Frank van den Eijkhof and Hans L. Bodlaender}, editor = {Ludek Kucera}, title = {Safe Reduction Rules for Weighted Treewidth}, booktitle = {Graph-Theoretic Concepts in Computer Science, 28th International Workshop, {WG} 2002, Cesky Krumlov, Czech Republic, June 13-15, 2002, Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {2573}, pages = {176--185}, publisher = {Springer}, year = {2002}, url = {https://doi.org/10.1007/3-540-36379-3\_16}, doi = {10.1007/3-540-36379-3\_16}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/EijkhofB02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/Fernau02, author = {Henning Fernau}, editor = {Ludek Kucera}, title = {Graph Separator Algorithms: {A} Refined Analysis}, booktitle = {Graph-Theoretic Concepts in Computer Science, 28th International Workshop, {WG} 2002, Cesky Krumlov, Czech Republic, June 13-15, 2002, Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {2573}, pages = {186--197}, publisher = {Springer}, year = {2002}, url = {https://doi.org/10.1007/3-540-36379-3\_17}, doi = {10.1007/3-540-36379-3\_17}, timestamp = {Tue, 21 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/wg/Fernau02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/FialaHKT02, author = {Jir{\'{\i}} Fiala and Pinar Heggernes and Petter Kristiansen and Jan Arne Telle}, editor = {Ludek Kucera}, title = {Generalized H-Coloring and H-Covering of Trees}, booktitle = {Graph-Theoretic Concepts in Computer Science, 28th International Workshop, {WG} 2002, Cesky Krumlov, Czech Republic, June 13-15, 2002, Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {2573}, pages = {198--210}, publisher = {Springer}, year = {2002}, url = {https://doi.org/10.1007/3-540-36379-3\_18}, doi = {10.1007/3-540-36379-3\_18}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/FialaHKT02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/FominMR02, author = {Fedor V. Fomin and Mart{\'{\i}}n Matamala and Ivan Rapaport}, editor = {Ludek Kucera}, title = {The Complexity of Approximating the Oriented Diameter of Chordal Graphs}, booktitle = {Graph-Theoretic Concepts in Computer Science, 28th International Workshop, {WG} 2002, Cesky Krumlov, Czech Republic, June 13-15, 2002, Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {2573}, pages = {211--222}, publisher = {Springer}, year = {2002}, url = {https://doi.org/10.1007/3-540-36379-3\_19}, doi = {10.1007/3-540-36379-3\_19}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/FominMR02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/FotakisNPS02, author = {Dimitris Fotakis and Sotiris E. Nikoletseas and Vicky G. Papadopoulou and Paul G. Spirakis}, editor = {Ludek Kucera}, title = {Radiocolorings in Periodic Planar Graphs: PSPACE-Completeness and Efficient Approximations for the Optimal Range of Frequencies}, booktitle = {Graph-Theoretic Concepts in Computer Science, 28th International Workshop, {WG} 2002, Cesky Krumlov, Czech Republic, June 13-15, 2002, Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {2573}, pages = {223--234}, publisher = {Springer}, year = {2002}, url = {https://doi.org/10.1007/3-540-36379-3\_20}, doi = {10.1007/3-540-36379-3\_20}, timestamp = {Thu, 24 Mar 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/wg/FotakisNPS02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/Hasunuma02, author = {Toru Hasunuma}, editor = {Ludek Kucera}, title = {Completely Independent Spanning Trees in Maximal Planar Graphs}, booktitle = {Graph-Theoretic Concepts in Computer Science, 28th International Workshop, {WG} 2002, Cesky Krumlov, Czech Republic, June 13-15, 2002, Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {2573}, pages = {235--245}, publisher = {Springer}, year = {2002}, url = {https://doi.org/10.1007/3-540-36379-3\_21}, doi = {10.1007/3-540-36379-3\_21}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/Hasunuma02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/HealyN02, author = {Patrick Healy and Nikola S. Nikolov}, editor = {Ludek Kucera}, title = {Facets of the Directed Acyclic Graph Layering Polytope}, booktitle = {Graph-Theoretic Concepts in Computer Science, 28th International Workshop, {WG} 2002, Cesky Krumlov, Czech Republic, June 13-15, 2002, Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {2573}, pages = {246--257}, publisher = {Springer}, year = {2002}, url = {https://doi.org/10.1007/3-540-36379-3\_22}, doi = {10.1007/3-540-36379-3\_22}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/HealyN02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/HemaspaandraRS02, author = {Edith Hemaspaandra and J{\"{o}}rg Rothe and Holger Spakowski}, editor = {Ludek Kucera}, title = {Recognizing When Heuristics Can Approximate Minimum Vertex Covers Is Complete for Parallel Access to {NP}}, booktitle = {Graph-Theoretic Concepts in Computer Science, 28th International Workshop, {WG} 2002, Cesky Krumlov, Czech Republic, June 13-15, 2002, Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {2573}, pages = {258--269}, publisher = {Springer}, year = {2002}, url = {https://doi.org/10.1007/3-540-36379-3\_23}, doi = {10.1007/3-540-36379-3\_23}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/HemaspaandraRS02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/IshiharaK02, author = {Hajime Ishihara and Bakhadyr Khoussainov}, editor = {Ludek Kucera}, title = {Complexity of Some Infinite Games Played on Finite Graphs}, booktitle = {Graph-Theoretic Concepts in Computer Science, 28th International Workshop, {WG} 2002, Cesky Krumlov, Czech Republic, June 13-15, 2002, Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {2573}, pages = {270--281}, publisher = {Springer}, year = {2002}, url = {https://doi.org/10.1007/3-540-36379-3\_24}, doi = {10.1007/3-540-36379-3\_24}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/IshiharaK02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/KloksLL02, author = {Ton Kloks and Chuan{-}Min Lee and Jiping Liu}, editor = {Ludek Kucera}, title = {New Algorithms for k-Face Cover, k-Feedback Vertex Set, and k -Disjoint Cycles on Plane and Planar Graphs}, booktitle = {Graph-Theoretic Concepts in Computer Science, 28th International Workshop, {WG} 2002, Cesky Krumlov, Czech Republic, June 13-15, 2002, Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {2573}, pages = {282--295}, publisher = {Springer}, year = {2002}, url = {https://doi.org/10.1007/3-540-36379-3\_25}, doi = {10.1007/3-540-36379-3\_25}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/KloksLL02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/KorenH02, author = {Yehuda Koren and David Harel}, editor = {Ludek Kucera}, title = {A Multi-scale Algorithm for the Linear Arrangement Problem}, booktitle = {Graph-Theoretic Concepts in Computer Science, 28th International Workshop, {WG} 2002, Cesky Krumlov, Czech Republic, June 13-15, 2002, Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {2573}, pages = {296--309}, publisher = {Springer}, year = {2002}, url = {https://doi.org/10.1007/3-540-36379-3\_26}, doi = {10.1007/3-540-36379-3\_26}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/KorenH02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/KratochvilTV02, author = {Jan Kratochv{\'{\i}}l and Zsolt Tuza and Margit Voigt}, editor = {Ludek Kucera}, title = {On the b-Chromatic Number of Graphs}, booktitle = {Graph-Theoretic Concepts in Computer Science, 28th International Workshop, {WG} 2002, Cesky Krumlov, Czech Republic, June 13-15, 2002, Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {2573}, pages = {310--320}, publisher = {Springer}, year = {2002}, url = {https://doi.org/10.1007/3-540-36379-3\_27}, doi = {10.1007/3-540-36379-3\_27}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/KratochvilTV02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/KrumkeMPRW02, author = {Sven Oliver Krumke and Madhav V. Marathe and Diana Poensgen and S. S. Ravi and Hans{-}Christoph Wirth}, editor = {Ludek Kucera}, title = {Budgeted Maximum Graph Coverage}, booktitle = {Graph-Theoretic Concepts in Computer Science, 28th International Workshop, {WG} 2002, Cesky Krumlov, Czech Republic, June 13-15, 2002, Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {2573}, pages = {321--332}, publisher = {Springer}, year = {2002}, url = {https://doi.org/10.1007/3-540-36379-3\_28}, doi = {10.1007/3-540-36379-3\_28}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/KrumkeMPRW02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/KrumkeP02, author = {Sven Oliver Krumke and Diana Poensgen}, editor = {Ludek Kucera}, title = {Online Call Admission in Optical Networks with Larger Demands}, booktitle = {Graph-Theoretic Concepts in Computer Science, 28th International Workshop, {WG} 2002, Cesky Krumlov, Czech Republic, June 13-15, 2002, Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {2573}, pages = {333--344}, publisher = {Springer}, year = {2002}, url = {https://doi.org/10.1007/3-540-36379-3\_29}, doi = {10.1007/3-540-36379-3\_29}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/KrumkeP02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/LariRS02, author = {Isabella Lari and Federica Ricca and Andrea Scozzari}, editor = {Ludek Kucera}, title = {The Forest Wrapping Problem on Outerplanar Graphs}, booktitle = {Graph-Theoretic Concepts in Computer Science, 28th International Workshop, {WG} 2002, Cesky Krumlov, Czech Republic, June 13-15, 2002, Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {2573}, pages = {345--354}, publisher = {Springer}, year = {2002}, url = {https://doi.org/10.1007/3-540-36379-3\_30}, doi = {10.1007/3-540-36379-3\_30}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/LariRS02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/NikolopoulosP02, author = {Stavros D. Nikolopoulos and Leonidas Palios}, editor = {Ludek Kucera}, title = {On the Recognition of P\({}_{\mbox{4}}\)-Comparability Graphs}, booktitle = {Graph-Theoretic Concepts in Computer Science, 28th International Workshop, {WG} 2002, Cesky Krumlov, Czech Republic, June 13-15, 2002, Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {2573}, pages = {355--366}, publisher = {Springer}, year = {2002}, url = {https://doi.org/10.1007/3-540-36379-3\_31}, doi = {10.1007/3-540-36379-3\_31}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/NikolopoulosP02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/RahmanN02, author = {Md. Saidur Rahman and Takao Nishizeki}, editor = {Ludek Kucera}, title = {Bend-Minimum Orthogonal Drawings of Plane 3-Graphs}, booktitle = {Graph-Theoretic Concepts in Computer Science, 28th International Workshop, {WG} 2002, Cesky Krumlov, Czech Republic, June 13-15, 2002, Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {2573}, pages = {367--378}, publisher = {Springer}, year = {2002}, url = {https://doi.org/10.1007/3-540-36379-3\_32}, doi = {10.1007/3-540-36379-3\_32}, timestamp = {Tue, 21 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/wg/RahmanN02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/ShamirST02, author = {Ron Shamir and Roded Sharan and Dekel Tsur}, editor = {Ludek Kucera}, title = {Cluster Graph Modification Problems}, booktitle = {Graph-Theoretic Concepts in Computer Science, 28th International Workshop, {WG} 2002, Cesky Krumlov, Czech Republic, June 13-15, 2002, Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {2573}, pages = {379--390}, publisher = {Springer}, year = {2002}, url = {https://doi.org/10.1007/3-540-36379-3\_33}, doi = {10.1007/3-540-36379-3\_33}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/ShamirST02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/SykoraSV02, author = {Ondrej S{\'{y}}kora and L{\'{a}}szl{\'{o}} A. Sz{\'{e}}kely and Imrich Vrto}, editor = {Ludek Kucera}, title = {Two Counterexamples in Graph Drawing}, booktitle = {Graph-Theoretic Concepts in Computer Science, 28th International Workshop, {WG} 2002, Cesky Krumlov, Czech Republic, June 13-15, 2002, Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {2573}, pages = {391--398}, publisher = {Springer}, year = {2002}, url = {https://doi.org/10.1007/3-540-36379-3\_34}, doi = {10.1007/3-540-36379-3\_34}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/SykoraSV02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/Vikas02, author = {Narayan Vikas}, editor = {Ludek Kucera}, title = {Connected and Loosely Connected List Homomorphisms}, booktitle = {Graph-Theoretic Concepts in Computer Science, 28th International Workshop, {WG} 2002, Cesky Krumlov, Czech Republic, June 13-15, 2002, Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {2573}, pages = {399--412}, publisher = {Springer}, year = {2002}, url = {https://doi.org/10.1007/3-540-36379-3\_35}, doi = {10.1007/3-540-36379-3\_35}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/Vikas02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/Wanka02, author = {Rolf Wanka}, editor = {Ludek Kucera}, title = {Any Load-Balancing Regimen for Evolving Tree Computations on Circulant Graphs Is Asymptotically Optimal}, booktitle = {Graph-Theoretic Concepts in Computer Science, 28th International Workshop, {WG} 2002, Cesky Krumlov, Czech Republic, June 13-15, 2002, Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {2573}, pages = {413--420}, publisher = {Springer}, year = {2002}, url = {https://doi.org/10.1007/3-540-36379-3\_36}, doi = {10.1007/3-540-36379-3\_36}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/Wanka02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@proceedings{DBLP:conf/wg/2002, editor = {Ludek Kucera}, title = {Graph-Theoretic Concepts in Computer Science, 28th International Workshop, {WG} 2002, Cesky Krumlov, Czech Republic, June 13-15, 2002, Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {2573}, publisher = {Springer}, year = {2002}, url = {https://doi.org/10.1007/3-540-36379-3}, doi = {10.1007/3-540-36379-3}, isbn = {3-540-00331-2}, timestamp = {Tue, 14 May 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/2002.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/Bandelt01, author = {Hans{-}J{\"{u}}rgen Bandelt}, editor = {Andreas Brandst{\"{a}}dt and Van Bang Le}, title = {Invited Presentation: Median Hulls as Steiner Hulls in Rectilinear and Molecular Sequence Spaces}, booktitle = {Graph-Theoretic Concepts in Computer Science, 27th International Workshop, {WG} 2001, Boltenhagen, Germany, June 14-16, 2001, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {2204}, pages = {1--7}, publisher = {Springer}, year = {2001}, url = {https://doi.org/10.1007/3-540-45477-2\_1}, doi = {10.1007/3-540-45477-2\_1}, timestamp = {Tue, 14 May 2019 10:00:40 +0200}, biburl = {https://dblp.org/rec/conf/wg/Bandelt01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/BezrukovE01, author = {Sergei L. Bezrukov and Robert Els{\"{a}}sser}, editor = {Andreas Brandst{\"{a}}dt and Van Bang Le}, title = {Edge-Isoperimetric Problems for Cartesian Powers of Regular Graphs}, booktitle = {Graph-Theoretic Concepts in Computer Science, 27th International Workshop, {WG} 2001, Boltenhagen, Germany, June 14-16, 2001, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {2204}, pages = {9--20}, publisher = {Springer}, year = {2001}, url = {https://doi.org/10.1007/3-540-45477-2\_3}, doi = {10.1007/3-540-45477-2\_3}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/BezrukovE01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/CaragiannisFKPPR01, author = {Ioannis Caragiannis and Afonso Ferreira and Christos Kaklamanis and Stephane Perennes and Pino Persiano and Herv{\'{e}} Rivano}, editor = {Andreas Brandst{\"{a}}dt and Van Bang Le}, title = {Approximate Constrained Bipartite Edge Coloring}, booktitle = {Graph-Theoretic Concepts in Computer Science, 27th International Workshop, {WG} 2001, Boltenhagen, Germany, June 14-16, 2001, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {2204}, pages = {21--31}, publisher = {Springer}, year = {2001}, url = {https://doi.org/10.1007/3-540-45477-2\_4}, doi = {10.1007/3-540-45477-2\_4}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/CaragiannisFKPPR01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/ChangKL01, author = {Maw{-}Shang Chang and Ton Kloks and Chuan{-}Min Lee}, editor = {Andreas Brandst{\"{a}}dt and Van Bang Le}, title = {Maximum Clique Transversals}, booktitle = {Graph-Theoretic Concepts in Computer Science, 27th International Workshop, {WG} 2001, Boltenhagen, Germany, June 14-16, 2001, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {2204}, pages = {32--43}, publisher = {Springer}, year = {2001}, url = {https://doi.org/10.1007/3-540-45477-2\_5}, doi = {10.1007/3-540-45477-2\_5}, timestamp = {Wed, 14 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/wg/ChangKL01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/ChangM01, author = {Maw{-}Shang Chang and Haiko M{\"{u}}ller}, editor = {Andreas Brandst{\"{a}}dt and Van Bang Le}, title = {On the Tree-Degree of Graphs}, booktitle = {Graph-Theoretic Concepts in Computer Science, 27th International Workshop, {WG} 2001, Boltenhagen, Germany, June 14-16, 2001, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {2204}, pages = {44--54}, publisher = {Springer}, year = {2001}, url = {https://doi.org/10.1007/3-540-45477-2\_6}, doi = {10.1007/3-540-45477-2\_6}, timestamp = {Sun, 12 Nov 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/wg/ChangM01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/ChenK01, author = {Jianer Chen and Iyad A. Kanj}, editor = {Andreas Brandst{\"{a}}dt and Van Bang Le}, title = {On Constrained Minimum Vertex Covers of Bipartite Graphs: Improved Algorithms}, booktitle = {Graph-Theoretic Concepts in Computer Science, 27th International Workshop, {WG} 2001, Boltenhagen, Germany, June 14-16, 2001, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {2204}, pages = {55--65}, publisher = {Springer}, year = {2001}, url = {https://doi.org/10.1007/3-540-45477-2\_7}, doi = {10.1007/3-540-45477-2\_7}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/ChenK01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/CiceroneDS01, author = {Serafino Cicerone and Gianluca D'Ermiliis and Gabriele Di Stefano}, editor = {Andreas Brandst{\"{a}}dt and Van Bang Le}, title = {(k, +)-Distance-Hereditary Graphs}, booktitle = {Graph-Theoretic Concepts in Computer Science, 27th International Workshop, {WG} 2001, Boltenhagen, Germany, June 14-16, 2001, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {2204}, pages = {66--77}, publisher = {Springer}, year = {2001}, url = {https://doi.org/10.1007/3-540-45477-2\_8}, doi = {10.1007/3-540-45477-2\_8}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/CiceroneDS01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/CorneilR01, author = {Derek G. Corneil and Udi Rotics}, editor = {Andreas Brandst{\"{a}}dt and Van Bang Le}, title = {On the Relationship between Clique-Width and Treewidth}, booktitle = {Graph-Theoretic Concepts in Computer Science, 27th International Workshop, {WG} 2001, Boltenhagen, Germany, June 14-16, 2001, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {2204}, pages = {78--90}, publisher = {Springer}, year = {2001}, url = {https://doi.org/10.1007/3-540-45477-2\_9}, doi = {10.1007/3-540-45477-2\_9}, timestamp = {Sun, 02 Jun 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/CorneilR01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/CornelsenDW01, author = {Sabine Cornelsen and Yefim Dinitz and Dorothea Wagner}, editor = {Andreas Brandst{\"{a}}dt and Van Bang Le}, title = {Planarity of the 2-Level Cactus Model}, booktitle = {Graph-Theoretic Concepts in Computer Science, 27th International Workshop, {WG} 2001, Boltenhagen, Germany, June 14-16, 2001, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {2204}, pages = {91--102}, publisher = {Springer}, year = {2001}, url = {https://doi.org/10.1007/3-540-45477-2\_10}, doi = {10.1007/3-540-45477-2\_10}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/CornelsenDW01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/Dragan01, author = {Feodor F. Dragan}, editor = {Andreas Brandst{\"{a}}dt and Van Bang Le}, title = {Estimating All Pairs Shortest Paths in Restricted Graph Families: {A} Unified Approach}, booktitle = {Graph-Theoretic Concepts in Computer Science, 27th International Workshop, {WG} 2001, Boltenhagen, Germany, June 14-16, 2001, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {2204}, pages = {103--116}, publisher = {Springer}, year = {2001}, url = {https://doi.org/10.1007/3-540-45477-2\_11}, doi = {10.1007/3-540-45477-2\_11}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/Dragan01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/EspelageGW01, author = {Wolfgang Espelage and Frank Gurski and Egon Wanke}, editor = {Andreas Brandst{\"{a}}dt and Van Bang Le}, title = {How to Solve NP-hard Graph Problems on Clique-Width Bounded Graphs in Polynomial Time}, booktitle = {Graph-Theoretic Concepts in Computer Science, 27th International Workshop, {WG} 2001, Boltenhagen, Germany, June 14-16, 2001, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {2204}, pages = {117--128}, publisher = {Springer}, year = {2001}, url = {https://doi.org/10.1007/3-540-45477-2\_12}, doi = {10.1007/3-540-45477-2\_12}, timestamp = {Sun, 25 Oct 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/EspelageGW01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/Feng01, author = {Haodi Feng}, editor = {Andreas Brandst{\"{a}}dt and Van Bang Le}, title = {(g, f)-Factorizations Orthogonal to k Subgraphs}, booktitle = {Graph-Theoretic Concepts in Computer Science, 27th International Workshop, {WG} 2001, Boltenhagen, Germany, June 14-16, 2001, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {2204}, pages = {129--139}, publisher = {Springer}, year = {2001}, url = {https://doi.org/10.1007/3-540-45477-2\_13}, doi = {10.1007/3-540-45477-2\_13}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/Feng01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/FertinRR01, author = {Guillaume Fertin and Andr{\'{e}} Raspaud and Bruce A. Reed}, editor = {Andreas Brandst{\"{a}}dt and Van Bang Le}, title = {On Star Coloring of Graphs}, booktitle = {Graph-Theoretic Concepts in Computer Science, 27th International Workshop, {WG} 2001, Boltenhagen, Germany, June 14-16, 2001, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {2204}, pages = {140--153}, publisher = {Springer}, year = {2001}, url = {https://doi.org/10.1007/3-540-45477-2\_14}, doi = {10.1007/3-540-45477-2\_14}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/FertinRR01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/FialaJLS01, author = {Jir{\'{\i}} Fiala and Klaus Jansen and Van Bang Le and Eike Seidel}, editor = {Andreas Brandst{\"{a}}dt and Van Bang Le}, title = {Graph Subcolorings: Complexity and Algorithms}, booktitle = {Graph-Theoretic Concepts in Computer Science, 27th International Workshop, {WG} 2001, Boltenhagen, Germany, June 14-16, 2001, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {2204}, pages = {154--165}, publisher = {Springer}, year = {2001}, url = {https://doi.org/10.1007/3-540-45477-2\_15}, doi = {10.1007/3-540-45477-2\_15}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/FialaJLS01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/FominB01, author = {Fedor V. Fomin and Hans L. Bodlaender}, editor = {Andreas Brandst{\"{a}}dt and Van Bang Le}, title = {Approximation of Pathwidth of Outerplanar Graphs}, booktitle = {Graph-Theoretic Concepts in Computer Science, 27th International Workshop, {WG} 2001, Boltenhagen, Germany, June 14-16, 2001, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {2204}, pages = {166--176}, publisher = {Springer}, year = {2001}, url = {https://doi.org/10.1007/3-540-45477-2\_16}, doi = {10.1007/3-540-45477-2\_16}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/FominB01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/FominT01, author = {Fedor V. Fomin and Dimitrios M. Thilikos}, editor = {Andreas Brandst{\"{a}}dt and Van Bang Le}, title = {On the Monotonicity of Games Generated by Symmetric Submodular Functions}, booktitle = {Graph-Theoretic Concepts in Computer Science, 27th International Workshop, {WG} 2001, Boltenhagen, Germany, June 14-16, 2001, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {2204}, pages = {177--188}, publisher = {Springer}, year = {2001}, url = {https://doi.org/10.1007/3-540-45477-2\_17}, doi = {10.1007/3-540-45477-2\_17}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/FominT01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/FuhrmannKW01, author = {Sven Fuhrmann and Sven Oliver Krumke and Hans{-}Christoph Wirth}, editor = {Andreas Brandst{\"{a}}dt and Van Bang Le}, title = {Multiple Hotlink Assignment}, booktitle = {Graph-Theoretic Concepts in Computer Science, 27th International Workshop, {WG} 2001, Boltenhagen, Germany, June 14-16, 2001, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {2204}, pages = {189--200}, publisher = {Springer}, year = {2001}, url = {https://doi.org/10.1007/3-540-45477-2\_18}, doi = {10.1007/3-540-45477-2\_18}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/FuhrmannKW01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/GavoillePRS01, author = {Cyril Gavoille and David Peleg and Andr{\'{e}} Raspaud and {\'{E}}ric Sopena}, editor = {Andreas Brandst{\"{a}}dt and Van Bang Le}, title = {Small k-Dominating Sets in Planar Graphs with Applications}, booktitle = {Graph-Theoretic Concepts in Computer Science, 27th International Workshop, {WG} 2001, Boltenhagen, Germany, June 14-16, 2001, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {2204}, pages = {201--216}, publisher = {Springer}, year = {2001}, url = {https://doi.org/10.1007/3-540-45477-2\_19}, doi = {10.1007/3-540-45477-2\_19}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/GavoillePRS01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/GroplHNP01, author = {Clemens Gr{\"{o}}pl and Stefan Hougardy and Till Nierhoff and Hans J{\"{u}}rgen Pr{\"{o}}mel}, editor = {Andreas Brandst{\"{a}}dt and Van Bang Le}, title = {Lower Bounds for Approximation Algorithms for the Steiner Tree Problem}, booktitle = {Graph-Theoretic Concepts in Computer Science, 27th International Workshop, {WG} 2001, Boltenhagen, Germany, June 14-16, 2001, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {2204}, pages = {217--228}, publisher = {Springer}, year = {2001}, url = {https://doi.org/10.1007/3-540-45477-2\_20}, doi = {10.1007/3-540-45477-2\_20}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/GroplHNP01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/Heide01, author = {Friedhelm Meyer auf der Heide}, editor = {Andreas Brandst{\"{a}}dt and Van Bang Le}, title = {Invited Presentation: Data Management in Networks}, booktitle = {Graph-Theoretic Concepts in Computer Science, 27th International Workshop, {WG} 2001, Boltenhagen, Germany, June 14-16, 2001, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {2204}, pages = {8}, publisher = {Springer}, year = {2001}, url = {https://doi.org/10.1007/3-540-45477-2\_2}, doi = {10.1007/3-540-45477-2\_2}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/Heide01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/Johansson01, author = {{\"{O}}jvind Johansson}, editor = {Andreas Brandst{\"{a}}dt and Van Bang Le}, title = {log n-Approximative NLC\({}_{\mbox{k}}\)-Decomposition in O(n\({}^{\mbox{2k+1}}\)) Time}, booktitle = {Graph-Theoretic Concepts in Computer Science, 27th International Workshop, {WG} 2001, Boltenhagen, Germany, June 14-16, 2001, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {2204}, pages = {229--240}, publisher = {Springer}, year = {2001}, url = {https://doi.org/10.1007/3-540-45477-2\_21}, doi = {10.1007/3-540-45477-2\_21}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/Johansson01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/KohlerCOS01, author = {Ekkehard K{\"{o}}hler and Derek G. Corneil and Stephan Olariu and Lorna Stewart}, editor = {Andreas Brandst{\"{a}}dt and Van Bang Le}, title = {On Subfamilies of AT-Free Graphs}, booktitle = {Graph-Theoretic Concepts in Computer Science, 27th International Workshop, {WG} 2001, Boltenhagen, Germany, June 14-16, 2001, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {2204}, pages = {241--253}, publisher = {Springer}, year = {2001}, url = {https://doi.org/10.1007/3-540-45477-2\_22}, doi = {10.1007/3-540-45477-2\_22}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/KohlerCOS01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/KralKTW01, author = {Daniel Kr{\'{a}}l and Jan Kratochv{\'{\i}}l and Zsolt Tuza and Gerhard J. Woeginger}, editor = {Andreas Brandst{\"{a}}dt and Van Bang Le}, title = {Complexity of Coloring Graphs without Forbidden Induced Subgraphs}, booktitle = {Graph-Theoretic Concepts in Computer Science, 27th International Workshop, {WG} 2001, Boltenhagen, Germany, June 14-16, 2001, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {2204}, pages = {254--262}, publisher = {Springer}, year = {2001}, url = {https://doi.org/10.1007/3-540-45477-2\_23}, doi = {10.1007/3-540-45477-2\_23}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/KralKTW01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/LeR01, author = {Van Bang Le and Bert Randerath}, editor = {Andreas Brandst{\"{a}}dt and Van Bang Le}, title = {On Stable Cutsets in Line Graphs}, booktitle = {Graph-Theoretic Concepts in Computer Science, 27th International Workshop, {WG} 2001, Boltenhagen, Germany, June 14-16, 2001, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {2204}, pages = {263--271}, publisher = {Springer}, year = {2001}, url = {https://doi.org/10.1007/3-540-45477-2\_24}, doi = {10.1007/3-540-45477-2\_24}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/LeR01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/OhC01, author = {Eunseuk Oh and Jianer Chen}, editor = {Andreas Brandst{\"{a}}dt and Van Bang Le}, title = {On Strong Menger-Connectivity of Star Graphs}, booktitle = {Graph-Theoretic Concepts in Computer Science, 27th International Workshop, {WG} 2001, Boltenhagen, Germany, June 14-16, 2001, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {2204}, pages = {272--283}, publisher = {Springer}, year = {2001}, url = {https://doi.org/10.1007/3-540-45477-2\_25}, doi = {10.1007/3-540-45477-2\_25}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/OhC01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/PatrignaniP01, author = {Maurizio Patrignani and Maurizio Pizzonia}, editor = {Andreas Brandst{\"{a}}dt and Van Bang Le}, title = {The Complexity of the Matching-Cut Problem}, booktitle = {Graph-Theoretic Concepts in Computer Science, 27th International Workshop, {WG} 2001, Boltenhagen, Germany, June 14-16, 2001, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {2204}, pages = {284--295}, publisher = {Springer}, year = {2001}, url = {https://doi.org/10.1007/3-540-45477-2\_26}, doi = {10.1007/3-540-45477-2\_26}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/PatrignaniP01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/PendavinghSW01, author = {Rudi Pendavingh and Petra Schuurman and Gerhard J. Woeginger}, editor = {Andreas Brandst{\"{a}}dt and Van Bang Le}, title = {De Bruijn Graphs and {DNA} Graphs}, booktitle = {Graph-Theoretic Concepts in Computer Science, 27th International Workshop, {WG} 2001, Boltenhagen, Germany, June 14-16, 2001, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {2204}, pages = {296--305}, publisher = {Springer}, year = {2001}, url = {https://doi.org/10.1007/3-540-45477-2\_27}, doi = {10.1007/3-540-45477-2\_27}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/PendavinghSW01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/PuricellaS01, author = {Antonio Puricella and Iain A. Stewart}, editor = {Andreas Brandst{\"{a}}dt and Van Bang Le}, title = {A Generic Greedy Algorithm, Partially-Ordered Graphs and NP-Completeness}, booktitle = {Graph-Theoretic Concepts in Computer Science, 27th International Workshop, {WG} 2001, Boltenhagen, Germany, June 14-16, 2001, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {2204}, pages = {306--316}, publisher = {Springer}, year = {2001}, url = {https://doi.org/10.1007/3-540-45477-2\_28}, doi = {10.1007/3-540-45477-2\_28}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/PuricellaS01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/Wagler01, author = {Annegret Wagler}, editor = {Andreas Brandst{\"{a}}dt and Van Bang Le}, title = {Critical and Anticritical Edges in Perfect Graphs}, booktitle = {Graph-Theoretic Concepts in Computer Science, 27th International Workshop, {WG} 2001, Boltenhagen, Germany, June 14-16, 2001, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {2204}, pages = {317--328}, publisher = {Springer}, year = {2001}, url = {https://doi.org/10.1007/3-540-45477-2\_29}, doi = {10.1007/3-540-45477-2\_29}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/Wagler01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@proceedings{DBLP:conf/wg/2001, editor = {Andreas Brandst{\"{a}}dt and Van Bang Le}, title = {Graph-Theoretic Concepts in Computer Science, 27th International Workshop, {WG} 2001, Boltenhagen, Germany, June 14-16, 2001, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {2204}, publisher = {Springer}, year = {2001}, url = {https://doi.org/10.1007/3-540-45477-2}, doi = {10.1007/3-540-45477-2}, isbn = {3-540-42707-4}, timestamp = {Tue, 14 May 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/2001.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/BecchettiIM00, author = {Luca Becchetti and Miriam Di Ianni and Alberto Marchetti{-}Spaccamela}, editor = {Ulrik Brandes and Dorothea Wagner}, title = {Approximating Call-Scheduling Makespan in All-Optical Networks}, booktitle = {Graph-Theoretic Concepts in Computer Science, 26th International Workshop, {WG} 2000, Konstanz, Germany, June 15-17, 2000, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {1928}, pages = {13--22}, publisher = {Springer}, year = {2000}, url = {https://doi.org/10.1007/3-540-40064-8\_3}, doi = {10.1007/3-540-40064-8\_3}, timestamp = {Sun, 04 Aug 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/BecchettiIM00.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/BezrukovEMPT00, author = {Sergei L. Bezrukov and Robert Els{\"{a}}sser and Burkhard Monien and Robert Preis and Jean{-}Pierre Tillich}, editor = {Ulrik Brandes and Dorothea Wagner}, title = {New Spectral Lower Bounds on the Bisection Width of Graphs}, booktitle = {Graph-Theoretic Concepts in Computer Science, 26th International Workshop, {WG} 2000, Konstanz, Germany, June 15-17, 2000, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {1928}, pages = {23--34}, publisher = {Springer}, year = {2000}, url = {https://doi.org/10.1007/3-540-40064-8\_4}, doi = {10.1007/3-540-40064-8\_4}, timestamp = {Wed, 24 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/BezrukovEMPT00.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/BhattEGT00, author = {Sandeep N. Bhatt and Shimon Even and David S. Greenberg and Rafi Tayar}, editor = {Ulrik Brandes and Dorothea Wagner}, title = {Traversing Directed Eulerian Mazes}, booktitle = {Graph-Theoretic Concepts in Computer Science, 26th International Workshop, {WG} 2000, Konstanz, Germany, June 15-17, 2000, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {1928}, pages = {35--46}, publisher = {Springer}, year = {2000}, url = {https://doi.org/10.1007/3-540-40064-8\_5}, doi = {10.1007/3-540-40064-8\_5}, timestamp = {Wed, 24 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/BhattEGT00.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/BilardiPD00, author = {Gianfranco Bilardi and Andrea Pietracaprina and Paolo D'Alberto}, editor = {Ulrik Brandes and Dorothea Wagner}, title = {On the Space and Access Complexity of Computation DAGs}, booktitle = {Graph-Theoretic Concepts in Computer Science, 26th International Workshop, {WG} 2000, Konstanz, Germany, June 15-17, 2000, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {1928}, pages = {47--58}, publisher = {Springer}, year = {2000}, url = {https://doi.org/10.1007/3-540-40064-8\_6}, doi = {10.1007/3-540-40064-8\_6}, timestamp = {Wed, 24 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/BilardiPD00.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/BouchitteT00, author = {Vincent Bouchitt{\'{e}} and Ioan Todinca}, editor = {Ulrik Brandes and Dorothea Wagner}, title = {Approximating the Treewidth of AT-Free Graphs}, booktitle = {Graph-Theoretic Concepts in Computer Science, 26th International Workshop, {WG} 2000, Konstanz, Germany, June 15-17, 2000, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {1928}, pages = {59--70}, publisher = {Springer}, year = {2000}, url = {https://doi.org/10.1007/3-540-40064-8\_7}, doi = {10.1007/3-540-40064-8\_7}, timestamp = {Wed, 24 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/BouchitteT00.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/BrandstadtL00, author = {Andreas Brandst{\"{a}}dt and Van Bang Le}, editor = {Ulrik Brandes and Dorothea Wagner}, title = {Split-Perfect Graphs: Characterizations and Algorithmic Use}, booktitle = {Graph-Theoretic Concepts in Computer Science, 26th International Workshop, {WG} 2000, Konstanz, Germany, June 15-17, 2000, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {1928}, pages = {71--82}, publisher = {Springer}, year = {2000}, url = {https://doi.org/10.1007/3-540-40064-8\_8}, doi = {10.1007/3-540-40064-8\_8}, timestamp = {Wed, 24 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/BrandstadtL00.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/CaceresCDP00, author = {Edson C{\'{a}}ceres and Albert Chan and Frank K. H. A. Dehne and Giuseppe Prencipe}, editor = {Ulrik Brandes and Dorothea Wagner}, title = {Coarse Grained Parallel Algorithms for Detecting Convex Bipartite Graphs}, booktitle = {Graph-Theoretic Concepts in Computer Science, 26th International Workshop, {WG} 2000, Konstanz, Germany, June 15-17, 2000, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {1928}, pages = {83--94}, publisher = {Springer}, year = {2000}, url = {https://doi.org/10.1007/3-540-40064-8\_9}, doi = {10.1007/3-540-40064-8\_9}, timestamp = {Fri, 09 Apr 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/CaceresCDP00.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/CiceroneS00, author = {Serafino Cicerone and Gabriele Di Stefano}, editor = {Ulrik Brandes and Dorothea Wagner}, title = {Networks with Small Stretch Number}, booktitle = {Graph-Theoretic Concepts in Computer Science, 26th International Workshop, {WG} 2000, Konstanz, Germany, June 15-17, 2000, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {1928}, pages = {95--106}, publisher = {Springer}, year = {2000}, url = {https://doi.org/10.1007/3-540-40064-8\_10}, doi = {10.1007/3-540-40064-8\_10}, timestamp = {Thu, 15 Jun 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/CiceroneS00.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/Damaschke00, author = {Peter Damaschke}, editor = {Ulrik Brandes and Dorothea Wagner}, title = {Efficient Dispersion Algorithms for Geometric Intersection Graphs}, booktitle = {Graph-Theoretic Concepts in Computer Science, 26th International Workshop, {WG} 2000, Konstanz, Germany, June 15-17, 2000, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {1928}, pages = {107--115}, publisher = {Springer}, year = {2000}, url = {https://doi.org/10.1007/3-540-40064-8\_11}, doi = {10.1007/3-540-40064-8\_11}, timestamp = {Wed, 24 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/Damaschke00.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/DemgenskyNW00, author = {Ingo Demgensky and Hartmut Noltemeier and Hans{-}Christoph Wirth}, editor = {Ulrik Brandes and Dorothea Wagner}, title = {Optimizing Cost Flows by Modifying Arc Costs and Capacities}, booktitle = {Graph-Theoretic Concepts in Computer Science, 26th International Workshop, {WG} 2000, Konstanz, Germany, June 15-17, 2000, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {1928}, pages = {116--126}, publisher = {Springer}, year = {2000}, url = {https://doi.org/10.1007/3-540-40064-8\_12}, doi = {10.1007/3-540-40064-8\_12}, timestamp = {Wed, 24 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/DemgenskyNW00.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/DinneenK00, author = {Michael J. Dinneen and Bakhadyr Khoussainov}, editor = {Ulrik Brandes and Dorothea Wagner}, title = {Update Networks and Their Routing Strategies}, booktitle = {Graph-Theoretic Concepts in Computer Science, 26th International Workshop, {WG} 2000, Konstanz, Germany, June 15-17, 2000, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {1928}, pages = {127--136}, publisher = {Springer}, year = {2000}, url = {https://doi.org/10.1007/3-540-40064-8\_13}, doi = {10.1007/3-540-40064-8\_13}, timestamp = {Wed, 24 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/DinneenK00.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/Dobrev00, author = {Stefan Dobrev}, editor = {Ulrik Brandes and Dorothea Wagner}, title = {Computing Input Multiplicity in Anonymous Synchronous Networks with Dynamic Faults}, booktitle = {Graph-Theoretic Concepts in Computer Science, 26th International Workshop, {WG} 2000, Konstanz, Germany, June 15-17, 2000, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {1928}, pages = {137--148}, publisher = {Springer}, year = {2000}, url = {https://doi.org/10.1007/3-540-40064-8\_14}, doi = {10.1007/3-540-40064-8\_14}, timestamp = {Wed, 24 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/Dobrev00.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/FertinRSSV00, author = {Guillaume Fertin and Andr{\'{e}} Raspaud and Heiko Schr{\"{o}}der and Ondrej S{\'{y}}kora and Imrich Vrto}, editor = {Ulrik Brandes and Dorothea Wagner}, title = {Diameter of the Kn{\"{o}}del Graph}, booktitle = {Graph-Theoretic Concepts in Computer Science, 26th International Workshop, {WG} 2000, Konstanz, Germany, June 15-17, 2000, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {1928}, pages = {149--160}, publisher = {Springer}, year = {2000}, url = {https://doi.org/10.1007/3-540-40064-8\_15}, doi = {10.1007/3-540-40064-8\_15}, timestamp = {Wed, 15 Dec 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/wg/FertinRSSV00.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/FominKM00, author = {Fedor V. Fomin and Dieter Kratsch and Haiko M{\"{u}}ller}, editor = {Ulrik Brandes and Dorothea Wagner}, title = {On the Domination Search Number}, booktitle = {Graph-Theoretic Concepts in Computer Science, 26th International Workshop, {WG} 2000, Konstanz, Germany, June 15-17, 2000, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {1928}, pages = {161--171}, publisher = {Springer}, year = {2000}, url = {https://doi.org/10.1007/3-540-40064-8\_16}, doi = {10.1007/3-540-40064-8\_16}, timestamp = {Sun, 12 Nov 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/wg/FominKM00.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/GarganoPPV00, author = {Luisa Gargano and Andrzej Pelc and Stephane Perennes and Ugo Vaccaro}, editor = {Ulrik Brandes and Dorothea Wagner}, title = {Efficient Communication in Unknown Networks}, booktitle = {Graph-Theoretic Concepts in Computer Science, 26th International Workshop, {WG} 2000, Konstanz, Germany, June 15-17, 2000, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {1928}, pages = {172--183}, publisher = {Springer}, year = {2000}, url = {https://doi.org/10.1007/3-540-40064-8\_17}, doi = {10.1007/3-540-40064-8\_17}, timestamp = {Fri, 09 Apr 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/GarganoPPV00.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/GebremedhinLGT00, author = {Assefaw Hadish Gebremedhin and Isabelle Gu{\'{e}}rin Lassous and Jens Gustedt and Jan Arne Telle}, editor = {Ulrik Brandes and Dorothea Wagner}, title = {Graph Coloring on a Coarse Grained Multiprocessor}, booktitle = {Graph-Theoretic Concepts in Computer Science, 26th International Workshop, {WG} 2000, Konstanz, Germany, June 15-17, 2000, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {1928}, pages = {184--195}, publisher = {Springer}, year = {2000}, url = {https://doi.org/10.1007/3-540-40064-8\_18}, doi = {10.1007/3-540-40064-8\_18}, timestamp = {Mon, 05 Jun 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/GebremedhinLGT00.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/GurskiW00, author = {Frank Gurski and Egon Wanke}, editor = {Ulrik Brandes and Dorothea Wagner}, title = {The Tree-Width of Clique-Width Bounded Graphs Without \emph{K\({}_{\mbox{n, n}}\)}}, booktitle = {Graph-Theoretic Concepts in Computer Science, 26th International Workshop, {WG} 2000, Konstanz, Germany, June 15-17, 2000, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {1928}, pages = {196--205}, publisher = {Springer}, year = {2000}, url = {https://doi.org/10.1007/3-540-40064-8\_19}, doi = {10.1007/3-540-40064-8\_19}, timestamp = {Sun, 25 Oct 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/GurskiW00.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/HandkeK00, author = {Dagmar Handke and Guy Kortsarz}, editor = {Ulrik Brandes and Dorothea Wagner}, title = {Tree Spanners for Subgraphs and Related Tree Covering Problems}, booktitle = {Graph-Theoretic Concepts in Computer Science, 26th International Workshop, {WG} 2000, Konstanz, Germany, June 15-17, 2000, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {1928}, pages = {206--217}, publisher = {Springer}, year = {2000}, url = {https://doi.org/10.1007/3-540-40064-8\_20}, doi = {10.1007/3-540-40064-8\_20}, timestamp = {Wed, 14 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/wg/HandkeK00.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/HelaryM00, author = {Jean{-}Michel H{\'{e}}lary and Giovanna Melideo}, editor = {Ulrik Brandes and Dorothea Wagner}, title = {Minimal Size of Piggybacked Information for Tracking Causality: {A} Graph-Based Characterization}, booktitle = {Graph-Theoretic Concepts in Computer Science, 26th International Workshop, {WG} 2000, Konstanz, Germany, June 15-17, 2000, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {1928}, pages = {218--229}, publisher = {Springer}, year = {2000}, url = {https://doi.org/10.1007/3-540-40064-8\_21}, doi = {10.1007/3-540-40064-8\_21}, timestamp = {Wed, 24 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/HelaryM00.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/JakobyLR00, author = {Andreas Jakoby and Maciej Liskiewicz and R{\"{u}}diger Reischuk}, editor = {Ulrik Brandes and Dorothea Wagner}, title = {The Expressive Power and Complexity of Dynamic Process Graphs}, booktitle = {Graph-Theoretic Concepts in Computer Science, 26th International Workshop, {WG} 2000, Konstanz, Germany, June 15-17, 2000, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {1928}, pages = {230--242}, publisher = {Springer}, year = {2000}, url = {https://doi.org/10.1007/3-540-40064-8\_22}, doi = {10.1007/3-540-40064-8\_22}, timestamp = {Wed, 24 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/JakobyLR00.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/KloksKBM00, author = {Ton Kloks and Dieter Kratsch and Yvan Le Borgne and Haiko M{\"{u}}ller}, editor = {Ulrik Brandes and Dorothea Wagner}, title = {Bandwidth of Split and Circular Permutation Graphs}, booktitle = {Graph-Theoretic Concepts in Computer Science, 26th International Workshop, {WG} 2000, Konstanz, Germany, June 15-17, 2000, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {1928}, pages = {243--254}, publisher = {Springer}, year = {2000}, url = {https://doi.org/10.1007/3-540-40064-8\_23}, doi = {10.1007/3-540-40064-8\_23}, timestamp = {Sun, 12 Nov 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/wg/KloksKBM00.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/Kohler00, author = {Ekkehard K{\"{o}}hler}, editor = {Ulrik Brandes and Dorothea Wagner}, title = {Recognizing Graphs without Asteroidal Triples}, booktitle = {Graph-Theoretic Concepts in Computer Science, 26th International Workshop, {WG} 2000, Konstanz, Germany, June 15-17, 2000, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {1928}, pages = {255--266}, publisher = {Springer}, year = {2000}, url = {https://doi.org/10.1007/3-540-40064-8\_24}, doi = {10.1007/3-540-40064-8\_24}, timestamp = {Wed, 24 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/Kohler00.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/KonjevodKM00, author = {Goran Konjevod and Sven Oliver Krumke and Madhav V. Marathe}, editor = {Ulrik Brandes and Dorothea Wagner}, title = {Budget Constrained Minimum Cost Connected Medians}, booktitle = {Graph-Theoretic Concepts in Computer Science, 26th International Workshop, {WG} 2000, Konstanz, Germany, June 15-17, 2000, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {1928}, pages = {267--278}, publisher = {Springer}, year = {2000}, url = {https://doi.org/10.1007/3-540-40064-8\_25}, doi = {10.1007/3-540-40064-8\_25}, timestamp = {Sun, 02 Oct 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/KonjevodKM00.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/KralKPV00, author = {Daniel Kr{\'{a}}l and Jan Kratochv{\'{\i}}l and Andrzej Proskurowski and Heinz{-}J{\"{u}}rgen Voss}, editor = {Ulrik Brandes and Dorothea Wagner}, title = {Coloring Mixed Hypertrees}, booktitle = {Graph-Theoretic Concepts in Computer Science, 26th International Workshop, {WG} 2000, Konstanz, Germany, June 15-17, 2000, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {1928}, pages = {279--289}, publisher = {Springer}, year = {2000}, url = {https://doi.org/10.1007/3-540-40064-8\_26}, doi = {10.1007/3-540-40064-8\_26}, timestamp = {Wed, 14 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/wg/KralKPV00.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/NagaiN00, author = {Sayaka Nagai and Shin{-}Ichi Nakano}, editor = {Ulrik Brandes and Dorothea Wagner}, title = {A Linear-Time Algorithm to Find Independent Spanning Trees in Maximal Planar Graphs}, booktitle = {Graph-Theoretic Concepts in Computer Science, 26th International Workshop, {WG} 2000, Konstanz, Germany, June 15-17, 2000, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {1928}, pages = {290--301}, publisher = {Springer}, year = {2000}, url = {https://doi.org/10.1007/3-540-40064-8\_27}, doi = {10.1007/3-540-40064-8\_27}, timestamp = {Wed, 24 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/NagaiN00.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/WadaC00, author = {Koichi Wada and Wei Chen}, editor = {Ulrik Brandes and Dorothea Wagner}, title = {Optimal Fault-Tolerant Routings for \emph{k}-Connected Graphs with Smaller Routing Tables}, booktitle = {Graph-Theoretic Concepts in Computer Science, 26th International Workshop, {WG} 2000, Konstanz, Germany, June 15-17, 2000, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {1928}, pages = {302--313}, publisher = {Springer}, year = {2000}, url = {https://doi.org/10.1007/3-540-40064-8\_28}, doi = {10.1007/3-540-40064-8\_28}, timestamp = {Fri, 19 Jan 2024 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/wg/WadaC00.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/Wegener00, author = {Ingo Wegener}, editor = {Ulrik Brandes and Dorothea Wagner}, title = {On the Expected Runtime and the Success Probability of Evolutionary Algorithms}, booktitle = {Graph-Theoretic Concepts in Computer Science, 26th International Workshop, {WG} 2000, Konstanz, Germany, June 15-17, 2000, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {1928}, pages = {1--10}, publisher = {Springer}, year = {2000}, url = {https://doi.org/10.1007/3-540-40064-8\_1}, doi = {10.1007/3-540-40064-8\_1}, timestamp = {Wed, 24 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/Wegener00.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/Welzl00, author = {Emo Welzl}, editor = {Ulrik Brandes and Dorothea Wagner}, title = {\emph{n} Points and One Line: Analysis of Randomized Games}, booktitle = {Graph-Theoretic Concepts in Computer Science, 26th International Workshop, {WG} 2000, Konstanz, Germany, June 15-17, 2000, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {1928}, pages = {11--12}, publisher = {Springer}, year = {2000}, url = {https://doi.org/10.1007/3-540-40064-8\_2}, doi = {10.1007/3-540-40064-8\_2}, timestamp = {Wed, 24 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/Welzl00.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@proceedings{DBLP:conf/wg/2000, editor = {Ulrik Brandes and Dorothea Wagner}, title = {Graph-Theoretic Concepts in Computer Science, 26th International Workshop, {WG} 2000, Konstanz, Germany, June 15-17, 2000, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {1928}, publisher = {Springer}, year = {2000}, url = {https://doi.org/10.1007/3-540-40064-8}, doi = {10.1007/3-540-40064-8}, isbn = {3-540-41183-6}, timestamp = {Tue, 14 May 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/2000.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/AccorneroAV99, author = {Anna Accornero and Massimo Ancona and Sonia Varini}, editor = {Peter Widmayer and Gabriele Neyer and Stephan J. Eidenbenz}, title = {All Separating Triangles in a Plane Graph Can Be Optimally "Broken" in Polynomial Time}, booktitle = {Graph-Theoretic Concepts in Computer Science, 25th International Workshop, {WG} '99, Ascona, Switzerland, June 17-19, 1999, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {1665}, pages = {278--290}, publisher = {Springer}, year = {1999}, url = {https://doi.org/10.1007/3-540-46784-X\_27}, doi = {10.1007/3-540-46784-X\_27}, timestamp = {Wed, 11 Sep 2019 13:15:53 +0200}, biburl = {https://dblp.org/rec/conf/wg/AccorneroAV99.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/Albers99, author = {Susanne Albers}, editor = {Peter Widmayer and Gabriele Neyer and Stephan J. Eidenbenz}, title = {Invited Lecture: Online Algorithms: {A} Study of Graph-Theoretic Concepts}, booktitle = {Graph-Theoretic Concepts in Computer Science, 25th International Workshop, {WG} '99, Ascona, Switzerland, June 17-19, 1999, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {1665}, pages = {10--26}, publisher = {Springer}, year = {1999}, url = {https://doi.org/10.1007/3-540-46784-X\_2}, doi = {10.1007/3-540-46784-X\_2}, timestamp = {Wed, 24 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/Albers99.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/BaudonFH99, author = {Olivier Baudon and Guillaume Fertin and Ivan Havel}, editor = {Peter Widmayer and Gabriele Neyer and Stephan J. Eidenbenz}, title = {Routing Permutations in the Hypercube}, booktitle = {Graph-Theoretic Concepts in Computer Science, 25th International Workshop, {WG} '99, Ascona, Switzerland, June 17-19, 1999, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {1665}, pages = {179--190}, publisher = {Springer}, year = {1999}, url = {https://doi.org/10.1007/3-540-46784-X\_19}, doi = {10.1007/3-540-46784-X\_19}, timestamp = {Wed, 24 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/BaudonFH99.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/BerryBC99, author = {Anne Berry and Jean Paul Bordat and Olivier Cogis}, editor = {Peter Widmayer and Gabriele Neyer and Stephan J. Eidenbenz}, title = {Generating All the Minimal Separators of a Graph}, booktitle = {Graph-Theoretic Concepts in Computer Science, 25th International Workshop, {WG} '99, Ascona, Switzerland, June 17-19, 1999, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {1665}, pages = {167--172}, publisher = {Springer}, year = {1999}, url = {https://doi.org/10.1007/3-540-46784-X\_17}, doi = {10.1007/3-540-46784-X\_17}, timestamp = {Wed, 24 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/BerryBC99.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/BezrukovDE99, author = {Sergei L. Bezrukov and Sajal K. Das and Robert Els{\"{a}}sser}, editor = {Peter Widmayer and Gabriele Neyer and Stephan J. Eidenbenz}, title = {Optimal Cuts for Powers of the Petersen Graph}, booktitle = {Graph-Theoretic Concepts in Computer Science, 25th International Workshop, {WG} '99, Ascona, Switzerland, June 17-19, 1999, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {1665}, pages = {228--239}, publisher = {Springer}, year = {1999}, url = {https://doi.org/10.1007/3-540-46784-X\_23}, doi = {10.1007/3-540-46784-X\_23}, timestamp = {Tue, 10 Sep 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/BezrukovDE99.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/BrandstadtDK99, author = {Andreas Brandst{\"{a}}dt and Feodor F. Dragan and Ekkehard K{\"{o}}hler}, editor = {Peter Widmayer and Gabriele Neyer and Stephan J. Eidenbenz}, title = {Linear Time Algorithms for Hamiltonian Problems on (Claw, Net)-Free Graphs}, booktitle = {Graph-Theoretic Concepts in Computer Science, 25th International Workshop, {WG} '99, Ascona, Switzerland, June 17-19, 1999, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {1665}, pages = {364--376}, publisher = {Springer}, year = {1999}, url = {https://doi.org/10.1007/3-540-46784-X\_34}, doi = {10.1007/3-540-46784-X\_34}, timestamp = {Wed, 24 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/BrandstadtDK99.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/ChenKJ99, author = {Jianer Chen and Iyad A. Kanj and Weijia Jia}, editor = {Peter Widmayer and Gabriele Neyer and Stephan J. Eidenbenz}, title = {Vertex Cover: Further Observations and Further Improvements}, booktitle = {Graph-Theoretic Concepts in Computer Science, 25th International Workshop, {WG} '99, Ascona, Switzerland, June 17-19, 1999, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {1665}, pages = {313--324}, publisher = {Springer}, year = {1999}, url = {https://doi.org/10.1007/3-540-46784-X\_30}, doi = {10.1007/3-540-46784-X\_30}, timestamp = {Mon, 23 Nov 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/wg/ChenKJ99.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/CohenFG99, author = {Johanne Cohen and Pierre Fraigniaud and Cyril Gavoille}, editor = {Peter Widmayer and Gabriele Neyer and Stephan J. Eidenbenz}, title = {Recognizing Bipartite Incident-Graphs of Circulant Digraphs}, booktitle = {Graph-Theoretic Concepts in Computer Science, 25th International Workshop, {WG} '99, Ascona, Switzerland, June 17-19, 1999, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {1665}, pages = {215--227}, publisher = {Springer}, year = {1999}, url = {https://doi.org/10.1007/3-540-46784-X\_22}, doi = {10.1007/3-540-46784-X\_22}, timestamp = {Wed, 24 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/CohenFG99.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/ConfessoreDG99, author = {Giuseppe Confessore and Paolo Dell'Olmo and Stefano Giordani}, editor = {Peter Widmayer and Gabriele Neyer and Stephan J. Eidenbenz}, title = {Vertex Partitioning of Crown-Free Interval Graphs}, booktitle = {Graph-Theoretic Concepts in Computer Science, 25th International Workshop, {WG} '99, Ascona, Switzerland, June 17-19, 1999, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {1665}, pages = {391--401}, publisher = {Springer}, year = {1999}, url = {https://doi.org/10.1007/3-540-46784-X\_36}, doi = {10.1007/3-540-46784-X\_36}, timestamp = {Mon, 05 Feb 2024 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/wg/ConfessoreDG99.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/DiazPPS99, author = {Josep D{\'{\i}}az and Mathew D. Penrose and Jordi Petit and Maria J. Serna}, editor = {Peter Widmayer and Gabriele Neyer and Stephan J. Eidenbenz}, title = {Linear Orderings of Random Geometric Graphs}, booktitle = {Graph-Theoretic Concepts in Computer Science, 25th International Workshop, {WG} '99, Ascona, Switzerland, June 17-19, 1999, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {1665}, pages = {291--302}, publisher = {Springer}, year = {1999}, url = {https://doi.org/10.1007/3-540-46784-X\_28}, doi = {10.1007/3-540-46784-X\_28}, timestamp = {Sun, 06 Oct 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/DiazPPS99.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/DobrevV99, author = {Stefan Dobrev and Imrich Vrto}, editor = {Peter Widmayer and Gabriele Neyer and Stephan J. Eidenbenz}, title = {Two Broadcasting Problems in Faulty Hypercubes}, booktitle = {Graph-Theoretic Concepts in Computer Science, 25th International Workshop, {WG} '99, Ascona, Switzerland, June 17-19, 1999, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {1665}, pages = {173--178}, publisher = {Springer}, year = {1999}, url = {https://doi.org/10.1007/3-540-46784-X\_18}, doi = {10.1007/3-540-46784-X\_18}, timestamp = {Wed, 24 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/DobrevV99.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/FialaKK99, author = {Jir{\'{\i}} Fiala and Ton Kloks and Jan Kratochv{\'{\i}}l}, editor = {Peter Widmayer and Gabriele Neyer and Stephan J. Eidenbenz}, title = {Fixed-Parameter Complexity of lambda-Labelings}, booktitle = {Graph-Theoretic Concepts in Computer Science, 25th International Workshop, {WG} '99, Ascona, Switzerland, June 17-19, 1999, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {1665}, pages = {350--363}, publisher = {Springer}, year = {1999}, url = {https://doi.org/10.1007/3-540-46784-X\_33}, doi = {10.1007/3-540-46784-X\_33}, timestamp = {Wed, 24 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/FialaKK99.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/FlocchiniGS99, author = {Paola Flocchini and Fr{\'{e}}d{\'{e}}ric Geurts and Nicola Santoro}, editor = {Peter Widmayer and Gabriele Neyer and Stephan J. Eidenbenz}, title = {Optimal Irreversible Dynamos in Chordal Rings}, booktitle = {Graph-Theoretic Concepts in Computer Science, 25th International Workshop, {WG} '99, Ascona, Switzerland, June 17-19, 1999, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {1665}, pages = {202--214}, publisher = {Springer}, year = {1999}, url = {https://doi.org/10.1007/3-540-46784-X\_21}, doi = {10.1007/3-540-46784-X\_21}, timestamp = {Wed, 24 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/FlocchiniGS99.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/GolumbicR99, author = {Martin Charles Golumbic and Udi Rotics}, editor = {Peter Widmayer and Gabriele Neyer and Stephan J. Eidenbenz}, title = {On the Clique-Width of Perfect Graph Classes}, booktitle = {Graph-Theoretic Concepts in Computer Science, 25th International Workshop, {WG} '99, Ascona, Switzerland, June 17-19, 1999, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {1665}, pages = {135--147}, publisher = {Springer}, year = {1999}, url = {https://doi.org/10.1007/3-540-46784-X\_14}, doi = {10.1007/3-540-46784-X\_14}, timestamp = {Wed, 24 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/GolumbicR99.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/HadanyH99, author = {Ronny Hadany and David Harel}, editor = {Peter Widmayer and Gabriele Neyer and Stephan J. Eidenbenz}, title = {A Multi-Scale Algorithm for Drawing Graphs Nicely}, booktitle = {Graph-Theoretic Concepts in Computer Science, 25th International Workshop, {WG} '99, Ascona, Switzerland, June 17-19, 1999, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {1665}, pages = {262--277}, publisher = {Springer}, year = {1999}, url = {https://doi.org/10.1007/3-540-46784-X\_26}, doi = {10.1007/3-540-46784-X\_26}, timestamp = {Wed, 24 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/HadanyH99.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/HalldorssonKT99, author = {Magn{\'{u}}s M. Halld{\'{o}}rsson and Jan Kratochv{\'{\i}}l and Jan Arne Telle}, editor = {Peter Widmayer and Gabriele Neyer and Stephan J. Eidenbenz}, title = {Mod-2 Independence and Domination in Graphs}, booktitle = {Graph-Theoretic Concepts in Computer Science, 25th International Workshop, {WG} '99, Ascona, Switzerland, June 17-19, 1999, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {1665}, pages = {101--109}, publisher = {Springer}, year = {1999}, url = {https://doi.org/10.1007/3-540-46784-X\_11}, doi = {10.1007/3-540-46784-X\_11}, timestamp = {Wed, 24 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/HalldorssonKT99.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/HauptmeierKRW99, author = {Dietrich Hauptmeier and Sven Oliver Krumke and J{\"{o}}rg Rambau and Hans{-}Christoph Wirth}, editor = {Peter Widmayer and Gabriele Neyer and Stephan J. Eidenbenz}, title = {Euler is Standing in Line}, booktitle = {Graph-Theoretic Concepts in Computer Science, 25th International Workshop, {WG} '99, Ascona, Switzerland, June 17-19, 1999, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {1665}, pages = {42--54}, publisher = {Springer}, year = {1999}, url = {https://doi.org/10.1007/3-540-46784-X\_6}, doi = {10.1007/3-540-46784-X\_6}, timestamp = {Wed, 24 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/HauptmeierKRW99.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/HempelK99, author = {Harald Hempel and Dieter Kratsch}, editor = {Peter Widmayer and Gabriele Neyer and Stephan J. Eidenbenz}, title = {On Claw-Free Asteroidal Triple-Free Graphs}, booktitle = {Graph-Theoretic Concepts in Computer Science, 25th International Workshop, {WG} '99, Ascona, Switzerland, June 17-19, 1999, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {1665}, pages = {377--390}, publisher = {Springer}, year = {1999}, url = {https://doi.org/10.1007/3-540-46784-X\_35}, doi = {10.1007/3-540-46784-X\_35}, timestamp = {Wed, 24 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/HempelK99.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/Johansson99, author = {{\"{O}}jvind Johansson}, editor = {Peter Widmayer and Gabriele Neyer and Stephan J. Eidenbenz}, title = {NLC\({}_{\mbox{2}}\)-Decomposition in Polynomial Time}, booktitle = {Graph-Theoretic Concepts in Computer Science, 25th International Workshop, {WG} '99, Ascona, Switzerland, June 17-19, 1999, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {1665}, pages = {110--121}, publisher = {Springer}, year = {1999}, url = {https://doi.org/10.1007/3-540-46784-X\_12}, doi = {10.1007/3-540-46784-X\_12}, timestamp = {Wed, 24 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/Johansson99.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/KosterHK99, author = {Arie M. C. A. Koster and Stan P. M. van Hoesel and Antoon W. J. Kolen}, editor = {Peter Widmayer and Gabriele Neyer and Stephan J. Eidenbenz}, title = {Optimal Solutions for Frequency Assignment Problems via Tree Decomposition}, booktitle = {Graph-Theoretic Concepts in Computer Science, 25th International Workshop, {WG} '99, Ascona, Switzerland, June 17-19, 1999, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {1665}, pages = {338--349}, publisher = {Springer}, year = {1999}, url = {https://doi.org/10.1007/3-540-46784-X\_32}, doi = {10.1007/3-540-46784-X\_32}, timestamp = {Sun, 02 Oct 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/KosterHK99.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/Lengauer99, author = {Thomas Lengauer}, editor = {Peter Widmayer and Gabriele Neyer and Stephan J. Eidenbenz}, title = {Invited Lecture: Discrete Optimization Methods for Packing Problems in Two and Three Dimensions - With Applications in the Textile and Car Manufacturing Industries}, booktitle = {Graph-Theoretic Concepts in Computer Science, 25th International Workshop, {WG} '99, Ascona, Switzerland, June 17-19, 1999, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {1665}, pages = {27--28}, publisher = {Springer}, year = {1999}, url = {https://doi.org/10.1007/3-540-46784-X\_3}, doi = {10.1007/3-540-46784-X\_3}, timestamp = {Wed, 24 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/Lengauer99.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/LiebersWW99, author = {Annegret Liebers and Dorothea Wagner and Karsten Weihe}, editor = {Peter Widmayer and Gabriele Neyer and Stephan J. Eidenbenz}, title = {On the Hardness of Recognizing Bundles in Time Table Graphs}, booktitle = {Graph-Theoretic Concepts in Computer Science, 25th International Workshop, {WG} '99, Ascona, Switzerland, June 17-19, 1999, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {1665}, pages = {325--337}, publisher = {Springer}, year = {1999}, url = {https://doi.org/10.1007/3-540-46784-X\_31}, doi = {10.1007/3-540-46784-X\_31}, timestamp = {Wed, 24 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/LiebersWW99.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/NatanzonSS99, author = {Assaf Natanzon and Ron Shamir and Roded Sharan}, editor = {Peter Widmayer and Gabriele Neyer and Stephan J. Eidenbenz}, title = {Complexity Classification of Some Edge Modification Problems}, booktitle = {Graph-Theoretic Concepts in Computer Science, 25th International Workshop, {WG} '99, Ascona, Switzerland, June 17-19, 1999, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {1665}, pages = {65--77}, publisher = {Springer}, year = {1999}, url = {https://doi.org/10.1007/3-540-46784-X\_8}, doi = {10.1007/3-540-46784-X\_8}, timestamp = {Wed, 24 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/NatanzonSS99.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/NishimuraRT99, author = {Naomi Nishimura and Prabhakar Ragde and Dimitrios M. Thilikos}, editor = {Peter Widmayer and Gabriele Neyer and Stephan J. Eidenbenz}, title = {Finding Smallest Supertrees Under Minor Containment}, booktitle = {Graph-Theoretic Concepts in Computer Science, 25th International Workshop, {WG} '99, Ascona, Switzerland, June 17-19, 1999, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {1665}, pages = {303--312}, publisher = {Springer}, year = {1999}, url = {https://doi.org/10.1007/3-540-46784-X\_29}, doi = {10.1007/3-540-46784-X\_29}, timestamp = {Wed, 24 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/NishimuraRT99.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/Noltemeier99, author = {Hartmut Noltemeier}, editor = {Peter Widmayer and Gabriele Neyer and Stephan J. Eidenbenz}, title = {Invited Lecture: Silver Graphs: Achievements and New Challenges}, booktitle = {Graph-Theoretic Concepts in Computer Science, 25th International Workshop, {WG} '99, Ascona, Switzerland, June 17-19, 1999, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {1665}, pages = {1--9}, publisher = {Springer}, year = {1999}, url = {https://doi.org/10.1007/3-540-46784-X\_1}, doi = {10.1007/3-540-46784-X\_1}, timestamp = {Wed, 24 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/Noltemeier99.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/Ott99, author = {Sascha Ott}, editor = {Peter Widmayer and Gabriele Neyer and Stephan J. Eidenbenz}, title = {Lower Bounds for Approximating Shortest Superstrings over an Alphabet of Size 2}, booktitle = {Graph-Theoretic Concepts in Computer Science, 25th International Workshop, {WG} '99, Ascona, Switzerland, June 17-19, 1999, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {1665}, pages = {55--64}, publisher = {Springer}, year = {1999}, url = {https://doi.org/10.1007/3-540-46784-X\_7}, doi = {10.1007/3-540-46784-X\_7}, timestamp = {Wed, 24 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/Ott99.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/ParfenoffRR99, author = {Igor Parfenoff and Florian Roussel and Irena Rusu}, editor = {Peter Widmayer and Gabriele Neyer and Stephan J. Eidenbenz}, title = {Triangulated Neighbourhoods in \emph{C}\({}_{\mbox{4}}\)-Free Berge Graphs}, booktitle = {Graph-Theoretic Concepts in Computer Science, 25th International Workshop, {WG} '99, Ascona, Switzerland, June 17-19, 1999, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {1665}, pages = {402--412}, publisher = {Springer}, year = {1999}, url = {https://doi.org/10.1007/3-540-46784-X\_37}, doi = {10.1007/3-540-46784-X\_37}, timestamp = {Wed, 24 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/ParfenoffRR99.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/ParkK99, author = {Jung{-}Heum Park and Hee{-}Chul Kim}, editor = {Peter Widmayer and Gabriele Neyer and Stephan J. Eidenbenz}, title = {Dihamiltonian Decomposition of Regular Graphs with Degree Three}, booktitle = {Graph-Theoretic Concepts in Computer Science, 25th International Workshop, {WG} '99, Ascona, Switzerland, June 17-19, 1999, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {1665}, pages = {240--249}, publisher = {Springer}, year = {1999}, url = {https://doi.org/10.1007/3-540-46784-X\_24}, doi = {10.1007/3-540-46784-X\_24}, timestamp = {Tue, 29 Dec 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/wg/ParkK99.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/Peleg99, author = {David Peleg}, editor = {Peter Widmayer and Gabriele Neyer and Stephan J. Eidenbenz}, title = {Proximity-Preserving Labeling Schemes and Their Applications}, booktitle = {Graph-Theoretic Concepts in Computer Science, 25th International Workshop, {WG} '99, Ascona, Switzerland, June 17-19, 1999, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {1665}, pages = {30--41}, publisher = {Springer}, year = {1999}, url = {https://doi.org/10.1007/3-540-46784-X\_5}, doi = {10.1007/3-540-46784-X\_5}, timestamp = {Wed, 24 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/Peleg99.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/PerkovicR99, author = {Ljubomir Perkovic and Bruce A. Reed}, editor = {Peter Widmayer and Gabriele Neyer and Stephan J. Eidenbenz}, title = {An Improved Algorithm for Finding Tree Decompositions of Small Width}, booktitle = {Graph-Theoretic Concepts in Computer Science, 25th International Workshop, {WG} '99, Ascona, Switzerland, June 17-19, 1999, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {1665}, pages = {148--154}, publisher = {Springer}, year = {1999}, url = {https://doi.org/10.1007/3-540-46784-X\_15}, doi = {10.1007/3-540-46784-X\_15}, timestamp = {Wed, 24 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/PerkovicR99.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/RahmanNN99, author = {Md. Saidur Rahman and Shin{-}Ichi Nakano and Takao Nishizeki}, editor = {Peter Widmayer and Gabriele Neyer and Stephan J. Eidenbenz}, title = {Box-Rectangular Drawings of Plane Graphs}, booktitle = {Graph-Theoretic Concepts in Computer Science, 25th International Workshop, {WG} '99, Ascona, Switzerland, June 17-19, 1999, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {1665}, pages = {250--261}, publisher = {Springer}, year = {1999}, url = {https://doi.org/10.1007/3-540-46784-X\_25}, doi = {10.1007/3-540-46784-X\_25}, timestamp = {Tue, 21 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/wg/RahmanNN99.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/Santoro99, author = {Nicola Santoro}, editor = {Peter Widmayer and Gabriele Neyer and Stephan J. Eidenbenz}, title = {Informatica, Scoula, Communit{\`{a}}: Uno Sguardo dall' Occhio del Ciclone}, booktitle = {Graph-Theoretic Concepts in Computer Science, 25th International Workshop, {WG} '99, Ascona, Switzerland, June 17-19, 1999, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {1665}, pages = {29}, publisher = {Springer}, year = {1999}, url = {https://doi.org/10.1007/3-540-46784-X\_4}, doi = {10.1007/3-540-46784-X\_4}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/Santoro99.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/Skodinis99, author = {Konstantin Skodinis}, editor = {Peter Widmayer and Gabriele Neyer and Stephan J. Eidenbenz}, title = {Efficient Analysis of Graphs with Small Minimal Separators}, booktitle = {Graph-Theoretic Concepts in Computer Science, 25th International Workshop, {WG} '99, Ascona, Switzerland, June 17-19, 1999, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {1665}, pages = {155--166}, publisher = {Springer}, year = {1999}, url = {https://doi.org/10.1007/3-540-46784-X\_16}, doi = {10.1007/3-540-46784-X\_16}, timestamp = {Wed, 24 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/Skodinis99.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/SteinN99, author = {Benno Stein and Oliver Niggemann}, editor = {Peter Widmayer and Gabriele Neyer and Stephan J. Eidenbenz}, title = {On the Nature of Structure and Its Identification}, booktitle = {Graph-Theoretic Concepts in Computer Science, 25th International Workshop, {WG} '99, Ascona, Switzerland, June 17-19, 1999, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {1665}, pages = {122--134}, publisher = {Springer}, year = {1999}, url = {https://doi.org/10.1007/3-540-46784-X\_13}, doi = {10.1007/3-540-46784-X\_13}, timestamp = {Sat, 30 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/SteinN99.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/WadaNC99, author = {Koichi Wada and Yoriyuki Nagata and Wei Chen}, editor = {Peter Widmayer and Gabriele Neyer and Stephan J. Eidenbenz}, title = {An Optimal Fault-Tolerant Routing for Triconnected Planar Graphs}, booktitle = {Graph-Theoretic Concepts in Computer Science, 25th International Workshop, {WG} '99, Ascona, Switzerland, June 17-19, 1999, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {1665}, pages = {191--201}, publisher = {Springer}, year = {1999}, url = {https://doi.org/10.1007/3-540-46784-X\_20}, doi = {10.1007/3-540-46784-X\_20}, timestamp = {Fri, 19 Jan 2024 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/wg/WadaNC99.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/WirthS99, author = {Hans{-}Christoph Wirth and Jan Steffan}, editor = {Peter Widmayer and Gabriele Neyer and Stephan J. Eidenbenz}, title = {On Minimum Diameter Spanning Trees under Reload Costs}, booktitle = {Graph-Theoretic Concepts in Computer Science, 25th International Workshop, {WG} '99, Ascona, Switzerland, June 17-19, 1999, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {1665}, pages = {78--88}, publisher = {Springer}, year = {1999}, url = {https://doi.org/10.1007/3-540-46784-X\_9}, doi = {10.1007/3-540-46784-X\_9}, timestamp = {Wed, 24 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/WirthS99.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/Zito99, author = {Michele Zito}, editor = {Peter Widmayer and Gabriele Neyer and Stephan J. Eidenbenz}, title = {Induced Matchings in Regular Graphs and Trees}, booktitle = {Graph-Theoretic Concepts in Computer Science, 25th International Workshop, {WG} '99, Ascona, Switzerland, June 17-19, 1999, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {1665}, pages = {89--100}, publisher = {Springer}, year = {1999}, url = {https://doi.org/10.1007/3-540-46784-X\_10}, doi = {10.1007/3-540-46784-X\_10}, timestamp = {Mon, 19 Oct 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/Zito99.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@proceedings{DBLP:conf/wg/1999, editor = {Peter Widmayer and Gabriele Neyer and Stephan J. Eidenbenz}, title = {Graph-Theoretic Concepts in Computer Science, 25th International Workshop, {WG} '99, Ascona, Switzerland, June 17-19, 1999, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {1665}, publisher = {Springer}, year = {1999}, url = {https://doi.org/10.1007/3-540-46784-X}, doi = {10.1007/3-540-46784-X}, isbn = {3-540-66731-8}, timestamp = {Wed, 11 Sep 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/1999.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/BabelO98, author = {Luitpold Babel and Stephan Olariu}, editor = {Juraj Hromkovic and Ondrej S{\'{y}}kora}, title = {Domination and Steiner Tree Problems on Graphs with Few {P4S}}, booktitle = {Graph-Theoretic Concepts in Computer Science, 24th International Workshop, {WG} '98, Smolenice Castle, Slovak Republic, June 18-20, 1998, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {1517}, pages = {337--350}, publisher = {Springer}, year = {1998}, url = {https://doi.org/10.1007/10692760\_27}, doi = {10.1007/10692760\_27}, timestamp = {Tue, 14 May 2019 10:00:40 +0200}, biburl = {https://dblp.org/rec/conf/wg/BabelO98.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/BiedlKM98, author = {Therese Biedl and Michael Kaufmann and Petra Mutzel}, editor = {Juraj Hromkovic and Ondrej S{\'{y}}kora}, title = {Drawing Planar Partitions {II:} HH-Drawings}, booktitle = {Graph-Theoretic Concepts in Computer Science, 24th International Workshop, {WG} '98, Smolenice Castle, Slovak Republic, June 18-20, 1998, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {1517}, pages = {124--136}, publisher = {Springer}, year = {1998}, url = {https://doi.org/10.1007/10692760\_11}, doi = {10.1007/10692760\_11}, timestamp = {Tue, 02 Jul 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/BiedlKM98.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/Bockenhauer98, author = {Hans{-}Joachim B{\"{o}}ckenhauer}, editor = {Juraj Hromkovic and Ondrej S{\'{y}}kora}, title = {Communication in the Two-Way Listen-in Vertex-disjoint Paths Mode}, booktitle = {Graph-Theoretic Concepts in Computer Science, 24th International Workshop, {WG} '98, Smolenice Castle, Slovak Republic, June 18-20, 1998, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {1517}, pages = {38--49}, publisher = {Springer}, year = {1998}, url = {https://doi.org/10.1007/10692760\_4}, doi = {10.1007/10692760\_4}, timestamp = {Mon, 06 Nov 2017 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/wg/Bockenhauer98.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/BroersmaKKM98, author = {Hajo Broersma and Ton Kloks and Dieter Kratsch and Haiko M{\"{u}}ller}, editor = {Juraj Hromkovic and Ondrej S{\'{y}}kora}, title = {A Generalization of AT-free Graphs and a Generic Algorithm for Solving Treewidth, Minimum Fill-In and Vertex Ranking}, booktitle = {Graph-Theoretic Concepts in Computer Science, 24th International Workshop, {WG} '98, Smolenice Castle, Slovak Republic, June 18-20, 1998, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {1517}, pages = {88--99}, publisher = {Springer}, year = {1998}, url = {https://doi.org/10.1007/10692760\_8}, doi = {10.1007/10692760\_8}, timestamp = {Sun, 12 Nov 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/wg/BroersmaKKM98.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/CiceroneS98, author = {Serafino Cicerone and Gabriele Di Stefano}, editor = {Juraj Hromkovic and Ondrej S{\'{y}}kora}, title = {Graphs with Bounded Induced Distance}, booktitle = {Graph-Theoretic Concepts in Computer Science, 24th International Workshop, {WG} '98, Smolenice Castle, Slovak Republic, June 18-20, 1998, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {1517}, pages = {177--191}, publisher = {Springer}, year = {1998}, url = {https://doi.org/10.1007/10692760\_15}, doi = {10.1007/10692760\_15}, timestamp = {Tue, 23 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/CiceroneS98.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/CorneilDHP98, author = {Derek G. Corneil and Feodor F. Dragan and Michel Habib and Christophe Paul}, editor = {Juraj Hromkovic and Ondrej S{\'{y}}kora}, title = {Diameter Determination on Restricted Graph Faminlies}, booktitle = {Graph-Theoretic Concepts in Computer Science, 24th International Workshop, {WG} '98, Smolenice Castle, Slovak Republic, June 18-20, 1998, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {1517}, pages = {192--202}, publisher = {Springer}, year = {1998}, url = {https://doi.org/10.1007/10692760\_16}, doi = {10.1007/10692760\_16}, timestamp = {Tue, 23 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/CorneilDHP98.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/CourcelleMR98, author = {Bruno Courcelle and Johann A. Makowsky and Udi Rotics}, editor = {Juraj Hromkovic and Ondrej S{\'{y}}kora}, title = {Linear Time Solvable Optimization Problems on Graphs of Bounded Clique Width}, booktitle = {Graph-Theoretic Concepts in Computer Science, 24th International Workshop, {WG} '98, Smolenice Castle, Slovak Republic, June 18-20, 1998, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {1517}, pages = {1--16}, publisher = {Springer}, year = {1998}, url = {https://doi.org/10.1007/10692760\_1}, doi = {10.1007/10692760\_1}, timestamp = {Tue, 23 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/CourcelleMR98.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/Dahlhaus98, author = {Elias Dahlhaus}, editor = {Juraj Hromkovic and Ondrej S{\'{y}}kora}, title = {Minimum Fill-in and Treewidth for Graphs Modularly Decomposable into Chordal Graphs}, booktitle = {Graph-Theoretic Concepts in Computer Science, 24th International Workshop, {WG} '98, Smolenice Castle, Slovak Republic, June 18-20, 1998, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {1517}, pages = {351--358}, publisher = {Springer}, year = {1998}, url = {https://doi.org/10.1007/10692760\_28}, doi = {10.1007/10692760\_28}, timestamp = {Tue, 23 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/Dahlhaus98.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/Damaschke98, author = {Peter Damaschke}, editor = {Juraj Hromkovic and Ondrej S{\'{y}}kora}, title = {Minus Domination in Small-Degree Graphs}, booktitle = {Graph-Theoretic Concepts in Computer Science, 24th International Workshop, {WG} '98, Smolenice Castle, Slovak Republic, June 18-20, 1998, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {1517}, pages = {17--25}, publisher = {Springer}, year = {1998}, url = {https://doi.org/10.1007/10692760\_2}, doi = {10.1007/10692760\_2}, timestamp = {Tue, 23 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/Damaschke98.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/DobrevR98, author = {Stefan Dobrev and Peter Ruzicka}, editor = {Juraj Hromkovic and Ondrej S{\'{y}}kora}, title = {Broadcasting on Anonymous Unoriented Tori}, booktitle = {Graph-Theoretic Concepts in Computer Science, 24th International Workshop, {WG} '98, Smolenice Castle, Slovak Republic, June 18-20, 1998, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {1517}, pages = {50--62}, publisher = {Springer}, year = {1998}, url = {https://doi.org/10.1007/10692760\_5}, doi = {10.1007/10692760\_5}, timestamp = {Tue, 23 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/DobrevR98.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/FariaFM98, author = {Lu{\'{e}}rbio Faria and Celina M. H. de Figueiredo and Candido Ferreira Xavier de Mendon{\c{c}}a Neto}, editor = {Juraj Hromkovic and Ondrej S{\'{y}}kora}, title = {Splitting Number is NP-complete}, booktitle = {Graph-Theoretic Concepts in Computer Science, 24th International Workshop, {WG} '98, Smolenice Castle, Slovak Republic, June 18-20, 1998, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {1517}, pages = {285--297}, publisher = {Springer}, year = {1998}, url = {https://doi.org/10.1007/10692760\_23}, doi = {10.1007/10692760\_23}, timestamp = {Tue, 23 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/FariaFM98.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/FeketeK98, author = {S{\'{a}}ndor P. Fekete and Jana Kremer}, editor = {Juraj Hromkovic and Ondrej S{\'{y}}kora}, title = {Tree Spanners in Planar Graphs}, booktitle = {Graph-Theoretic Concepts in Computer Science, 24th International Workshop, {WG} '98, Smolenice Castle, Slovak Republic, June 18-20, 1998, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {1517}, pages = {298--309}, publisher = {Springer}, year = {1998}, url = {https://doi.org/10.1007/10692760\_24}, doi = {10.1007/10692760\_24}, timestamp = {Tue, 23 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/FeketeK98.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/FelsnerK98, author = {Stefan Felsner and Klaus Kriegel}, editor = {Juraj Hromkovic and Ondrej S{\'{y}}kora}, title = {Triangles in Euclidean Arrangements}, booktitle = {Graph-Theoretic Concepts in Computer Science, 24th International Workshop, {WG} '98, Smolenice Castle, Slovak Republic, June 18-20, 1998, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {1517}, pages = {137--148}, publisher = {Springer}, year = {1998}, url = {https://doi.org/10.1007/10692760\_12}, doi = {10.1007/10692760\_12}, timestamp = {Tue, 23 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/FelsnerK98.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/FertinR98, author = {Guillaume Fertin and Andr{\'{e}} Raspaud}, editor = {Juraj Hromkovic and Ondrej S{\'{y}}kora}, title = {Families of Graphs Having Broadcasting and Gossiping Properties}, booktitle = {Graph-Theoretic Concepts in Computer Science, 24th International Workshop, {WG} '98, Smolenice Castle, Slovak Republic, June 18-20, 1998, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {1517}, pages = {63--77}, publisher = {Springer}, year = {1998}, url = {https://doi.org/10.1007/10692760\_6}, doi = {10.1007/10692760\_6}, timestamp = {Tue, 23 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/FertinR98.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/FominG98, author = {Fedor V. Fomin and Petr A. Golovach}, editor = {Juraj Hromkovic and Ondrej S{\'{y}}kora}, title = {Interval Completion with the Smallest Max-degree}, booktitle = {Graph-Theoretic Concepts in Computer Science, 24th International Workshop, {WG} '98, Smolenice Castle, Slovak Republic, June 18-20, 1998, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {1517}, pages = {359--371}, publisher = {Springer}, year = {1998}, url = {https://doi.org/10.1007/10692760\_29}, doi = {10.1007/10692760\_29}, timestamp = {Tue, 23 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/FominG98.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/GauyacqMR98, author = {Ginette Gauyacq and C. Micheneau and Andr{\'{e}} Raspaud}, editor = {Juraj Hromkovic and Ondrej S{\'{y}}kora}, title = {Routing in Recursive Circulant Graphs: Edge Forwarding Index and Hamiltonian Decomposition}, booktitle = {Graph-Theoretic Concepts in Computer Science, 24th International Workshop, {WG} '98, Smolenice Castle, Slovak Republic, June 18-20, 1998, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {1517}, pages = {227--241}, publisher = {Springer}, year = {1998}, url = {https://doi.org/10.1007/10692760\_19}, doi = {10.1007/10692760\_19}, timestamp = {Tue, 23 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/GauyacqMR98.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/Gorbunov98, author = {Konstantin Yu. Gorbunov}, editor = {Juraj Hromkovic and Ondrej S{\'{y}}kora}, title = {An Estimate of the Tree-Width of a Planar Graph Which Has Not a Given Planar Grid as a Minor}, booktitle = {Graph-Theoretic Concepts in Computer Science, 24th International Workshop, {WG} '98, Smolenice Castle, Slovak Republic, June 18-20, 1998, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {1517}, pages = {372--383}, publisher = {Springer}, year = {1998}, url = {https://doi.org/10.1007/10692760\_30}, doi = {10.1007/10692760\_30}, timestamp = {Tue, 23 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/Gorbunov98.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/GuruswamiRCCW98, author = {Venkatesan Guruswami and C. Pandu Rangan and Maw{-}Shang Chang and Gerard J. Chang and C. K. Wong}, editor = {Juraj Hromkovic and Ondrej S{\'{y}}kora}, title = {The Vertex-Disjoint Triangles Problem}, booktitle = {Graph-Theoretic Concepts in Computer Science, 24th International Workshop, {WG} '98, Smolenice Castle, Slovak Republic, June 18-20, 1998, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {1517}, pages = {26--37}, publisher = {Springer}, year = {1998}, url = {https://doi.org/10.1007/10692760\_3}, doi = {10.1007/10692760\_3}, timestamp = {Tue, 23 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/GuruswamiRCCW98.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/Handke98, author = {Dagmar Handke}, editor = {Juraj Hromkovic and Ondrej S{\'{y}}kora}, title = {Independent Tree Spanners}, booktitle = {Graph-Theoretic Concepts in Computer Science, 24th International Workshop, {WG} '98, Smolenice Castle, Slovak Republic, June 18-20, 1998, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {1517}, pages = {203--214}, publisher = {Springer}, year = {1998}, url = {https://doi.org/10.1007/10692760\_17}, doi = {10.1007/10692760\_17}, timestamp = {Tue, 23 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/Handke98.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/IsobeZN98, author = {Shuji Isobe and Xiao Zhou and Takao Nishizeki}, editor = {Juraj Hromkovic and Ondrej S{\'{y}}kora}, title = {A Polynomial-Time Algorithm for Finding Total Colorings of Partial k-Trees}, booktitle = {Graph-Theoretic Concepts in Computer Science, 24th International Workshop, {WG} '98, Smolenice Castle, Slovak Republic, June 18-20, 1998, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {1517}, pages = {100--113}, publisher = {Springer}, year = {1998}, url = {https://doi.org/10.1007/10692760\_9}, doi = {10.1007/10692760\_9}, timestamp = {Mon, 15 Jun 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/IsobeZN98.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/Kahl98, author = {Wolfram Kahl}, editor = {Juraj Hromkovic and Ondrej S{\'{y}}kora}, title = {Interally Typed Second-Order Term Graphs}, booktitle = {Graph-Theoretic Concepts in Computer Science, 24th International Workshop, {WG} '98, Smolenice Castle, Slovak Republic, June 18-20, 1998, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {1517}, pages = {149--163}, publisher = {Springer}, year = {1998}, url = {https://doi.org/10.1007/10692760\_13}, doi = {10.1007/10692760\_13}, timestamp = {Tue, 23 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/Kahl98.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/Klasing98, author = {Ralf Klasing}, editor = {Juraj Hromkovic and Ondrej S{\'{y}}kora}, title = {Improved Compressions of Cube-Connected Cycles Networks}, booktitle = {Graph-Theoretic Concepts in Computer Science, 24th International Workshop, {WG} '98, Smolenice Castle, Slovak Republic, June 18-20, 1998, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {1517}, pages = {242--256}, publisher = {Springer}, year = {1998}, url = {https://doi.org/10.1007/10692760\_20}, doi = {10.1007/10692760\_20}, timestamp = {Tue, 23 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/Klasing98.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/KratochvilT98, author = {Jan Kratochv{\'{\i}}l and Zsolt Tuza}, editor = {Juraj Hromkovic and Ondrej S{\'{y}}kora}, title = {Rankings of Directed Graphs}, booktitle = {Graph-Theoretic Concepts in Computer Science, 24th International Workshop, {WG} '98, Smolenice Castle, Slovak Republic, June 18-20, 1998, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {1517}, pages = {114--123}, publisher = {Springer}, year = {1998}, url = {https://doi.org/10.1007/10692760\_10}, doi = {10.1007/10692760\_10}, timestamp = {Tue, 23 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/KratochvilT98.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/KrumkeMNRW98, author = {Sven Oliver Krumke and Madhav V. Marathe and Hartmut Noltemeier and S. S. Ravi and Hans{-}Christoph Wirth}, editor = {Juraj Hromkovic and Ondrej S{\'{y}}kora}, title = {Upgrading Bottleneck Constrained Forests}, booktitle = {Graph-Theoretic Concepts in Computer Science, 24th International Workshop, {WG} '98, Smolenice Castle, Slovak Republic, June 18-20, 1998, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {1517}, pages = {215--226}, publisher = {Springer}, year = {1998}, url = {https://doi.org/10.1007/10692760\_18}, doi = {10.1007/10692760\_18}, timestamp = {Tue, 23 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/KrumkeMNRW98.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/MiuraTNN98, author = {Kazuyuki Miura and Daishiro Takahashi and Shin{-}Ichi Nakano and Takao Nishizeki}, editor = {Juraj Hromkovic and Ondrej S{\'{y}}kora}, title = {A Linear-Time Algorithm to Find Four Independent Spanning Trees in Four-Connected Planar Graphs}, booktitle = {Graph-Theoretic Concepts in Computer Science, 24th International Workshop, {WG} '98, Smolenice Castle, Slovak Republic, June 18-20, 1998, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {1517}, pages = {310--323}, publisher = {Springer}, year = {1998}, url = {https://doi.org/10.1007/10692760\_25}, doi = {10.1007/10692760\_25}, timestamp = {Tue, 23 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/MiuraTNN98.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/RottgerS98, author = {Markus R{\"{o}}ttger and Ulf{-}Peter Schroeder}, editor = {Juraj Hromkovic and Ondrej S{\'{y}}kora}, title = {Efficient Embeddings of Grids into Grids}, booktitle = {Graph-Theoretic Concepts in Computer Science, 24th International Workshop, {WG} '98, Smolenice Castle, Slovak Republic, June 18-20, 1998, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {1517}, pages = {257--271}, publisher = {Springer}, year = {1998}, url = {https://doi.org/10.1007/10692760\_21}, doi = {10.1007/10692760\_21}, timestamp = {Tue, 23 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/RottgerS98.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/ShahrokhiS98, author = {Farhad Shahrokhi and L{\'{a}}szl{\'{o}} A. Sz{\'{e}}kely}, editor = {Juraj Hromkovic and Ondrej S{\'{y}}kora}, title = {Integral Uniform Flows in Symmetric Networks}, booktitle = {Graph-Theoretic Concepts in Computer Science, 24th International Workshop, {WG} '98, Smolenice Castle, Slovak Republic, June 18-20, 1998, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {1517}, pages = {272--284}, publisher = {Springer}, year = {1998}, url = {https://doi.org/10.1007/10692760\_22}, doi = {10.1007/10692760\_22}, timestamp = {Tue, 23 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/ShahrokhiS98.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/TalamoV98, author = {Maurizio Talamo and Paola Vocca}, editor = {Juraj Hromkovic and Ondrej S{\'{y}}kora}, title = {Compact Implicit Representation of Graphs}, booktitle = {Graph-Theoretic Concepts in Computer Science, 24th International Workshop, {WG} '98, Smolenice Castle, Slovak Republic, June 18-20, 1998, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {1517}, pages = {164--176}, publisher = {Springer}, year = {1998}, url = {https://doi.org/10.1007/10692760\_14}, doi = {10.1007/10692760\_14}, timestamp = {Tue, 29 Dec 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/wg/TalamoV98.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/Togni98, author = {Olivier Togni}, editor = {Juraj Hromkovic and Ondrej S{\'{y}}kora}, title = {Optical All-to-All Communication in Inflated Networks}, booktitle = {Graph-Theoretic Concepts in Computer Science, 24th International Workshop, {WG} '98, Smolenice Castle, Slovak Republic, June 18-20, 1998, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {1517}, pages = {78--87}, publisher = {Springer}, year = {1998}, url = {https://doi.org/10.1007/10692760\_7}, doi = {10.1007/10692760\_7}, timestamp = {Tue, 23 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/Togni98.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/WadaC98, author = {Koichi Wada and Wei Chen}, editor = {Juraj Hromkovic and Ondrej S{\'{y}}kora}, title = {Linear Algorithms for a k-partition Problem of Planar Graphs without Specifying Bases}, booktitle = {Graph-Theoretic Concepts in Computer Science, 24th International Workshop, {WG} '98, Smolenice Castle, Slovak Republic, June 18-20, 1998, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {1517}, pages = {324--336}, publisher = {Springer}, year = {1998}, url = {https://doi.org/10.1007/10692760\_26}, doi = {10.1007/10692760\_26}, timestamp = {Fri, 19 Jan 2024 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/wg/WadaC98.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@proceedings{DBLP:conf/wg/1998, editor = {Juraj Hromkovic and Ondrej S{\'{y}}kora}, title = {Graph-Theoretic Concepts in Computer Science, 24th International Workshop, {WG} '98, Smolenice Castle, Slovak Republic, June 18-20, 1998, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {1517}, publisher = {Springer}, year = {1998}, url = {https://doi.org/10.1007/b71621}, doi = {10.1007/B71621}, isbn = {3-540-65195-0}, timestamp = {Tue, 14 May 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/1998.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/Alimonti97, author = {Paola Alimonti}, editor = {Rolf H. M{\"{o}}hring}, title = {Non-oblivious Local Search for {MAX} 2-CCSP with Application to {MAX} {DICUT}}, booktitle = {Graph-Theoretic Concepts in Computer Science, 23rd International Workshop, {WG} '97, Berlin, Germany, June 18-20, 1997, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {1335}, pages = {2--14}, publisher = {Springer}, year = {1997}, url = {https://doi.org/10.1007/BFb0024483}, doi = {10.1007/BFB0024483}, timestamp = {Tue, 14 May 2019 10:00:40 +0200}, biburl = {https://dblp.org/rec/conf/wg/Alimonti97.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/AltFK97, author = {Helmut Alt and Ulrich Fuchs and Klaus Kriegel}, editor = {Rolf H. M{\"{o}}hring}, title = {On the Number of Simple Cycles in Planar Graphs}, booktitle = {Graph-Theoretic Concepts in Computer Science, 23rd International Workshop, {WG} '97, Berlin, Germany, June 18-20, 1997, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {1335}, pages = {15--24}, publisher = {Springer}, year = {1997}, url = {https://doi.org/10.1007/BFb0024484}, doi = {10.1007/BFB0024484}, timestamp = {Sun, 12 Nov 2017 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/wg/AltFK97.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/BabelO97, author = {Luitpold Babel and Stephan Olariu}, editor = {Rolf H. M{\"{o}}hring}, title = {On the Separable-Homogeneous Decomposition of Graphs (Extended Abstract)}, booktitle = {Graph-Theoretic Concepts in Computer Science, 23rd International Workshop, {WG} '97, Berlin, Germany, June 18-20, 1997, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {1335}, pages = {25--37}, publisher = {Springer}, year = {1997}, url = {https://doi.org/10.1007/BFb0024485}, doi = {10.1007/BFB0024485}, timestamp = {Tue, 23 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/BabelO97.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/BabelW97, author = {Luitpold Babel and Gerhard J. Woeginger}, editor = {Rolf H. M{\"{o}}hring}, title = {Pseudo-Hamiltonian Graphs}, booktitle = {Graph-Theoretic Concepts in Computer Science, 23rd International Workshop, {WG} '97, Berlin, Germany, June 18-20, 1997, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {1335}, pages = {38--51}, publisher = {Springer}, year = {1997}, url = {https://doi.org/10.1007/BFb0024486}, doi = {10.1007/BFB0024486}, timestamp = {Tue, 23 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/BabelW97.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/BermondIFP97, author = {Jean{-}Claude Bermond and Miriam Di Ianni and Michele Flammini and Stephane Perennes}, editor = {Rolf H. M{\"{o}}hring}, title = {Acyclic Orientations for Deadlock Prevention in Interconnection Networks (Extended Abstract)}, booktitle = {Graph-Theoretic Concepts in Computer Science, 23rd International Workshop, {WG} '97, Berlin, Germany, June 18-20, 1997, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {1335}, pages = {52--64}, publisher = {Springer}, year = {1997}, url = {https://doi.org/10.1007/BFb0024487}, doi = {10.1007/BFB0024487}, timestamp = {Tue, 23 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/BermondIFP97.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/BertetGM97, author = {Karell Bertet and Jens Gustedt and Michel Morvan}, editor = {Rolf H. M{\"{o}}hring}, title = {Weak-Order Extensions of an Order}, booktitle = {Graph-Theoretic Concepts in Computer Science, 23rd International Workshop, {WG} '97, Berlin, Germany, June 18-20, 1997, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {1335}, pages = {65--77}, publisher = {Springer}, year = {1997}, url = {https://doi.org/10.1007/BFb0024488}, doi = {10.1007/BFB0024488}, timestamp = {Thu, 15 Jun 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/BertetGM97.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/BertoniCP97, author = {Alberto Bertoni and Paola Campadelli and Roberto Posenato}, editor = {Rolf H. M{\"{o}}hring}, title = {An Upper Bound for the Maximum Cut Mean Value}, booktitle = {Graph-Theoretic Concepts in Computer Science, 23rd International Workshop, {WG} '97, Berlin, Germany, June 18-20, 1997, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {1335}, pages = {78--84}, publisher = {Springer}, year = {1997}, url = {https://doi.org/10.1007/BFb0024489}, doi = {10.1007/BFB0024489}, timestamp = {Thu, 15 Jun 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/BertoniCP97.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/BrandesH97, author = {Ulrik Brandes and Dagmar Handke}, editor = {Rolf H. M{\"{o}}hring}, title = {NP-Completness Results for Minimum Planar Spanners}, booktitle = {Graph-Theoretic Concepts in Computer Science, 23rd International Workshop, {WG} '97, Berlin, Germany, June 18-20, 1997, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {1335}, pages = {85--99}, publisher = {Springer}, year = {1997}, url = {https://doi.org/10.1007/BFb0024490}, doi = {10.1007/BFB0024490}, timestamp = {Tue, 23 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/BrandesH97.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/Brandt97, author = {Stephan Brandt}, editor = {Rolf H. M{\"{o}}hring}, title = {Computing the Independence Number of Dense Triangle-Free Graphs}, booktitle = {Graph-Theoretic Concepts in Computer Science, 23rd International Workshop, {WG} '97, Berlin, Germany, June 18-20, 1997, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {1335}, pages = {100--108}, publisher = {Springer}, year = {1997}, url = {https://doi.org/10.1007/BFb0024491}, doi = {10.1007/BFB0024491}, timestamp = {Tue, 23 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/Brandt97.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/BroersmaDK97, author = {Hajo Broersma and Elias Dahlhaus and Ton Kloks}, editor = {Rolf H. M{\"{o}}hring}, title = {Algorithms for the Treewidth and Minimum Fill-in of HHD-Free Graphs}, booktitle = {Graph-Theoretic Concepts in Computer Science, 23rd International Workshop, {WG} '97, Berlin, Germany, June 18-20, 1997, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {1335}, pages = {109--117}, publisher = {Springer}, year = {1997}, url = {https://doi.org/10.1007/BFb0024492}, doi = {10.1007/BFB0024492}, timestamp = {Sat, 05 Sep 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/BroersmaDK97.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/Capelle97, author = {Christian Capelle}, editor = {Rolf H. M{\"{o}}hring}, title = {Block Decomposition of Inheritance Hierarchies}, booktitle = {Graph-Theoretic Concepts in Computer Science, 23rd International Workshop, {WG} '97, Berlin, Germany, June 18-20, 1997, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {1335}, pages = {118--131}, publisher = {Springer}, year = {1997}, url = {https://doi.org/10.1007/BFb0024493}, doi = {10.1007/BFB0024493}, timestamp = {Tue, 23 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/Capelle97.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/Dahlhaus97, author = {Elias Dahlhaus}, editor = {Rolf H. M{\"{o}}hring}, title = {Minimal Elimination Ordering Inside a Given Chordal Graph}, booktitle = {Graph-Theoretic Concepts in Computer Science, 23rd International Workshop, {WG} '97, Berlin, Germany, June 18-20, 1997, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {1335}, pages = {132--143}, publisher = {Springer}, year = {1997}, url = {https://doi.org/10.1007/BFb0024494}, doi = {10.1007/BFB0024494}, timestamp = {Tue, 23 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/Dahlhaus97.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/DinitzFZ97, author = {Yefim Dinitz and Marcelo Feighelstein and Shmuel Zaks}, editor = {Rolf H. M{\"{o}}hring}, title = {On Optimal Graphs Embedded into Path and Rings, with Analysis Using l\({}_{\mbox{1}}\)-Spheres}, booktitle = {Graph-Theoretic Concepts in Computer Science, 23rd International Workshop, {WG} '97, Berlin, Germany, June 18-20, 1997, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {1335}, pages = {171--183}, publisher = {Springer}, year = {1997}, url = {https://doi.org/10.1007/BFb0024497}, doi = {10.1007/BFB0024497}, timestamp = {Tue, 23 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/DinitzFZ97.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/Dragan97, author = {Feodor F. Dragan}, editor = {Rolf H. M{\"{o}}hring}, title = {On Greedy Matching Ordering and Greedy Matchable Graphs (Extended Abstract)}, booktitle = {Graph-Theoretic Concepts in Computer Science, 23rd International Workshop, {WG} '97, Berlin, Germany, June 18-20, 1997, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {1335}, pages = {184--198}, publisher = {Springer}, year = {1997}, url = {https://doi.org/10.1007/BFb0024498}, doi = {10.1007/BFB0024498}, timestamp = {Tue, 23 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/Dragan97.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/ErlebachJ97, author = {Thomas Erlebach and Klaus Jansen}, editor = {Rolf H. M{\"{o}}hring}, title = {Off-Line and On-Line Call-Scheduling in Stars and Trees}, booktitle = {Graph-Theoretic Concepts in Computer Science, 23rd International Workshop, {WG} '97, Berlin, Germany, June 18-20, 1997, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {1335}, pages = {199--213}, publisher = {Springer}, year = {1997}, url = {https://doi.org/10.1007/BFb0024499}, doi = {10.1007/BFB0024499}, timestamp = {Tue, 23 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/ErlebachJ97.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/FluiterB97, author = {Babette de Fluiter and Hans L. Bodlaender}, editor = {Rolf H. M{\"{o}}hring}, title = {Parallel Algorithms for Treewidth Two}, booktitle = {Graph-Theoretic Concepts in Computer Science, 23rd International Workshop, {WG} '97, Berlin, Germany, June 18-20, 1997, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {1335}, pages = {157--170}, publisher = {Springer}, year = {1997}, url = {https://doi.org/10.1007/BFb0024496}, doi = {10.1007/BFB0024496}, timestamp = {Tue, 23 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/FluiterB97.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/HlinenyK97, author = {Petr Hlinen{\'{y}} and Jan Kratochv{\'{\i}}l}, editor = {Rolf H. M{\"{o}}hring}, title = {Computational Complexity of the Krausz Dimension of Graphs}, booktitle = {Graph-Theoretic Concepts in Computer Science, 23rd International Workshop, {WG} '97, Berlin, Germany, June 18-20, 1997, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {1335}, pages = {214--228}, publisher = {Springer}, year = {1997}, url = {https://doi.org/10.1007/BFb0024500}, doi = {10.1007/BFB0024500}, timestamp = {Tue, 23 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/HlinenyK97.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/KloksKM97, author = {Ton Kloks and Dieter Kratsch and Haiko M{\"{u}}ller}, editor = {Rolf H. M{\"{o}}hring}, title = {Asteroidal Sets in Graphs}, booktitle = {Graph-Theoretic Concepts in Computer Science, 23rd International Workshop, {WG} '97, Berlin, Germany, June 18-20, 1997, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {1335}, pages = {229--241}, publisher = {Springer}, year = {1997}, url = {https://doi.org/10.1007/BFb0024501}, doi = {10.1007/BFB0024501}, timestamp = {Sun, 12 Nov 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/wg/KloksKM97.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/KratochvilPT97, author = {Jan Kratochv{\'{\i}}l and Andrzej Proskurowski and Jan Arne Telle}, editor = {Rolf H. M{\"{o}}hring}, title = {Complexity of Colored Graph Covers I. Colored Directed Multigraphs}, booktitle = {Graph-Theoretic Concepts in Computer Science, 23rd International Workshop, {WG} '97, Berlin, Germany, June 18-20, 1997, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {1335}, pages = {242--257}, publisher = {Springer}, year = {1997}, url = {https://doi.org/10.1007/BFb0024502}, doi = {10.1007/BFB0024502}, timestamp = {Tue, 23 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/KratochvilPT97.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/MosbahS97, author = {Mohamed Mosbah and Nasser Saheb}, editor = {Rolf H. M{\"{o}}hring}, title = {A Syntactic Approach to Random Walks on Graphs}, booktitle = {Graph-Theoretic Concepts in Computer Science, 23rd International Workshop, {WG} '97, Berlin, Germany, June 18-20, 1997, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {1335}, pages = {258--272}, publisher = {Springer}, year = {1997}, url = {https://doi.org/10.1007/BFb0024503}, doi = {10.1007/BFB0024503}, timestamp = {Tue, 11 Oct 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/MosbahS97.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/Prisner97, author = {Erich Prisner}, editor = {Rolf H. M{\"{o}}hring}, title = {Bicliques in Graphs {II:} Recognizing k-Path Graphs and Underlying Graphs of Line Digraphs}, booktitle = {Graph-Theoretic Concepts in Computer Science, 23rd International Workshop, {WG} '97, Berlin, Germany, June 18-20, 1997, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {1335}, pages = {273--287}, publisher = {Springer}, year = {1997}, url = {https://doi.org/10.1007/BFb0024504}, doi = {10.1007/BFB0024504}, timestamp = {Sun, 02 Oct 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/Prisner97.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/Sampels97, author = {Michael Sampels}, editor = {Rolf H. M{\"{o}}hring}, title = {Large Networks with Small Diameter}, booktitle = {Graph-Theoretic Concepts in Computer Science, 23rd International Workshop, {WG} '97, Berlin, Germany, June 18-20, 1997, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {1335}, pages = {288--302}, publisher = {Springer}, year = {1997}, url = {https://doi.org/10.1007/BFb0024505}, doi = {10.1007/BFB0024505}, timestamp = {Tue, 23 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/Sampels97.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/Skodinis97, author = {Konstantin Skodinis}, editor = {Rolf H. M{\"{o}}hring}, title = {The Bounded Tree-Width Problem of Context-Free Graph Languages}, booktitle = {Graph-Theoretic Concepts in Computer Science, 23rd International Workshop, {WG} '97, Berlin, Germany, June 18-20, 1997, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {1335}, pages = {303--317}, publisher = {Springer}, year = {1997}, url = {https://doi.org/10.1007/BFb0024506}, doi = {10.1007/BFB0024506}, timestamp = {Tue, 23 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/Skodinis97.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/Thorup97, author = {Mikkel Thorup}, editor = {Rolf H. M{\"{o}}hring}, title = {Structured Programs have Small Tree-Width and Good Register Allocation (Extended Abstract)}, booktitle = {Graph-Theoretic Concepts in Computer Science, 23rd International Workshop, {WG} '97, Berlin, Germany, June 18-20, 1997, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {1335}, pages = {318--332}, publisher = {Springer}, year = {1997}, url = {https://doi.org/10.1007/BFb0024507}, doi = {10.1007/BFB0024507}, timestamp = {Tue, 23 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/Thorup97.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/Uehara97, author = {Ryuhei Uehara}, editor = {Rolf H. M{\"{o}}hring}, title = {A Measure of Parallelization for the Lexicographically First Maximal Subgraph Problems}, booktitle = {Graph-Theoretic Concepts in Computer Science, 23rd International Workshop, {WG} '97, Berlin, Germany, June 18-20, 1997, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {1335}, pages = {333--341}, publisher = {Springer}, year = {1997}, url = {https://doi.org/10.1007/BFb0024508}, doi = {10.1007/BFB0024508}, timestamp = {Tue, 29 Dec 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/wg/Uehara97.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/VosS97, author = {Tanja E. J. Vos and S. Doaitse Swierstra}, editor = {Rolf H. M{\"{o}}hring}, title = {Make your Enemies Transparent}, booktitle = {Graph-Theoretic Concepts in Computer Science, 23rd International Workshop, {WG} '97, Berlin, Germany, June 18-20, 1997, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {1335}, pages = {342--353}, publisher = {Springer}, year = {1997}, url = {https://doi.org/10.1007/BFb0024509}, doi = {10.1007/BFB0024509}, timestamp = {Tue, 23 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/VosS97.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/WadaCLK97, author = {Koichi Wada and Wei Chen and Yupin Luo and Kimio Kawaguchi}, editor = {Rolf H. M{\"{o}}hring}, title = {Optimal Fault-Tolerant ATM-Routings for Biconnected Graphs}, booktitle = {Graph-Theoretic Concepts in Computer Science, 23rd International Workshop, {WG} '97, Berlin, Germany, June 18-20, 1997, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {1335}, pages = {354--367}, publisher = {Springer}, year = {1997}, url = {https://doi.org/10.1007/BFb0024510}, doi = {10.1007/BFB0024510}, timestamp = {Fri, 19 Jan 2024 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/wg/WadaCLK97.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/Williamson97, author = {David P. Williamson}, editor = {Rolf H. M{\"{o}}hring}, title = {Gadgets, Approximation, and Linear Programming: Improved Hardness Results for Cut and Satisfiability Problems (Abstract of Invited Lecture)}, booktitle = {Graph-Theoretic Concepts in Computer Science, 23rd International Workshop, {WG} '97, Berlin, Germany, June 18-20, 1997, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {1335}, pages = {1}, publisher = {Springer}, year = {1997}, url = {https://doi.org/10.1007/BFb0024482}, doi = {10.1007/BFB0024482}, timestamp = {Tue, 23 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/Williamson97.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/dAmoreI97, author = {Fabrizio d'Amore and Fabio Iacobini}, editor = {Rolf H. M{\"{o}}hring}, title = {On-Line Algorithms for Networks of Temporal Constraints}, booktitle = {Graph-Theoretic Concepts in Computer Science, 23rd International Workshop, {WG} '97, Berlin, Germany, June 18-20, 1997, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {1335}, pages = {144--156}, publisher = {Springer}, year = {1997}, url = {https://doi.org/10.1007/BFb0024495}, doi = {10.1007/BFB0024495}, timestamp = {Tue, 23 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/dAmoreI97.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@proceedings{DBLP:conf/wg/1996, editor = {Fabrizio d'Amore and Paolo Giulio Franciosa and Alberto Marchetti{-}Spaccamela}, title = {Graph-Theoretic Concepts in Computer Science, 22nd International Workshop, {WG} '96, Cadenabbia (Como), Italy, June 12-14, 1996, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {1197}, publisher = {Springer}, year = {1997}, url = {https://doi.org/10.1007/3-540-62559-3}, doi = {10.1007/3-540-62559-3}, isbn = {3-540-62559-3}, timestamp = {Tue, 14 May 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/1996.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@proceedings{DBLP:conf/wg/1997, editor = {Rolf H. M{\"{o}}hring}, title = {Graph-Theoretic Concepts in Computer Science, 23rd International Workshop, {WG} '97, Berlin, Germany, June 18-20, 1997, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {1335}, publisher = {Springer}, year = {1997}, url = {https://doi.org/10.1007/BFb0024481}, doi = {10.1007/BFB0024481}, isbn = {3-540-63757-5}, timestamp = {Tue, 14 May 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/1997.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/AlimontiC96, author = {Paola Alimonti and Tiziana Calamoneri}, editor = {Fabrizio d'Amore and Paolo Giulio Franciosa and Alberto Marchetti{-}Spaccamela}, title = {Improved Approximations of Independent Dominating Set in Bounded Degree Graphs}, booktitle = {Graph-Theoretic Concepts in Computer Science, 22nd International Workshop, {WG} '96, Cadenabbia (Como), Italy, June 12-14, 1996, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {1197}, pages = {2--16}, publisher = {Springer}, year = {1996}, url = {https://doi.org/10.1007/3-540-62559-3\_2}, doi = {10.1007/3-540-62559-3\_2}, timestamp = {Tue, 14 May 2019 10:00:40 +0200}, biburl = {https://dblp.org/rec/conf/wg/AlimontiC96.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/BabelO96, author = {Luitpold Babel and Stephan Olariu}, editor = {Fabrizio d'Amore and Paolo Giulio Franciosa and Alberto Marchetti{-}Spaccamela}, title = {A New Characterization of P4-connected Graphs}, booktitle = {Graph-Theoretic Concepts in Computer Science, 22nd International Workshop, {WG} '96, Cadenabbia (Como), Italy, June 12-14, 1996, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {1197}, pages = {17--30}, publisher = {Springer}, year = {1996}, url = {https://doi.org/10.1007/3-540-62559-3\_3}, doi = {10.1007/3-540-62559-3\_3}, timestamp = {Mon, 22 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/BabelO96.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/BauderonJ96, author = {Michel Bauderon and H{\'{e}}l{\`{e}}ne Jacquet}, editor = {Fabrizio d'Amore and Paolo Giulio Franciosa and Alberto Marchetti{-}Spaccamela}, title = {Node Rewriting in Hypergraphs}, booktitle = {Graph-Theoretic Concepts in Computer Science, 22nd International Workshop, {WG} '96, Cadenabbia (Como), Italy, June 12-14, 1996, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {1197}, pages = {31--43}, publisher = {Springer}, year = {1996}, url = {https://doi.org/10.1007/3-540-62559-3\_4}, doi = {10.1007/3-540-62559-3\_4}, timestamp = {Mon, 22 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/BauderonJ96.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/Bezrukov96, author = {Sergei L. Bezrukov}, editor = {Fabrizio d'Amore and Paolo Giulio Franciosa and Alberto Marchetti{-}Spaccamela}, title = {On k-Partitioning the n-Cube}, booktitle = {Graph-Theoretic Concepts in Computer Science, 22nd International Workshop, {WG} '96, Cadenabbia (Como), Italy, June 12-14, 1996, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {1197}, pages = {44--55}, publisher = {Springer}, year = {1996}, url = {https://doi.org/10.1007/3-540-62559-3\_5}, doi = {10.1007/3-540-62559-3\_5}, timestamp = {Mon, 22 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/Bezrukov96.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/BroadwaterEF96, author = {Adrienne L. Broadwater and Kemal Efe and Antonio Fern{\'{a}}ndez}, editor = {Fabrizio d'Amore and Paolo Giulio Franciosa and Alberto Marchetti{-}Spaccamela}, title = {Embedding Complete Binary Trees in Product Graphs}, booktitle = {Graph-Theoretic Concepts in Computer Science, 22nd International Workshop, {WG} '96, Cadenabbia (Como), Italy, June 12-14, 1996, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {1197}, pages = {56--66}, publisher = {Springer}, year = {1996}, url = {https://doi.org/10.1007/3-540-62559-3\_6}, doi = {10.1007/3-540-62559-3\_6}, timestamp = {Sun, 02 Oct 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/BroadwaterEF96.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/BrysL96, author = {Krzysztof Brys and Zbigniew Lonc}, editor = {Fabrizio d'Amore and Paolo Giulio Franciosa and Alberto Marchetti{-}Spaccamela}, title = {Clique and Anticlique Partition of Graphs}, booktitle = {Graph-Theoretic Concepts in Computer Science, 22nd International Workshop, {WG} '96, Cadenabbia (Como), Italy, June 12-14, 1996, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {1197}, pages = {67--72}, publisher = {Springer}, year = {1996}, url = {https://doi.org/10.1007/3-540-62559-3\_7}, doi = {10.1007/3-540-62559-3\_7}, timestamp = {Sun, 25 Oct 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/BrysL96.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/ChenC96, author = {Chi{-}Chang Chen and Jianer Chen}, editor = {Fabrizio d'Amore and Paolo Giulio Franciosa and Alberto Marchetti{-}Spaccamela}, title = {Optimal Parallel Routing in Star Graphs}, booktitle = {Graph-Theoretic Concepts in Computer Science, 22nd International Workshop, {WG} '96, Cadenabbia (Como), Italy, June 12-14, 1996, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {1197}, pages = {73--84}, publisher = {Springer}, year = {1996}, url = {https://doi.org/10.1007/3-540-62559-3\_8}, doi = {10.1007/3-540-62559-3\_8}, timestamp = {Mon, 22 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/ChenC96.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/CiceroneFNP96, author = {Serafino Cicerone and Daniele Frigioni and Umberto Nanni and Francesco Pugliese}, editor = {Fabrizio d'Amore and Paolo Giulio Franciosa and Alberto Marchetti{-}Spaccamela}, title = {Counting Edges in a Dag}, booktitle = {Graph-Theoretic Concepts in Computer Science, 22nd International Workshop, {WG} '96, Cadenabbia (Como), Italy, June 12-14, 1996, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {1197}, pages = {85--100}, publisher = {Springer}, year = {1996}, url = {https://doi.org/10.1007/3-540-62559-3\_9}, doi = {10.1007/3-540-62559-3\_9}, timestamp = {Thu, 15 Jun 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/CiceroneFNP96.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/CiottiP96, author = {Ornella Ciotti and Francesco Parisi{-}Presicce}, editor = {Fabrizio d'Amore and Paolo Giulio Franciosa and Alberto Marchetti{-}Spaccamela}, title = {Closure Properties of Context-Tree Hyperedge Replacement Systems}, booktitle = {Graph-Theoretic Concepts in Computer Science, 22nd International Workshop, {WG} '96, Cadenabbia (Como), Italy, June 12-14, 1996, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {1197}, pages = {101--113}, publisher = {Springer}, year = {1996}, url = {https://doi.org/10.1007/3-540-62559-3\_10}, doi = {10.1007/3-540-62559-3\_10}, timestamp = {Mon, 22 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/CiottiP96.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/CrescenziP96, author = {Pierluigi Crescenzi and Paolo Penna}, editor = {Fabrizio d'Amore and Paolo Giulio Franciosa and Alberto Marchetti{-}Spaccamela}, title = {Upward Drawings of Search Trees (Extended Abstract)}, booktitle = {Graph-Theoretic Concepts in Computer Science, 22nd International Workshop, {WG} '96, Cadenabbia (Como), Italy, June 12-14, 1996, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {1197}, pages = {114--125}, publisher = {Springer}, year = {1996}, url = {https://doi.org/10.1007/3-540-62559-3\_11}, doi = {10.1007/3-540-62559-3\_11}, timestamp = {Sun, 12 Feb 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/wg/CrescenziP96.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/DiksH96, author = {Krzysztof Diks and Torben Hagerup}, editor = {Fabrizio d'Amore and Paolo Giulio Franciosa and Alberto Marchetti{-}Spaccamela}, title = {More General Parallel Tree Contraction: Register Allocation and Broadcasting in a Tree}, booktitle = {Graph-Theoretic Concepts in Computer Science, 22nd International Workshop, {WG} '96, Cadenabbia (Como), Italy, June 12-14, 1996, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {1197}, pages = {126--140}, publisher = {Springer}, year = {1996}, url = {https://doi.org/10.1007/3-540-62559-3\_12}, doi = {10.1007/3-540-62559-3\_12}, timestamp = {Mon, 22 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/DiksH96.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/DiksP96, author = {Krzysztof Diks and Andrzej Pelc}, editor = {Fabrizio d'Amore and Paolo Giulio Franciosa and Alberto Marchetti{-}Spaccamela}, title = {System Diagnosis with Smallest Risk of Error}, booktitle = {Graph-Theoretic Concepts in Computer Science, 22nd International Workshop, {WG} '96, Cadenabbia (Como), Italy, June 12-14, 1996, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {1197}, pages = {141--150}, publisher = {Springer}, year = {1996}, url = {https://doi.org/10.1007/3-540-62559-3\_13}, doi = {10.1007/3-540-62559-3\_13}, timestamp = {Mon, 22 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/DiksP96.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/Djidjev96, author = {Hristo N. Djidjev}, editor = {Fabrizio d'Amore and Paolo Giulio Franciosa and Alberto Marchetti{-}Spaccamela}, title = {On-Line Algorithms for Shortest Path Problems on Planar Digraphs}, booktitle = {Graph-Theoretic Concepts in Computer Science, 22nd International Workshop, {WG} '96, Cadenabbia (Como), Italy, June 12-14, 1996, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {1197}, pages = {151--165}, publisher = {Springer}, year = {1996}, url = {https://doi.org/10.1007/3-540-62559-3\_14}, doi = {10.1007/3-540-62559-3\_14}, timestamp = {Wed, 14 Jul 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/Djidjev96.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/DraganNB96, author = {Feodor F. Dragan and Falk Nicolai and Andreas Brandst{\"{a}}dt}, editor = {Fabrizio d'Amore and Paolo Giulio Franciosa and Alberto Marchetti{-}Spaccamela}, title = {LexBFS-Orderings and Power of Graphs}, booktitle = {Graph-Theoretic Concepts in Computer Science, 22nd International Workshop, {WG} '96, Cadenabbia (Como), Italy, June 12-14, 1996, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {1197}, pages = {166--180}, publisher = {Springer}, year = {1996}, url = {https://doi.org/10.1007/3-540-62559-3\_15}, doi = {10.1007/3-540-62559-3\_15}, timestamp = {Mon, 22 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/DraganNB96.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/Gustedt96, author = {Jens Gustedt}, editor = {Fabrizio d'Amore and Paolo Giulio Franciosa and Alberto Marchetti{-}Spaccamela}, title = {Efficient Union-Find for Planar Graphs and other Sparse Graph Classes (Extended Abstract)}, booktitle = {Graph-Theoretic Concepts in Computer Science, 22nd International Workshop, {WG} '96, Cadenabbia (Como), Italy, June 12-14, 1996, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {1197}, pages = {181--195}, publisher = {Springer}, year = {1996}, url = {https://doi.org/10.1007/3-540-62559-3\_16}, doi = {10.1007/3-540-62559-3\_16}, timestamp = {Mon, 05 Jun 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/Gustedt96.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/HartmannSS96, author = {Stephan Hartmann and Markus W. Sch{\"{a}}ffter and Andreas S. Schulz}, editor = {Fabrizio d'Amore and Paolo Giulio Franciosa and Alberto Marchetti{-}Spaccamela}, title = {Switchbox Routing in {VLSI} Design: Closing the Complexity Gap}, booktitle = {Graph-Theoretic Concepts in Computer Science, 22nd International Workshop, {WG} '96, Cadenabbia (Como), Italy, June 12-14, 1996, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {1197}, pages = {196--210}, publisher = {Springer}, year = {1996}, url = {https://doi.org/10.1007/3-540-62559-3\_17}, doi = {10.1007/3-540-62559-3\_17}, timestamp = {Thu, 14 Mar 2019 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/wg/HartmannSS96.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/HurfinR96, author = {Michel Hurfin and Michel Raynal}, editor = {Fabrizio d'Amore and Paolo Giulio Franciosa and Alberto Marchetti{-}Spaccamela}, title = {Detecting Diamond Necklaces in Labeled Dags {(A} Problem from Distributed Debugging)}, booktitle = {Graph-Theoretic Concepts in Computer Science, 22nd International Workshop, {WG} '96, Cadenabbia (Como), Italy, June 12-14, 1996, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {1197}, pages = {211--223}, publisher = {Springer}, year = {1996}, url = {https://doi.org/10.1007/3-540-62559-3\_18}, doi = {10.1007/3-540-62559-3\_18}, timestamp = {Mon, 22 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/HurfinR96.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/Kahl96, author = {Wolfram Kahl}, editor = {Fabrizio d'Amore and Paolo Giulio Franciosa and Alberto Marchetti{-}Spaccamela}, title = {Algebraic Graph Derivations for Graphical Calculi}, booktitle = {Graph-Theoretic Concepts in Computer Science, 22nd International Workshop, {WG} '96, Cadenabbia (Como), Italy, June 12-14, 1996, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {1197}, pages = {224--238}, publisher = {Springer}, year = {1996}, url = {https://doi.org/10.1007/3-540-62559-3\_19}, doi = {10.1007/3-540-62559-3\_19}, timestamp = {Mon, 22 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/Kahl96.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/Kaller96, author = {Damon Kaller}, editor = {Fabrizio d'Amore and Paolo Giulio Franciosa and Alberto Marchetti{-}Spaccamela}, title = {Definability Equals Recognizability of Partial 3-Trees}, booktitle = {Graph-Theoretic Concepts in Computer Science, 22nd International Workshop, {WG} '96, Cadenabbia (Como), Italy, June 12-14, 1996, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {1197}, pages = {239--253}, publisher = {Springer}, year = {1996}, url = {https://doi.org/10.1007/3-540-62559-3\_20}, doi = {10.1007/3-540-62559-3\_20}, timestamp = {Mon, 22 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/Kaller96.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/KlinzW96, author = {Bettina Klinz and Gerhard J. Woeginger}, editor = {Fabrizio d'Amore and Paolo Giulio Franciosa and Alberto Marchetti{-}Spaccamela}, title = {One, Two, Three, Many, or: Complexity Aspects of Dynamic Network Flows with Dedicated Arcs}, booktitle = {Graph-Theoretic Concepts in Computer Science, 22nd International Workshop, {WG} '96, Cadenabbia (Como), Italy, June 12-14, 1996, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {1197}, pages = {254--267}, publisher = {Springer}, year = {1996}, url = {https://doi.org/10.1007/3-540-62559-3\_21}, doi = {10.1007/3-540-62559-3\_21}, timestamp = {Mon, 22 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/KlinzW96.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/KranakisKPP96, author = {Evangelos Kranakis and Danny Krizanc and Andrzej Pelc and David Peleg}, editor = {Fabrizio d'Amore and Paolo Giulio Franciosa and Alberto Marchetti{-}Spaccamela}, title = {Approximate Maxima Finding of Continuous Functions Under Restricted Budget (Extended Abstract)}, booktitle = {Graph-Theoretic Concepts in Computer Science, 22nd International Workshop, {WG} '96, Cadenabbia (Como), Italy, June 12-14, 1996, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {1197}, pages = {268--278}, publisher = {Springer}, year = {1996}, url = {https://doi.org/10.1007/3-540-62559-3\_22}, doi = {10.1007/3-540-62559-3\_22}, timestamp = {Fri, 02 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/wg/KranakisKPP96.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/KroonSDR96, author = {Leo G. Kroon and Arunabha Sen and Haiyong Deng and Asim Roy}, editor = {Fabrizio d'Amore and Paolo Giulio Franciosa and Alberto Marchetti{-}Spaccamela}, title = {The Optimal Cost Chromatic Partition Problem for Trees and Interval Graphs}, booktitle = {Graph-Theoretic Concepts in Computer Science, 22nd International Workshop, {WG} '96, Cadenabbia (Como), Italy, June 12-14, 1996, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {1197}, pages = {279--292}, publisher = {Springer}, year = {1996}, url = {https://doi.org/10.1007/3-540-62559-3\_23}, doi = {10.1007/3-540-62559-3\_23}, timestamp = {Mon, 22 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/KroonSDR96.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/KrumkeNMRD96, author = {Sven Oliver Krumke and Hartmut Noltemeier and Madhav V. Marathe and S. S. Ravi and Kay U. Drangmeister}, editor = {Fabrizio d'Amore and Paolo Giulio Franciosa and Alberto Marchetti{-}Spaccamela}, title = {Modifying Networks to Obtain Low Cost Trees}, booktitle = {Graph-Theoretic Concepts in Computer Science, 22nd International Workshop, {WG} '96, Cadenabbia (Como), Italy, June 12-14, 1996, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {1197}, pages = {293--307}, publisher = {Springer}, year = {1996}, url = {https://doi.org/10.1007/3-540-62559-3\_24}, doi = {10.1007/3-540-62559-3\_24}, timestamp = {Mon, 22 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/KrumkeNMRD96.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/MalesinskaP96, author = {Ewa Malesinska and Alessandro Panconesi}, editor = {Fabrizio d'Amore and Paolo Giulio Franciosa and Alberto Marchetti{-}Spaccamela}, title = {On the Hardness of Allocating Frequencies for Hybrid Networks}, booktitle = {Graph-Theoretic Concepts in Computer Science, 22nd International Workshop, {WG} '96, Cadenabbia (Como), Italy, June 12-14, 1996, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {1197}, pages = {308--322}, publisher = {Springer}, year = {1996}, url = {https://doi.org/10.1007/3-540-62559-3\_25}, doi = {10.1007/3-540-62559-3\_25}, timestamp = {Mon, 22 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/MalesinskaP96.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/NicolaiS96, author = {Falk Nicolai and Thomas Szymczak}, editor = {Fabrizio d'Amore and Paolo Giulio Franciosa and Alberto Marchetti{-}Spaccamela}, title = {Homogeneous Sets and Domination Problems}, booktitle = {Graph-Theoretic Concepts in Computer Science, 22nd International Workshop, {WG} '96, Cadenabbia (Como), Italy, June 12-14, 1996, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {1197}, pages = {323--337}, publisher = {Springer}, year = {1996}, url = {https://doi.org/10.1007/3-540-62559-3\_26}, doi = {10.1007/3-540-62559-3\_26}, timestamp = {Mon, 22 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/NicolaiS96.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/ObokataIBI96, author = {Koji Obokata and Yukihiro Iwasaki and Feng Bao and Yoshihide Igarashi}, editor = {Fabrizio d'Amore and Paolo Giulio Franciosa and Alberto Marchetti{-}Spaccamela}, title = {Independent Spanning Trees of Product Graphs}, booktitle = {Graph-Theoretic Concepts in Computer Science, 22nd International Workshop, {WG} '96, Cadenabbia (Como), Italy, June 12-14, 1996, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {1197}, pages = {338--351}, publisher = {Springer}, year = {1996}, url = {https://doi.org/10.1007/3-540-62559-3\_27}, doi = {10.1007/3-540-62559-3\_27}, timestamp = {Mon, 06 Nov 2017 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/wg/ObokataIBI96.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/SitaramaE96, author = {Swamy K. Sitarama and Abdol{-}Hossein Esfahanian}, editor = {Fabrizio d'Amore and Paolo Giulio Franciosa and Alberto Marchetti{-}Spaccamela}, title = {Designing Distance-Preserving Fault-Tolerant Topologies}, booktitle = {Graph-Theoretic Concepts in Computer Science, 22nd International Workshop, {WG} '96, Cadenabbia (Como), Italy, June 12-14, 1996, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {1197}, pages = {352--366}, publisher = {Springer}, year = {1996}, url = {https://doi.org/10.1007/3-540-62559-3\_28}, doi = {10.1007/3-540-62559-3\_28}, timestamp = {Mon, 22 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/SitaramaE96.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/Takaoka96, author = {Tadao Takaoka}, editor = {Fabrizio d'Amore and Paolo Giulio Franciosa and Alberto Marchetti{-}Spaccamela}, title = {Shortest Path Algorithms for Nearly Acyclic Directed Graphs}, booktitle = {Graph-Theoretic Concepts in Computer Science, 22nd International Workshop, {WG} '96, Cadenabbia (Como), Italy, June 12-14, 1996, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {1197}, pages = {367--374}, publisher = {Springer}, year = {1996}, url = {https://doi.org/10.1007/3-540-62559-3\_29}, doi = {10.1007/3-540-62559-3\_29}, timestamp = {Mon, 22 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/Takaoka96.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/TragoudasV96, author = {Spyros Tragoudas and Yaakov L. Varol}, editor = {Fabrizio d'Amore and Paolo Giulio Franciosa and Alberto Marchetti{-}Spaccamela}, title = {Computing Disjoint Path with Lenght Constraints}, booktitle = {Graph-Theoretic Concepts in Computer Science, 22nd International Workshop, {WG} '96, Cadenabbia (Como), Italy, June 12-14, 1996, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {1197}, pages = {375--389}, publisher = {Springer}, year = {1996}, url = {https://doi.org/10.1007/3-540-62559-3\_30}, doi = {10.1007/3-540-62559-3\_30}, timestamp = {Mon, 22 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/TragoudasV96.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/Yao96, author = {Andrew Chi{-}Chih Yao}, editor = {Fabrizio d'Amore and Paolo Giulio Franciosa and Alberto Marchetti{-}Spaccamela}, title = {Hypergraphs and Decision Trees (Abstract)}, booktitle = {Graph-Theoretic Concepts in Computer Science, 22nd International Workshop, {WG} '96, Cadenabbia (Como), Italy, June 12-14, 1996, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {1197}, pages = {1}, publisher = {Springer}, year = {1996}, url = {https://doi.org/10.1007/3-540-62559-3\_1}, doi = {10.1007/3-540-62559-3\_1}, timestamp = {Mon, 22 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/Yao96.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/ZhouKN96, author = {Xiao Zhou and Mohammod Abul Kashem and Takao Nishizeki}, editor = {Fabrizio d'Amore and Paolo Giulio Franciosa and Alberto Marchetti{-}Spaccamela}, title = {Generalized Edge-Ranking of Trees (Extended Abstract)}, booktitle = {Graph-Theoretic Concepts in Computer Science, 22nd International Workshop, {WG} '96, Cadenabbia (Como), Italy, June 12-14, 1996, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {1197}, pages = {390--404}, publisher = {Springer}, year = {1996}, url = {https://doi.org/10.1007/3-540-62559-3\_31}, doi = {10.1007/3-540-62559-3\_31}, timestamp = {Tue, 07 Jun 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/ZhouKN96.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/Alimonti95, author = {Paola Alimonti}, editor = {Manfred Nagl}, title = {Non-Oblivious Local Search for Grpah and Hyperpraph Coloring Problems}, booktitle = {Graph-Theoretic Concepts in Computer Science, 21st International Workshop, {WG} '95, Aachen, Germany, June 20-22, 1995, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {1017}, pages = {167--180}, publisher = {Springer}, year = {1995}, url = {https://doi.org/10.1007/3-540-60618-1\_74}, doi = {10.1007/3-540-60618-1\_74}, timestamp = {Thu, 14 Oct 2021 10:32:32 +0200}, biburl = {https://dblp.org/rec/conf/wg/Alimonti95.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/BabelO95, author = {Luitpold Babel and Stephan Olariu}, editor = {Manfred Nagl}, title = {On the Isomorphism of Graphs with Few P4s}, booktitle = {Graph-Theoretic Concepts in Computer Science, 21st International Workshop, {WG} '95, Aachen, Germany, June 20-22, 1995, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {1017}, pages = {24--36}, publisher = {Springer}, year = {1995}, url = {https://doi.org/10.1007/3-540-60618-1\_63}, doi = {10.1007/3-540-60618-1\_63}, timestamp = {Mon, 22 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/BabelO95.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/Bauderon95, author = {Michel Bauderon}, editor = {Manfred Nagl}, title = {A Uniform Approach to Graph Rewriting: The Pullback Approach}, booktitle = {Graph-Theoretic Concepts in Computer Science, 21st International Workshop, {WG} '95, Aachen, Germany, June 20-22, 1995, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {1017}, pages = {101--115}, publisher = {Springer}, year = {1995}, url = {https://doi.org/10.1007/3-540-60618-1\_69}, doi = {10.1007/3-540-60618-1\_69}, timestamp = {Mon, 22 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/Bauderon95.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/BirchlerET95, author = {Barbara D. Birchler and Abdol{-}Hossein Esfahanian and Eric Torng}, editor = {Manfred Nagl}, title = {Toward a General Theory of Unicast-Based Multicast Communication}, booktitle = {Graph-Theoretic Concepts in Computer Science, 21st International Workshop, {WG} '95, Aachen, Germany, June 20-22, 1995, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {1017}, pages = {237--251}, publisher = {Springer}, year = {1995}, url = {https://doi.org/10.1007/3-540-60618-1\_79}, doi = {10.1007/3-540-60618-1\_79}, timestamp = {Mon, 22 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/BirchlerET95.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/BodlaenderTTL95, author = {Hans L. Bodlaender and Richard B. Tan and Dimitrios M. Thilikos and Jan van Leeuwen}, editor = {Manfred Nagl}, title = {On Interval Routing Schemes and Treewidth}, booktitle = {Graph-Theoretic Concepts in Computer Science, 21st International Workshop, {WG} '95, Aachen, Germany, June 20-22, 1995, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {1017}, pages = {181--196}, publisher = {Springer}, year = {1995}, url = {https://doi.org/10.1007/3-540-60618-1\_75}, doi = {10.1007/3-540-60618-1\_75}, timestamp = {Mon, 26 Jun 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/BodlaenderTTL95.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/BonizzoniV95, author = {Paola Bonizzoni and Gianluca Della Vedova}, editor = {Manfred Nagl}, title = {Modular Decomposition of Hypergraphs}, booktitle = {Graph-Theoretic Concepts in Computer Science, 21st International Workshop, {WG} '95, Aachen, Germany, June 20-22, 1995, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {1017}, pages = {303--317}, publisher = {Springer}, year = {1995}, url = {https://doi.org/10.1007/3-540-60618-1\_84}, doi = {10.1007/3-540-60618-1\_84}, timestamp = {Thu, 14 Oct 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/BonizzoniV95.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/BrandstadtDN95, author = {Andreas Brandst{\"{a}}dt and Feodor F. Dragan and Falk Nicolai}, editor = {Manfred Nagl}, title = {Homogeneously Orderable Graphs and the Steiner Tree Problem}, booktitle = {Graph-Theoretic Concepts in Computer Science, 21st International Workshop, {WG} '95, Aachen, Germany, June 20-22, 1995, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {1017}, pages = {381--395}, publisher = {Springer}, year = {1995}, url = {https://doi.org/10.1007/3-540-60618-1\_90}, doi = {10.1007/3-540-60618-1\_90}, timestamp = {Mon, 22 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/BrandstadtDN95.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/ChenH95, author = {Zhi{-}Zhong Chen and Xin He}, editor = {Manfred Nagl}, title = {{NC} Algorithms for Partitioning Planar Graphs into Induced Forests and Approximating NP-Hard Problems}, booktitle = {Graph-Theoretic Concepts in Computer Science, 21st International Workshop, {WG} '95, Aachen, Germany, June 20-22, 1995, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {1017}, pages = {275--289}, publisher = {Springer}, year = {1995}, url = {https://doi.org/10.1007/3-540-60618-1\_82}, doi = {10.1007/3-540-60618-1\_82}, timestamp = {Mon, 22 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/ChenH95.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/Dahlhaus95, author = {Elias Dahlhaus}, editor = {Manfred Nagl}, title = {Efficient Parallel Modular Decomposition (Extended Abstract)}, booktitle = {Graph-Theoretic Concepts in Computer Science, 21st International Workshop, {WG} '95, Aachen, Germany, June 20-22, 1995, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {1017}, pages = {290--302}, publisher = {Springer}, year = {1995}, url = {https://doi.org/10.1007/3-540-60618-1\_83}, doi = {10.1007/3-540-60618-1\_83}, timestamp = {Mon, 22 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/Dahlhaus95.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/Damaschke95, author = {Peter Damaschke}, editor = {Manfred Nagl}, title = {Searching for Faulty Leaves in Binary Trees}, booktitle = {Graph-Theoretic Concepts in Computer Science, 21st International Workshop, {WG} '95, Aachen, Germany, June 20-22, 1995, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {1017}, pages = {265--274}, publisher = {Springer}, year = {1995}, url = {https://doi.org/10.1007/3-540-60618-1\_81}, doi = {10.1007/3-540-60618-1\_81}, timestamp = {Mon, 22 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/Damaschke95.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/DegiorgiS95, author = {Daniele Giorgio Degiorgi and Klaus Simon}, editor = {Manfred Nagl}, title = {A Dynamic Algorithm for Line Graph Recognition}, booktitle = {Graph-Theoretic Concepts in Computer Science, 21st International Workshop, {WG} '95, Aachen, Germany, June 20-22, 1995, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {1017}, pages = {37--48}, publisher = {Springer}, year = {1995}, url = {https://doi.org/10.1007/3-540-60618-1\_64}, doi = {10.1007/3-540-60618-1\_64}, timestamp = {Wed, 14 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/wg/DegiorgiS95.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/DeogunK95, author = {Jitender S. Deogun and Dieter Kratsch}, editor = {Manfred Nagl}, title = {Diametral Path Graphs}, booktitle = {Graph-Theoretic Concepts in Computer Science, 21st International Workshop, {WG} '95, Aachen, Germany, June 20-22, 1995, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {1017}, pages = {344--357}, publisher = {Springer}, year = {1995}, url = {https://doi.org/10.1007/3-540-60618-1\_87}, doi = {10.1007/3-540-60618-1\_87}, timestamp = {Mon, 22 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/DeogunK95.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/DijdjevV95, author = {Hristo N. Djidjev and Shankar M. Venkatesan}, editor = {Manfred Nagl}, title = {Planarization of Graphs Embedded on Surfaces}, booktitle = {Graph-Theoretic Concepts in Computer Science, 21st International Workshop, {WG} '95, Aachen, Germany, June 20-22, 1995, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {1017}, pages = {62--72}, publisher = {Springer}, year = {1995}, url = {https://doi.org/10.1007/3-540-60618-1\_66}, doi = {10.1007/3-540-60618-1\_66}, timestamp = {Wed, 14 Jul 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/DijdjevV95.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/FischerT95, author = {Sophie Fischer and Leen Torenvliet}, editor = {Manfred Nagl}, title = {The Malleability of TSP{\_}\{2Opt\}}, booktitle = {Graph-Theoretic Concepts in Computer Science, 21st International Workshop, {WG} '95, Aachen, Germany, June 20-22, 1995, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {1017}, pages = {152--166}, publisher = {Springer}, year = {1995}, url = {https://doi.org/10.1007/3-540-60618-1\_73}, doi = {10.1007/3-540-60618-1\_73}, timestamp = {Mon, 22 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/FischerT95.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/FlamminiGS95, author = {Michele Flammini and Giorgio Gambosi and Sandro Salomone}, editor = {Manfred Nagl}, title = {On Devising Boolean Routing Schemes}, booktitle = {Graph-Theoretic Concepts in Computer Science, 21st International Workshop, {WG} '95, Aachen, Germany, June 20-22, 1995, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {1017}, pages = {222--236}, publisher = {Springer}, year = {1995}, url = {https://doi.org/10.1007/3-540-60618-1\_78}, doi = {10.1007/3-540-60618-1\_78}, timestamp = {Mon, 22 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/FlamminiGS95.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/Fracchia95, author = {F. David Fracchia}, editor = {Manfred Nagl}, title = {Visualizing Two- and Three-Dimensional Models of Meristematic Growth}, booktitle = {Graph-Theoretic Concepts in Computer Science, 21st International Workshop, {WG} '95, Aachen, Germany, June 20-22, 1995, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {1017}, pages = {116--130}, publisher = {Springer}, year = {1995}, url = {https://doi.org/10.1007/3-540-60618-1\_70}, doi = {10.1007/3-540-60618-1\_70}, timestamp = {Mon, 22 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/Fracchia95.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/GalinierHP95, author = {Philippe Galinier and Michel Habib and Christophe Paul}, editor = {Manfred Nagl}, title = {Chordal Graphs and Their Clique Graphs}, booktitle = {Graph-Theoretic Concepts in Computer Science, 21st International Workshop, {WG} '95, Aachen, Germany, June 20-22, 1995, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {1017}, pages = {358--371}, publisher = {Springer}, year = {1995}, url = {https://doi.org/10.1007/3-540-60618-1\_88}, doi = {10.1007/3-540-60618-1\_88}, timestamp = {Mon, 22 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/GalinierHP95.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/GustedtMV95, author = {Jens Gustedt and Michel Morvan and Laurent Viennot}, editor = {Manfred Nagl}, title = {A Compact Data Structure and Parallel Algorithms for Permutation Graphs}, booktitle = {Graph-Theoretic Concepts in Computer Science, 21st International Workshop, {WG} '95, Aachen, Germany, June 20-22, 1995, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {1017}, pages = {372--380}, publisher = {Springer}, year = {1995}, url = {https://doi.org/10.1007/3-540-60618-1\_89}, doi = {10.1007/3-540-60618-1\_89}, timestamp = {Mon, 05 Jun 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/GustedtMV95.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/Hartmann95, author = {Sven Hartmann}, editor = {Manfred Nagl}, title = {Graph-Theoretical Methods to Construct Entity-Relationship Databases}, booktitle = {Graph-Theoretic Concepts in Computer Science, 21st International Workshop, {WG} '95, Aachen, Germany, June 20-22, 1995, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {1017}, pages = {131--145}, publisher = {Springer}, year = {1995}, url = {https://doi.org/10.1007/3-540-60618-1\_71}, doi = {10.1007/3-540-60618-1\_71}, timestamp = {Mon, 22 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/Hartmann95.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/HeideW95, author = {Friedhelm Meyer auf der Heide and Matthias Westermann}, editor = {Manfred Nagl}, title = {Hot-Potato Routing on Multi-Dimensional Tori}, booktitle = {Graph-Theoretic Concepts in Computer Science, 21st International Workshop, {WG} '95, Aachen, Germany, June 20-22, 1995, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {1017}, pages = {209--221}, publisher = {Springer}, year = {1995}, url = {https://doi.org/10.1007/3-540-60618-1\_77}, doi = {10.1007/3-540-60618-1\_77}, timestamp = {Mon, 22 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/HeideW95.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/KloksKM95, author = {Ton Kloks and Dieter Kratsch and Haiko M{\"{u}}ller}, editor = {Manfred Nagl}, title = {Finding and Counting Small Induced Subgraphs Efficiently}, booktitle = {Graph-Theoretic Concepts in Computer Science, 21st International Workshop, {WG} '95, Aachen, Germany, June 20-22, 1995, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {1017}, pages = {14--23}, publisher = {Springer}, year = {1995}, url = {https://doi.org/10.1007/3-540-60618-1\_62}, doi = {10.1007/3-540-60618-1\_62}, timestamp = {Mon, 22 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/KloksKM95.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/KranakisKRUW95, author = {Evangelos Kranakis and Danny Krizanc and Berthold Ruf and Jorge Urrutia and Gerhard J. Woeginger}, editor = {Manfred Nagl}, title = {VC-Dimensions for Graphs (Extended Abstract)}, booktitle = {Graph-Theoretic Concepts in Computer Science, 21st International Workshop, {WG} '95, Aachen, Germany, June 20-22, 1995, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {1017}, pages = {1--13}, publisher = {Springer}, year = {1995}, url = {https://doi.org/10.1007/3-540-60618-1\_61}, doi = {10.1007/3-540-60618-1\_61}, timestamp = {Mon, 22 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/KranakisKRUW95.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/KrumkeNRM95, author = {Sven Oliver Krumke and Hartmut Noltemeier and S. S. Ravi and Madhav V. Marathe}, editor = {Manfred Nagl}, title = {Complexity and Approximability of Certain Bicriteria Location Problems}, booktitle = {Graph-Theoretic Concepts in Computer Science, 21st International Workshop, {WG} '95, Aachen, Germany, June 20-22, 1995, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {1017}, pages = {73--87}, publisher = {Springer}, year = {1995}, url = {https://doi.org/10.1007/3-540-60618-1\_67}, doi = {10.1007/3-540-60618-1\_67}, timestamp = {Mon, 22 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/KrumkeNRM95.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/Pfaltz95, author = {John L. Pfaltz}, editor = {Manfred Nagl}, title = {Partition Coefficients of Acyclic Graphs}, booktitle = {Graph-Theoretic Concepts in Computer Science, 21st International Workshop, {WG} '95, Aachen, Germany, June 20-22, 1995, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {1017}, pages = {318--322}, publisher = {Springer}, year = {1995}, url = {https://doi.org/10.1007/3-540-60618-1\_85}, doi = {10.1007/3-540-60618-1\_85}, timestamp = {Mon, 22 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/Pfaltz95.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/Plump95, author = {Detlef Plump}, editor = {Manfred Nagl}, title = {On Termination of Graph Rewriting}, booktitle = {Graph-Theoretic Concepts in Computer Science, 21st International Workshop, {WG} '95, Aachen, Germany, June 20-22, 1995, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {1017}, pages = {88--100}, publisher = {Springer}, year = {1995}, url = {https://doi.org/10.1007/3-540-60618-1\_68}, doi = {10.1007/3-540-60618-1\_68}, timestamp = {Mon, 22 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/Plump95.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/RolimSV95, author = {Jos{\'{e}} D. P. Rolim and Ondrej S{\'{y}}kora and Imrich Vrto}, editor = {Manfred Nagl}, title = {Optimal Cutwidths and Bisection Widths of 2- and 3-Dimensional Meshes}, booktitle = {Graph-Theoretic Concepts in Computer Science, 21st International Workshop, {WG} '95, Aachen, Germany, June 20-22, 1995, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {1017}, pages = {252--264}, publisher = {Springer}, year = {1995}, url = {https://doi.org/10.1007/3-540-60618-1\_80}, doi = {10.1007/3-540-60618-1\_80}, timestamp = {Mon, 22 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/RolimSV95.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/Schiermeyer95, author = {Ingo Schiermeyer}, editor = {Manfred Nagl}, title = {An Approximation Algorithm for 3-Colourability}, booktitle = {Graph-Theoretic Concepts in Computer Science, 21st International Workshop, {WG} '95, Aachen, Germany, June 20-22, 1995, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {1017}, pages = {146--151}, publisher = {Springer}, year = {1995}, url = {https://doi.org/10.1007/3-540-60618-1\_72}, doi = {10.1007/3-540-60618-1\_72}, timestamp = {Mon, 22 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/Schiermeyer95.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/Takaoka95, author = {Tadao Takaoka}, editor = {Manfred Nagl}, title = {Sub-Cubic Cost Algorithms for the All Pairs Shortest Path Problem}, booktitle = {Graph-Theoretic Concepts in Computer Science, 21st International Workshop, {WG} '95, Aachen, Germany, June 20-22, 1995, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {1017}, pages = {323--343}, publisher = {Springer}, year = {1995}, url = {https://doi.org/10.1007/3-540-60618-1\_86}, doi = {10.1007/3-540-60618-1\_86}, timestamp = {Mon, 22 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/Takaoka95.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/WadaIKC95, author = {Koichi Wada and Takaharu Ikeo and Kimio Kawaguchi and Wei Chen}, editor = {Manfred Nagl}, title = {Highly Fault-Tolerant Routings and Diameter Vulnerability for Generalized Hypercube Graphs}, booktitle = {Graph-Theoretic Concepts in Computer Science, 21st International Workshop, {WG} '95, Aachen, Germany, June 20-22, 1995, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {1017}, pages = {197--208}, publisher = {Springer}, year = {1995}, url = {https://doi.org/10.1007/3-540-60618-1\_76}, doi = {10.1007/3-540-60618-1\_76}, timestamp = {Fri, 19 Jan 2024 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/wg/WadaIKC95.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/dAmoreG95, author = {Fabrizio d'Amore and Roberto Giaccio}, editor = {Manfred Nagl}, title = {Incremental Hive Graph}, booktitle = {Graph-Theoretic Concepts in Computer Science, 21st International Workshop, {WG} '95, Aachen, Germany, June 20-22, 1995, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {1017}, pages = {49--61}, publisher = {Springer}, year = {1995}, url = {https://doi.org/10.1007/3-540-60618-1\_65}, doi = {10.1007/3-540-60618-1\_65}, timestamp = {Mon, 22 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/dAmoreG95.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@proceedings{DBLP:conf/wg/1994, editor = {Ernst W. Mayr and Gunther Schmidt and Gottfried Tinhofer}, title = {Graph-Theoretic Concepts in Computer Science, 20th International Workshop, {WG} '94, Herrsching, Germany, June 16-18, 1994, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {903}, publisher = {Springer}, year = {1995}, url = {https://doi.org/10.1007/3-540-59071-4}, doi = {10.1007/3-540-59071-4}, isbn = {3-540-59071-4}, timestamp = {Sun, 02 Oct 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/1994.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@proceedings{DBLP:conf/wg/1995, editor = {Manfred Nagl}, title = {Graph-Theoretic Concepts in Computer Science, 21st International Workshop, {WG} '95, Aachen, Germany, June 20-22, 1995, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {1017}, publisher = {Springer}, year = {1995}, url = {https://doi.org/10.1007/3-540-60618-1}, doi = {10.1007/3-540-60618-1}, isbn = {3-540-60618-1}, timestamp = {Thu, 14 Oct 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/1995.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/AndreaeNS94, author = {Thomas Andreae and Michael N{\"{o}}lle and Gerald Schreiber}, editor = {Ernst W. Mayr and Gunther Schmidt and Gottfried Tinhofer}, title = {Cartesian Products of Graphs as Spanning Subgraphs of De Bruijn Graphs (Extended Abstract)}, booktitle = {Graph-Theoretic Concepts in Computer Science, 20th International Workshop, {WG} '94, Herrsching, Germany, June 16-18, 1994, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {903}, pages = {140--150}, publisher = {Springer}, year = {1994}, url = {https://doi.org/10.1007/3-540-59071-4\_44}, doi = {10.1007/3-540-59071-4\_44}, timestamp = {Sun, 02 Oct 2022 16:17:33 +0200}, biburl = {https://dblp.org/rec/conf/wg/AndreaeNS94.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/BabelPT94, author = {Luitpold Babel and Ilia N. Ponomarenko and Gottfried Tinhofer}, editor = {Ernst W. Mayr and Gunther Schmidt and Gottfried Tinhofer}, title = {Direct Path Graph Isomorphism (Extended Abstract)}, booktitle = {Graph-Theoretic Concepts in Computer Science, 20th International Workshop, {WG} '94, Herrsching, Germany, June 16-18, 1994, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {903}, pages = {395--406}, publisher = {Springer}, year = {1994}, url = {https://doi.org/10.1007/3-540-59071-4\_64}, doi = {10.1007/3-540-59071-4\_64}, timestamp = {Sat, 20 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/BabelPT94.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/BampisMM94, author = {Evripidis Bampis and Yannis Manoussakis and Ioannis Milis}, editor = {Ernst W. Mayr and Gunther Schmidt and Gottfried Tinhofer}, title = {{NC} Algorithms for Antidirected Hamiltonian Paths and Cycles in Tournaments (Extended Abstract)}, booktitle = {Graph-Theoretic Concepts in Computer Science, 20th International Workshop, {WG} '94, Herrsching, Germany, June 16-18, 1994, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {903}, pages = {387--394}, publisher = {Springer}, year = {1994}, url = {https://doi.org/10.1007/3-540-59071-4\_63}, doi = {10.1007/3-540-59071-4\_63}, timestamp = {Sat, 20 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/BampisMM94.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/BattistaTV94, author = {Giuseppe Di Battista and Roberto Tamassia and Luca Vismara}, editor = {Ernst W. Mayr and Gunther Schmidt and Gottfried Tinhofer}, title = {On-Line Convex Plabarity Testing}, booktitle = {Graph-Theoretic Concepts in Computer Science, 20th International Workshop, {WG} '94, Herrsching, Germany, June 16-18, 1994, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {903}, pages = {242--255}, publisher = {Springer}, year = {1994}, url = {https://doi.org/10.1007/3-540-59071-4\_52}, doi = {10.1007/3-540-59071-4\_52}, timestamp = {Sat, 20 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/BattistaTV94.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/BhagavathiBGOS94, author = {Dharmavani Bhagavathi and Venkatavasu Bokka and Himabindu Gurla and Stephan Olariu and James L. Schwing}, editor = {Ernst W. Mayr and Gunther Schmidt and Gottfried Tinhofer}, title = {Time-Optimal Tree Computations on Sparse Meshes}, booktitle = {Graph-Theoretic Concepts in Computer Science, 20th International Workshop, {WG} '94, Herrsching, Germany, June 16-18, 1994, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {903}, pages = {193--205}, publisher = {Springer}, year = {1994}, url = {https://doi.org/10.1007/3-540-59071-4\_48}, doi = {10.1007/3-540-59071-4\_48}, timestamp = {Sat, 20 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/BhagavathiBGOS94.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/BodlaenderDJKKMT94, author = {Hans L. Bodlaender and Jitender S. Deogun and Klaus Jansen and Ton Kloks and Dieter Kratsch and Haiko M{\"{u}}ller and Zsolt Tuza}, editor = {Ernst W. Mayr and Gunther Schmidt and Gottfried Tinhofer}, title = {Ranking of Graphs}, booktitle = {Graph-Theoretic Concepts in Computer Science, 20th International Workshop, {WG} '94, Herrsching, Germany, June 16-18, 1994, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {903}, pages = {292--304}, publisher = {Springer}, year = {1994}, url = {https://doi.org/10.1007/3-540-59071-4\_56}, doi = {10.1007/3-540-59071-4\_56}, timestamp = {Sun, 12 Nov 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/wg/BodlaenderDJKKMT94.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/BodlaenderE94, author = {Hans L. Bodlaender and Joost Engelfriet}, editor = {Ernst W. Mayr and Gunther Schmidt and Gottfried Tinhofer}, title = {Domino Treewith (Extended Abstract)}, booktitle = {Graph-Theoretic Concepts in Computer Science, 20th International Workshop, {WG} '94, Herrsching, Germany, June 16-18, 1994, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {903}, pages = {1--13}, publisher = {Springer}, year = {1994}, url = {https://doi.org/10.1007/3-540-59071-4\_33}, doi = {10.1007/3-540-59071-4\_33}, timestamp = {Mon, 26 Jun 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/BodlaenderE94.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/BrandstadtCD94, author = {Andreas Brandst{\"{a}}dt and Victor Chepoi and Feodor F. Dragan}, editor = {Ernst W. Mayr and Gunther Schmidt and Gottfried Tinhofer}, title = {The Algorithmic Use of Hypertree Structure and Maximum Neighbourhood Orderings}, booktitle = {Graph-Theoretic Concepts in Computer Science, 20th International Workshop, {WG} '94, Herrsching, Germany, June 16-18, 1994, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {903}, pages = {65--80}, publisher = {Springer}, year = {1994}, url = {https://doi.org/10.1007/3-540-59071-4\_38}, doi = {10.1007/3-540-59071-4\_38}, timestamp = {Sat, 20 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/BrandstadtCD94.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/ChaudhuriH94, author = {Shiva Chaudhuri and Torben Hagerup}, editor = {Ernst W. Mayr and Gunther Schmidt and Gottfried Tinhofer}, title = {Prefix Graphs and Their Applications}, booktitle = {Graph-Theoretic Concepts in Computer Science, 20th International Workshop, {WG} '94, Herrsching, Germany, June 16-18, 1994, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {903}, pages = {206--218}, publisher = {Springer}, year = {1994}, url = {https://doi.org/10.1007/3-540-59071-4\_49}, doi = {10.1007/3-540-59071-4\_49}, timestamp = {Sat, 20 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/ChaudhuriH94.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/Chen94, author = {Zhi{-}Zhong Chen}, editor = {Ernst W. Mayr and Gunther Schmidt and Gottfried Tinhofer}, title = {The Maximal f-Dependent Set Problem for Planar Graphs is in {NC}}, booktitle = {Graph-Theoretic Concepts in Computer Science, 20th International Workshop, {WG} '94, Herrsching, Germany, June 16-18, 1994, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {903}, pages = {232--241}, publisher = {Springer}, year = {1994}, url = {https://doi.org/10.1007/3-540-59071-4\_51}, doi = {10.1007/3-540-59071-4\_51}, timestamp = {Sat, 20 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/Chen94.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/CrescenziT94, author = {Pierluigi Crescenzi and Luca Trevisan}, editor = {Ernst W. Mayr and Gunther Schmidt and Gottfried Tinhofer}, title = {Minimum Vertex Cover, Distributed Decision-Making, and Communication Complexity (Extended Abstract)}, booktitle = {Graph-Theoretic Concepts in Computer Science, 20th International Workshop, {WG} '94, Herrsching, Germany, June 16-18, 1994, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {903}, pages = {130--139}, publisher = {Springer}, year = {1994}, url = {https://doi.org/10.1007/3-540-59071-4\_43}, doi = {10.1007/3-540-59071-4\_43}, timestamp = {Sun, 12 Feb 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/wg/CrescenziT94.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/DahlhausHMO94, author = {Elias Dahlhaus and Peter L. Hammer and Fr{\'{e}}d{\'{e}}ric Maffray and Stephan Olariu}, editor = {Ernst W. Mayr and Gunther Schmidt and Gottfried Tinhofer}, title = {On Domination Elimination Orderings and Domination Graphs (Extended Abstract)}, booktitle = {Graph-Theoretic Concepts in Computer Science, 20th International Workshop, {WG} '94, Herrsching, Germany, June 16-18, 1994, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {903}, pages = {81--92}, publisher = {Springer}, year = {1994}, url = {https://doi.org/10.1007/3-540-59071-4\_39}, doi = {10.1007/3-540-59071-4\_39}, timestamp = {Sat, 20 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/DahlhausHMO94.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/DendrisKT94, author = {Nick D. Dendris and Lefteris M. Kirousis and Dimitrios M. Thilikos}, editor = {Ernst W. Mayr and Gunther Schmidt and Gottfried Tinhofer}, title = {Fugitive-Search Games on Graphs and Related Parameters}, booktitle = {Graph-Theoretic Concepts in Computer Science, 20th International Workshop, {WG} '94, Herrsching, Germany, June 16-18, 1994, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {903}, pages = {331--342}, publisher = {Springer}, year = {1994}, url = {https://doi.org/10.1007/3-540-59071-4\_59}, doi = {10.1007/3-540-59071-4\_59}, timestamp = {Sat, 20 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/DendrisKT94.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/Dorr94, author = {Heiko D{\"{o}}rr}, editor = {Ernst W. Mayr and Gunther Schmidt and Gottfried Tinhofer}, title = {Bypass Strong V-Structures and Find an Isomorphic Labelled Subgraph in Linear Time}, booktitle = {Graph-Theoretic Concepts in Computer Science, 20th International Workshop, {WG} '94, Herrsching, Germany, June 16-18, 1994, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {903}, pages = {305--318}, publisher = {Springer}, year = {1994}, url = {https://doi.org/10.1007/3-540-59071-4\_57}, doi = {10.1007/3-540-59071-4\_57}, timestamp = {Sat, 20 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/Dorr94.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/EbertF94, author = {J{\"{u}}rgen Ebert and Angelika Franzke}, editor = {Ernst W. Mayr and Gunther Schmidt and Gottfried Tinhofer}, title = {A Declarative Approach to Graph Based Modeling}, booktitle = {Graph-Theoretic Concepts in Computer Science, 20th International Workshop, {WG} '94, Herrsching, Germany, June 16-18, 1994, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {903}, pages = {38--50}, publisher = {Springer}, year = {1994}, url = {https://doi.org/10.1007/3-540-59071-4\_36}, doi = {10.1007/3-540-59071-4\_36}, timestamp = {Sat, 20 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/EbertF94.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/Garbe94, author = {Renate Garbe}, editor = {Ernst W. Mayr and Gunther Schmidt and Gottfried Tinhofer}, title = {Tree-width and Path-width of Comparability Graphs of interval Orders}, booktitle = {Graph-Theoretic Concepts in Computer Science, 20th International Workshop, {WG} '94, Herrsching, Germany, June 16-18, 1994, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {903}, pages = {26--37}, publisher = {Springer}, year = {1994}, url = {https://doi.org/10.1007/3-540-59071-4\_35}, doi = {10.1007/3-540-59071-4\_35}, timestamp = {Sat, 20 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/Garbe94.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/Giaccio94, author = {Roberto Giaccio}, editor = {Ernst W. Mayr and Gunther Schmidt and Gottfried Tinhofer}, title = {On-line Algorithms for Satisfiability Problems with Uncertainty}, booktitle = {Graph-Theoretic Concepts in Computer Science, 20th International Workshop, {WG} '94, Herrsching, Germany, June 16-18, 1994, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {903}, pages = {371--386}, publisher = {Springer}, year = {1994}, url = {https://doi.org/10.1007/3-540-59071-4\_62}, doi = {10.1007/3-540-59071-4\_62}, timestamp = {Sat, 20 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/Giaccio94.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/GolinZ94, author = {Mordecai J. Golin and Shmuel Zaks}, editor = {Ernst W. Mayr and Gunther Schmidt and Gottfried Tinhofer}, title = {Labelled Trees and Pairs of Input-Output Permutations in Priority Queues}, booktitle = {Graph-Theoretic Concepts in Computer Science, 20th International Workshop, {WG} '94, Herrsching, Germany, June 16-18, 1994, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {903}, pages = {282--291}, publisher = {Springer}, year = {1994}, url = {https://doi.org/10.1007/3-540-59071-4\_55}, doi = {10.1007/3-540-59071-4\_55}, timestamp = {Sat, 20 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/GolinZ94.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/JakobyRS94, author = {Andreas Jakoby and R{\"{u}}diger Reischuk and Christian Schindelhauer}, editor = {Ernst W. Mayr and Gunther Schmidt and Gottfried Tinhofer}, title = {The Complexity of Broadcasting in Planar and Decomposable Graphs}, booktitle = {Graph-Theoretic Concepts in Computer Science, 20th International Workshop, {WG} '94, Herrsching, Germany, June 16-18, 1994, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {903}, pages = {219--231}, publisher = {Springer}, year = {1994}, url = {https://doi.org/10.1007/3-540-59071-4\_50}, doi = {10.1007/3-540-59071-4\_50}, timestamp = {Tue, 07 May 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/JakobyRS94.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/KajitaniCS94, author = {Yoji Kajitani and Jun Dong Cho and Majid Sarrafzadeh}, editor = {Ernst W. Mayr and Gunther Schmidt and Gottfried Tinhofer}, title = {New Approximation Results on Graph Matching and related Problems}, booktitle = {Graph-Theoretic Concepts in Computer Science, 20th International Workshop, {WG} '94, Herrsching, Germany, June 16-18, 1994, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {903}, pages = {343--358}, publisher = {Springer}, year = {1994}, url = {https://doi.org/10.1007/3-540-59071-4\_60}, doi = {10.1007/3-540-59071-4\_60}, timestamp = {Sun, 25 Oct 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/KajitaniCS94.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/KloksKM94, author = {Ton Kloks and Dieter Kratsch and Haiko M{\"{u}}ller}, editor = {Ernst W. Mayr and Gunther Schmidt and Gottfried Tinhofer}, title = {Dominoes}, booktitle = {Graph-Theoretic Concepts in Computer Science, 20th International Workshop, {WG} '94, Herrsching, Germany, June 16-18, 1994, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {903}, pages = {106--120}, publisher = {Springer}, year = {1994}, url = {https://doi.org/10.1007/3-540-59071-4\_41}, doi = {10.1007/3-540-59071-4\_41}, timestamp = {Sun, 12 Nov 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/wg/KloksKM94.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/KratochvilPT94, author = {Jan Kratochv{\'{\i}}l and Andrzej Proskurowski and Jan Arne Telle}, editor = {Ernst W. Mayr and Gunther Schmidt and Gottfried Tinhofer}, title = {Complexity of Graph Covering Problems}, booktitle = {Graph-Theoretic Concepts in Computer Science, 20th International Workshop, {WG} '94, Herrsching, Germany, June 16-18, 1994, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {903}, pages = {93--105}, publisher = {Springer}, year = {1994}, url = {https://doi.org/10.1007/3-540-59071-4\_40}, doi = {10.1007/3-540-59071-4\_40}, timestamp = {Sat, 20 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/KratochvilPT94.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/Naumann94, author = {Valeska Naumann}, editor = {Ernst W. Mayr and Gunther Schmidt and Gottfried Tinhofer}, title = {Measuring the Distance to Series-Parallelity by Path Expressions}, booktitle = {Graph-Theoretic Concepts in Computer Science, 20th International Workshop, {WG} '94, Herrsching, Germany, June 16-18, 1994, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {903}, pages = {269--281}, publisher = {Springer}, year = {1994}, url = {https://doi.org/10.1007/3-540-59071-4\_54}, doi = {10.1007/3-540-59071-4\_54}, timestamp = {Sat, 20 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/Naumann94.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/Parisi-PresicceP94, author = {Francesco Parisi{-}Presicce and Gabriele Piersanti}, editor = {Ernst W. Mayr and Gunther Schmidt and Gottfried Tinhofer}, title = {Multilevel Graph Grammars}, booktitle = {Graph-Theoretic Concepts in Computer Science, 20th International Workshop, {WG} '94, Herrsching, Germany, June 16-18, 1994, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {903}, pages = {51--64}, publisher = {Springer}, year = {1994}, url = {https://doi.org/10.1007/3-540-59071-4\_37}, doi = {10.1007/3-540-59071-4\_37}, timestamp = {Sat, 20 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/Parisi-PresicceP94.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/Ramachandramurthi94, author = {Siddharthan Ramachandramurthi}, editor = {Ernst W. Mayr and Gunther Schmidt and Gottfried Tinhofer}, title = {A Lower Bound for Treewidth and Its Consequences}, booktitle = {Graph-Theoretic Concepts in Computer Science, 20th International Workshop, {WG} '94, Herrsching, Germany, June 16-18, 1994, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {903}, pages = {14--25}, publisher = {Springer}, year = {1994}, url = {https://doi.org/10.1007/3-540-59071-4\_34}, doi = {10.1007/3-540-59071-4\_34}, timestamp = {Sat, 20 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/Ramachandramurthi94.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/Schurr94, author = {Andy Sch{\"{u}}rr}, editor = {Ernst W. Mayr and Gunther Schmidt and Gottfried Tinhofer}, title = {Specification of Graph Translators with Triple Graph Grammars}, booktitle = {Graph-Theoretic Concepts in Computer Science, 20th International Workshop, {WG} '94, Herrsching, Germany, June 16-18, 1994, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {903}, pages = {151--163}, publisher = {Springer}, year = {1994}, url = {https://doi.org/10.1007/3-540-59071-4\_45}, doi = {10.1007/3-540-59071-4\_45}, timestamp = {Sat, 20 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/Schurr94.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/ShahrokhiSSV94, author = {Farhad Shahrokhi and Ondrej S{\'{y}}kora and L{\'{a}}szl{\'{o}} A. Sz{\'{e}}kely and Imrich Vrto}, editor = {Ernst W. Mayr and Gunther Schmidt and Gottfried Tinhofer}, title = {Book Embeddings and Crossing Numbers}, booktitle = {Graph-Theoretic Concepts in Computer Science, 20th International Workshop, {WG} '94, Herrsching, Germany, June 16-18, 1994, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {903}, pages = {256--268}, publisher = {Springer}, year = {1994}, url = {https://doi.org/10.1007/3-540-59071-4\_53}, doi = {10.1007/3-540-59071-4\_53}, timestamp = {Wed, 14 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/wg/ShahrokhiSSV94.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/SielingW94, author = {Detlef Sieling and Ingo Wegener}, editor = {Ernst W. Mayr and Gunther Schmidt and Gottfried Tinhofer}, title = {New Lower Bounds and Hierarchy Results for Restricted Branching Programs}, booktitle = {Graph-Theoretic Concepts in Computer Science, 20th International Workshop, {WG} '94, Herrsching, Germany, June 16-18, 1994, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {903}, pages = {359--370}, publisher = {Springer}, year = {1994}, url = {https://doi.org/10.1007/3-540-59071-4\_61}, doi = {10.1007/3-540-59071-4\_61}, timestamp = {Sat, 20 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/SielingW94.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/SkodinisW94, author = {Konstantin Skodinis and Egon Wanke}, editor = {Ernst W. Mayr and Gunther Schmidt and Gottfried Tinhofer}, title = {Exponential Time Analysis of Confluent and Boundary eNCE Graph Languages}, booktitle = {Graph-Theoretic Concepts in Computer Science, 20th International Workshop, {WG} '94, Herrsching, Germany, June 16-18, 1994, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {903}, pages = {180--192}, publisher = {Springer}, year = {1994}, url = {https://doi.org/10.1007/3-540-59071-4\_47}, doi = {10.1007/3-540-59071-4\_47}, timestamp = {Sat, 20 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/SkodinisW94.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/TurauC94, author = {Volker Turau and Weimin Chen}, editor = {Ernst W. Mayr and Gunther Schmidt and Gottfried Tinhofer}, title = {GLB-Closures in Directed Acyclic Graphs and Their Applications}, booktitle = {Graph-Theoretic Concepts in Computer Science, 20th International Workshop, {WG} '94, Herrsching, Germany, June 16-18, 1994, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {903}, pages = {121--129}, publisher = {Springer}, year = {1994}, url = {https://doi.org/10.1007/3-540-59071-4\_42}, doi = {10.1007/3-540-59071-4\_42}, timestamp = {Mon, 08 Jun 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/TurauC94.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/WadaTK94, author = {Koichi Wada and Akinari Takaki and Kimio Kawaguchi}, editor = {Ernst W. Mayr and Gunther Schmidt and Gottfried Tinhofer}, title = {Efficient Algorithms for a Mixed k-Partition Problem of Graphs without Specifying Bases}, booktitle = {Graph-Theoretic Concepts in Computer Science, 20th International Workshop, {WG} '94, Herrsching, Germany, June 16-18, 1994, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {903}, pages = {319--330}, publisher = {Springer}, year = {1994}, url = {https://doi.org/10.1007/3-540-59071-4\_58}, doi = {10.1007/3-540-59071-4\_58}, timestamp = {Mon, 22 Jan 2024 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/wg/WadaTK94.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/Westfechtel94, author = {Bernhard Westfechtel}, editor = {Ernst W. Mayr and Gunther Schmidt and Gottfried Tinhofer}, title = {Using Programmed Graph Rewriting for the Formal Specification of a Configuration Management System}, booktitle = {Graph-Theoretic Concepts in Computer Science, 20th International Workshop, {WG} '94, Herrsching, Germany, June 16-18, 1994, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {903}, pages = {164--179}, publisher = {Springer}, year = {1994}, url = {https://doi.org/10.1007/3-540-59071-4\_46}, doi = {10.1007/3-540-59071-4\_46}, timestamp = {Sat, 20 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/Westfechtel94.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@proceedings{DBLP:conf/wg/1993, editor = {Jan van Leeuwen}, title = {Graph-Theoretic Concepts in Computer Science, 19th International Workshop, {WG} '93, Utrecht, The Netherlands, June 16-18, 1993, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {790}, publisher = {Springer}, year = {1994}, url = {https://doi.org/10.1007/3-540-57899-4}, doi = {10.1007/3-540-57899-4}, isbn = {3-540-57899-4}, timestamp = {Tue, 14 May 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/1993.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/AlimontiLMM93, author = {Paola Alimonti and Stefano Leonardi and Alberto Marchetti{-}Spaccamela and Xavier Messeguer}, editor = {Jan van Leeuwen}, title = {Average Case Analysis of Fully Dynamic Connectivity for Directed Graphs}, booktitle = {Graph-Theoretic Concepts in Computer Science, 19th International Workshop, {WG} '93, Utrecht, The Netherlands, June 16-18, 1993, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {790}, pages = {87--98}, publisher = {Springer}, year = {1993}, url = {https://doi.org/10.1007/3-540-57899-4\_43}, doi = {10.1007/3-540-57899-4\_43}, timestamp = {Tue, 27 Dec 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/wg/AlimontiLMM93.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/Bodlaender93, author = {Hans L. Bodlaender}, editor = {Jan van Leeuwen}, title = {On Reduction Algorithms for Graphs with Small Treewidth}, booktitle = {Graph-Theoretic Concepts in Computer Science, 19th International Workshop, {WG} '93, Utrecht, The Netherlands, June 16-18, 1993, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {790}, pages = {45--56}, publisher = {Springer}, year = {1993}, url = {https://doi.org/10.1007/3-540-57899-4\_40}, doi = {10.1007/3-540-57899-4\_40}, timestamp = {Mon, 26 Jun 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/Bodlaender93.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/Bodlaender93a, author = {Hans L. Bodlaender}, editor = {Jan van Leeuwen}, title = {Dynamic Algorithms for Graphs with Treewidth 2}, booktitle = {Graph-Theoretic Concepts in Computer Science, 19th International Workshop, {WG} '93, Utrecht, The Netherlands, June 16-18, 1993, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {790}, pages = {112--124}, publisher = {Springer}, year = {1993}, url = {https://doi.org/10.1007/3-540-57899-4\_45}, doi = {10.1007/3-540-57899-4\_45}, timestamp = {Mon, 26 Jun 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/Bodlaender93a.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/Boillat93, author = {Jacques E. Boillat}, editor = {Jan van Leeuwen}, title = {Fast Load Balancing in Cayley Graphs and in Circuits}, booktitle = {Graph-Theoretic Concepts in Computer Science, 19th International Workshop, {WG} '93, Utrecht, The Netherlands, June 16-18, 1993, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {790}, pages = {315--326}, publisher = {Springer}, year = {1993}, url = {https://doi.org/10.1007/3-540-57899-4\_62}, doi = {10.1007/3-540-57899-4\_62}, timestamp = {Sat, 20 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/Boillat93.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/BrandstadtDCV93, author = {Andreas Brandst{\"{a}}dt and Feodor F. Dragan and Victor Chepoi and Vitaly I. Voloshin}, editor = {Jan van Leeuwen}, title = {Dually Chordal Graphs}, booktitle = {Graph-Theoretic Concepts in Computer Science, 19th International Workshop, {WG} '93, Utrecht, The Netherlands, June 16-18, 1993, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {790}, pages = {237--251}, publisher = {Springer}, year = {1993}, url = {https://doi.org/10.1007/3-540-57899-4\_56}, doi = {10.1007/3-540-57899-4\_56}, timestamp = {Sat, 20 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/BrandstadtDCV93.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/BrandstadtV93, author = {Andreas Brandst{\"{a}}dt and Heinz{-}J{\"{u}}rgen Voss}, editor = {Jan van Leeuwen}, title = {Short Disjoint Cycles in Graphs with Degree Constraints}, booktitle = {Graph-Theoretic Concepts in Computer Science, 19th International Workshop, {WG} '93, Utrecht, The Netherlands, June 16-18, 1993, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {790}, pages = {125--131}, publisher = {Springer}, year = {1993}, url = {https://doi.org/10.1007/3-540-57899-4\_46}, doi = {10.1007/3-540-57899-4\_46}, timestamp = {Sat, 20 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/BrandstadtV93.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/ChenK93, author = {Jianer Chen and Saroja P. Kanchi}, editor = {Jan van Leeuwen}, title = {Graph Ear Decompositions and Graph Embeddings (Extended Abstract)}, booktitle = {Graph-Theoretic Concepts in Computer Science, 19th International Workshop, {WG} '93, Utrecht, The Netherlands, June 16-18, 1993, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {790}, pages = {376--387}, publisher = {Springer}, year = {1993}, url = {https://doi.org/10.1007/3-540-57899-4\_67}, doi = {10.1007/3-540-57899-4\_67}, timestamp = {Sat, 20 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/ChenK93.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/CorneilOS93, author = {Derek G. Corneil and Stephan Olariu and Lorna Stewart}, editor = {Jan van Leeuwen}, title = {Asteroidal Triple-Free Graphs}, booktitle = {Graph-Theoretic Concepts in Computer Science, 19th International Workshop, {WG} '93, Utrecht, The Netherlands, June 16-18, 1993, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {790}, pages = {211--224}, publisher = {Springer}, year = {1993}, url = {https://doi.org/10.1007/3-540-57899-4\_54}, doi = {10.1007/3-540-57899-4\_54}, timestamp = {Sat, 20 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/CorneilOS93.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/Dahlhaus93, author = {Elias Dahlhaus}, editor = {Jan van Leeuwen}, title = {The Parallel Complexity of Elimination Ordering Procedures}, booktitle = {Graph-Theoretic Concepts in Computer Science, 19th International Workshop, {WG} '93, Utrecht, The Netherlands, June 16-18, 1993, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {790}, pages = {225--236}, publisher = {Springer}, year = {1993}, url = {https://doi.org/10.1007/3-540-57899-4\_55}, doi = {10.1007/3-540-57899-4\_55}, timestamp = {Sat, 20 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/Dahlhaus93.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/Desel93, author = {J{\"{o}}rg Desel}, editor = {Jan van Leeuwen}, title = {Regular Marked Petri Nets}, booktitle = {Graph-Theoretic Concepts in Computer Science, 19th International Workshop, {WG} '93, Utrecht, The Netherlands, June 16-18, 1993, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {790}, pages = {264--275}, publisher = {Springer}, year = {1993}, url = {https://doi.org/10.1007/3-540-57899-4\_58}, doi = {10.1007/3-540-57899-4\_58}, timestamp = {Sat, 20 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/Desel93.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/EsparzaS93, author = {Javier Esparza and Bernhard von Stengel}, editor = {Jan van Leeuwen}, title = {The Asynchronous Committee Meeting Problem}, booktitle = {Graph-Theoretic Concepts in Computer Science, 19th International Workshop, {WG} '93, Utrecht, The Netherlands, June 16-18, 1993, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {790}, pages = {276--287}, publisher = {Springer}, year = {1993}, url = {https://doi.org/10.1007/3-540-57899-4\_59}, doi = {10.1007/3-540-57899-4\_59}, timestamp = {Fri, 09 Apr 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/EsparzaS93.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/GolumbicKS93, author = {Martin Charles Golumbic and Haim Kaplan and Ron Shamir}, editor = {Jan van Leeuwen}, title = {Algorithms and Complexity of Sandwich Problems in Graphs (Extended Abstract)}, booktitle = {Graph-Theoretic Concepts in Computer Science, 19th International Workshop, {WG} '93, Utrecht, The Netherlands, June 16-18, 1993, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {790}, pages = {57--69}, publisher = {Springer}, year = {1993}, url = {https://doi.org/10.1007/3-540-57899-4\_41}, doi = {10.1007/3-540-57899-4\_41}, timestamp = {Sat, 20 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/GolumbicKS93.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/Haldar93, author = {S. Haldar}, editor = {Jan van Leeuwen}, title = {An 'All Pairs Shortest Path' Distributed Algorithm Using 2n{\({^2}\)} Messages}, booktitle = {Graph-Theoretic Concepts in Computer Science, 19th International Workshop, {WG} '93, Utrecht, The Netherlands, June 16-18, 1993, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {790}, pages = {350--363}, publisher = {Springer}, year = {1993}, url = {https://doi.org/10.1007/3-540-57899-4\_65}, doi = {10.1007/3-540-57899-4\_65}, timestamp = {Sat, 20 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/Haldar93.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/HavasMWC93, author = {George Havas and Bohdan S. Majewski and Nicholas C. Wormald and Zbigniew J. Czech}, editor = {Jan van Leeuwen}, title = {Graphs, Hypergraphs and Hashing}, booktitle = {Graph-Theoretic Concepts in Computer Science, 19th International Workshop, {WG} '93, Utrecht, The Netherlands, June 16-18, 1993, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {790}, pages = {153--165}, publisher = {Springer}, year = {1993}, url = {https://doi.org/10.1007/3-540-57899-4\_49}, doi = {10.1007/3-540-57899-4\_49}, timestamp = {Sat, 20 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/HavasMWC93.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/HollowayRG93, author = {N. W. Holloway and Somasundaram Ravindran and Alan Gibbons}, editor = {Jan van Leeuwen}, title = {Approximating Minimum Weight Perfect Matchings for Complete Graphs Satisfying the Triangle Inequality}, booktitle = {Graph-Theoretic Concepts in Computer Science, 19th International Workshop, {WG} '93, Utrecht, The Netherlands, June 16-18, 1993, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {790}, pages = {11--20}, publisher = {Springer}, year = {1993}, url = {https://doi.org/10.1007/3-540-57899-4\_37}, doi = {10.1007/3-540-57899-4\_37}, timestamp = {Sat, 20 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/HollowayRG93.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.