Search dblp for Publications

export results for "toc:db/conf/wg/wg2018.bht:"

 download as .bib file

@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    = {Wed, 09 Jun 2021 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}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics

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.