default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSearch dblp for Publications
export results for "toc:db/conf/wg/wg2004.bht:"
download as .bib file
@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}
}
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.
retrieved on 2024-09-21 20:24 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
