Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSearch dblp for Publications
export results for "toc:db/conf/wg/wg92.bht:"
download as .bib file
@proceedings{DBLP:conf/wg/1992,
editor = {Ernst W. Mayr},
title = {Graph-Theoretic Concepts in Computer Science, 18th International Workshop,
{WG} '92, Wiesbaden-Naurod, Germany, June 19-20, 1992, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {657},
publisher = {Springer},
year = {1993},
url = {https://doi.org/10.1007/3-540-56402-0},
doi = {10.1007/3-540-56402-0},
isbn = {3-540-56402-0},
timestamp = {Tue, 14 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wg/1992.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/AlimontiF92,
author = {Paola Alimonti and
Esteban Feuerstein},
editor = {Ernst W. Mayr},
title = {Petri Nets, Hypergraphs and Conflicts (Preliminary Version)},
booktitle = {Graph-Theoretic Concepts in Computer Science, 18th International Workshop,
{WG} '92, Wiesbaden-Naurod, Germany, June 19-20, 1992, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {657},
pages = {293--309},
publisher = {Springer},
year = {1992},
url = {https://doi.org/10.1007/3-540-56402-0\_55},
doi = {10.1007/3-540-56402-0\_55},
timestamp = {Tue, 14 May 2019 10:00:40 +0200},
biburl = {https://dblp.org/rec/conf/wg/AlimontiF92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/BhatiaLMN92,
author = {Dinesh Bhatia and
Frank Thomson Leighton and
Fillia Makedon and
Carolyn Haibt Norton},
editor = {Ernst W. Mayr},
title = {Improved Algorithms for Routing on Two-Dimensional Grids},
booktitle = {Graph-Theoretic Concepts in Computer Science, 18th International Workshop,
{WG} '92, Wiesbaden-Naurod, Germany, June 19-20, 1992, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {657},
pages = {114--122},
publisher = {Springer},
year = {1992},
url = {https://doi.org/10.1007/3-540-56402-0\_41},
doi = {10.1007/3-540-56402-0\_41},
timestamp = {Sat, 20 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wg/BhatiaLMN92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/Bodlaender92,
author = {Hans L. Bodlaender},
editor = {Ernst W. Mayr},
title = {Kayles on Special Classes of Graphs - An Application of Sprague-Grundy
Theory},
booktitle = {Graph-Theoretic Concepts in Computer Science, 18th International Workshop,
{WG} '92, Wiesbaden-Naurod, Germany, June 19-20, 1992, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {657},
pages = {90--102},
publisher = {Springer},
year = {1992},
url = {https://doi.org/10.1007/3-540-56402-0\_39},
doi = {10.1007/3-540-56402-0\_39},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/wg/Bodlaender92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/BodlaenderJW92,
author = {Hans L. Bodlaender and
Klaus Jansen and
Gerhard J. Woeginger},
editor = {Ernst W. Mayr},
title = {Scheduling with Incompatible Jobs},
booktitle = {Graph-Theoretic Concepts in Computer Science, 18th International Workshop,
{WG} '92, Wiesbaden-Naurod, Germany, June 19-20, 1992, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {657},
pages = {37--49},
publisher = {Springer},
year = {1992},
url = {https://doi.org/10.1007/3-540-56402-0\_34},
doi = {10.1007/3-540-56402-0\_34},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wg/BodlaenderJW92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/Brandstadt92,
author = {Andreas Brandst{\"{a}}dt},
editor = {Ernst W. Mayr},
title = {On Improved Time Bounds for Permutation Graph Problems},
booktitle = {Graph-Theoretic Concepts in Computer Science, 18th International Workshop,
{WG} '92, Wiesbaden-Naurod, Germany, June 19-20, 1992, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {657},
pages = {1--10},
publisher = {Springer},
year = {1992},
url = {https://doi.org/10.1007/3-540-56402-0\_30},
doi = {10.1007/3-540-56402-0\_30},
timestamp = {Sat, 20 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wg/Brandstadt92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/Chen92,
author = {Jianer Chen},
editor = {Ernst W. Mayr},
title = {A Linear Time Algorithm for Isomorphism of Graphs of Bounded Average
Genus},
booktitle = {Graph-Theoretic Concepts in Computer Science, 18th International Workshop,
{WG} '92, Wiesbaden-Naurod, Germany, June 19-20, 1992, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {657},
pages = {103--113},
publisher = {Springer},
year = {1992},
url = {https://doi.org/10.1007/3-540-56402-0\_40},
doi = {10.1007/3-540-56402-0\_40},
timestamp = {Sat, 20 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wg/Chen92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/ChenK92,
author = {Jianer Chen and
Arkady Kanevsky},
editor = {Ernst W. Mayr},
title = {On Assembly of Four-Connected Graphs (Extended Abstract)},
booktitle = {Graph-Theoretic Concepts in Computer Science, 18th International Workshop,
{WG} '92, Wiesbaden-Naurod, Germany, June 19-20, 1992, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {657},
pages = {158--169},
publisher = {Springer},
year = {1992},
url = {https://doi.org/10.1007/3-540-56402-0\_45},
doi = {10.1007/3-540-56402-0\_45},
timestamp = {Sat, 20 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wg/ChenK92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/CournierH92,
author = {Alain Cournier and
Michel Habib},
editor = {Ernst W. Mayr},
title = {An Efficient Algorithm to Recognize Prime Undirected Graphs},
booktitle = {Graph-Theoretic Concepts in Computer Science, 18th International Workshop,
{WG} '92, Wiesbaden-Naurod, Germany, June 19-20, 1992, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {657},
pages = {212--224},
publisher = {Springer},
year = {1992},
url = {https://doi.org/10.1007/3-540-56402-0\_49},
doi = {10.1007/3-540-56402-0\_49},
timestamp = {Sat, 20 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wg/CournierH92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/Dahlhaus92,
author = {Elias Dahlhaus},
editor = {Ernst W. Mayr},
title = {Optimal (Parallel) Algorithms for the All-to-All Vertices Distance
Problem for Certain Graph Classes},
booktitle = {Graph-Theoretic Concepts in Computer Science, 18th International Workshop,
{WG} '92, Wiesbaden-Naurod, Germany, June 19-20, 1992, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {657},
pages = {60--69},
publisher = {Springer},
year = {1992},
url = {https://doi.org/10.1007/3-540-56402-0\_36},
doi = {10.1007/3-540-56402-0\_36},
timestamp = {Sat, 20 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wg/Dahlhaus92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/DasM92,
author = {Sajal K. Das and
Aisheng Mao},
editor = {Ernst W. Mayr},
title = {Embeddings in Recursive Combinatorial Networks},
booktitle = {Graph-Theoretic Concepts in Computer Science, 18th International Workshop,
{WG} '92, Wiesbaden-Naurod, Germany, June 19-20, 1992, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {657},
pages = {184--204},
publisher = {Springer},
year = {1992},
url = {https://doi.org/10.1007/3-540-56402-0\_47},
doi = {10.1007/3-540-56402-0\_47},
timestamp = {Tue, 10 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wg/DasM92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/Dinitz92,
author = {Yefim Dinitz},
editor = {Ernst W. Mayr},
title = {The 3-Edge-Components and a Structural Description of All 3-Edge-Cuts
in a Graph},
booktitle = {Graph-Theoretic Concepts in Computer Science, 18th International Workshop,
{WG} '92, Wiesbaden-Naurod, Germany, June 19-20, 1992, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {657},
pages = {145--157},
publisher = {Springer},
year = {1992},
url = {https://doi.org/10.1007/3-540-56402-0\_44},
doi = {10.1007/3-540-56402-0\_44},
timestamp = {Sat, 20 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wg/Dinitz92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/Erwig92,
author = {Martin Erwig},
editor = {Ernst W. Mayr},
title = {Graph Algorithms = Iteration + Data Structures? The Structure of Graph
Algorithms and a Corresponding Style of Programming},
booktitle = {Graph-Theoretic Concepts in Computer Science, 18th International Workshop,
{WG} '92, Wiesbaden-Naurod, Germany, June 19-20, 1992, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {657},
pages = {277--292},
publisher = {Springer},
year = {1992},
url = {https://doi.org/10.1007/3-540-56402-0\_54},
doi = {10.1007/3-540-56402-0\_54},
timestamp = {Sat, 20 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wg/Erwig92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/Felsner92,
author = {Stefan Felsner},
editor = {Ernst W. Mayr},
title = {Tolerance Graphs and Orders},
booktitle = {Graph-Theoretic Concepts in Computer Science, 18th International Workshop,
{WG} '92, Wiesbaden-Naurod, Germany, June 19-20, 1992, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {657},
pages = {17--26},
publisher = {Springer},
year = {1992},
url = {https://doi.org/10.1007/3-540-56402-0\_32},
doi = {10.1007/3-540-56402-0\_32},
timestamp = {Sat, 20 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wg/Felsner92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/FelsnerW92,
author = {Stefan Felsner and
Dorothea Wagner},
editor = {Ernst W. Mayr},
title = {On the Complexity of Partial Order Properties},
booktitle = {Graph-Theoretic Concepts in Computer Science, 18th International Workshop,
{WG} '92, Wiesbaden-Naurod, Germany, June 19-20, 1992, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {657},
pages = {225--235},
publisher = {Springer},
year = {1992},
url = {https://doi.org/10.1007/3-540-56402-0\_50},
doi = {10.1007/3-540-56402-0\_50},
timestamp = {Sat, 20 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wg/FelsnerW92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/GergovM92,
author = {Jordan Gergov and
Christoph Meinel},
editor = {Ernst W. Mayr},
title = {Analysis and Manipulation of Boolean Functions in Terms of Decision
Graphs},
booktitle = {Graph-Theoretic Concepts in Computer Science, 18th International Workshop,
{WG} '92, Wiesbaden-Naurod, Germany, June 19-20, 1992, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {657},
pages = {310--320},
publisher = {Springer},
year = {1992},
url = {https://doi.org/10.1007/3-540-56402-0\_56},
doi = {10.1007/3-540-56402-0\_56},
timestamp = {Sat, 20 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wg/GergovM92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/GerstelZ92,
author = {Ornan Ori Gerstel and
Shmuel Zaks},
editor = {Ernst W. Mayr},
title = {A New Characterization of Tree Medians with Applications to Distributed
Algorithms},
booktitle = {Graph-Theoretic Concepts in Computer Science, 18th International Workshop,
{WG} '92, Wiesbaden-Naurod, Germany, June 19-20, 1992, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {657},
pages = {135--144},
publisher = {Springer},
year = {1992},
url = {https://doi.org/10.1007/3-540-56402-0\_43},
doi = {10.1007/3-540-56402-0\_43},
timestamp = {Sat, 20 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wg/GerstelZ92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/Hromkovic92,
author = {Juraj Hromkovic},
editor = {Ernst W. Mayr},
title = {Topology of Parallel Networks and Computational Complexity (Extended
Abstract)},
booktitle = {Graph-Theoretic Concepts in Computer Science, 18th International Workshop,
{WG} '92, Wiesbaden-Naurod, Germany, June 19-20, 1992, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {657},
pages = {70--77},
publisher = {Springer},
year = {1992},
url = {https://doi.org/10.1007/3-540-56402-0\_37},
doi = {10.1007/3-540-56402-0\_37},
timestamp = {Sat, 20 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wg/Hromkovic92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/Hsu92,
author = {Wen{-}Lian Hsu},
editor = {Ernst W. Mayr},
title = {A Simple Test for Interval Graphs},
booktitle = {Graph-Theoretic Concepts in Computer Science, 18th International Workshop,
{WG} '92, Wiesbaden-Naurod, Germany, June 19-20, 1992, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {657},
pages = {11--16},
publisher = {Springer},
year = {1992},
url = {https://doi.org/10.1007/3-540-56402-0\_31},
doi = {10.1007/3-540-56402-0\_31},
timestamp = {Sat, 20 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wg/Hsu92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/Ihler92,
author = {Edmund Ihler},
editor = {Ernst W. Mayr},
title = {Minimum Rectilinear Steiner Tree for Intervals on two Parallel Lines},
booktitle = {Graph-Theoretic Concepts in Computer Science, 18th International Workshop,
{WG} '92, Wiesbaden-Naurod, Germany, June 19-20, 1992, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {657},
pages = {123--134},
publisher = {Springer},
year = {1992},
url = {https://doi.org/10.1007/3-540-56402-0\_42},
doi = {10.1007/3-540-56402-0\_42},
timestamp = {Sat, 20 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wg/Ihler92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/JamisonO92,
author = {Beverly Jamison and
Stephan Olariu},
editor = {Ernst W. Mayr},
title = {On the Homogeneous Decomposition of Graphs},
booktitle = {Graph-Theoretic Concepts in Computer Science, 18th International Workshop,
{WG} '92, Wiesbaden-Naurod, Germany, June 19-20, 1992, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {657},
pages = {170--183},
publisher = {Springer},
year = {1992},
url = {https://doi.org/10.1007/3-540-56402-0\_46},
doi = {10.1007/3-540-56402-0\_46},
timestamp = {Sat, 20 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wg/JamisonO92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/Jansen92,
author = {Klaus Jansen},
editor = {Ernst W. Mayr},
title = {On Scheduling Problems Restricted to Interval Orders},
booktitle = {Graph-Theoretic Concepts in Computer Science, 18th International Workshop,
{WG} '92, Wiesbaden-Naurod, Germany, June 19-20, 1992, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {657},
pages = {27--36},
publisher = {Springer},
year = {1992},
url = {https://doi.org/10.1007/3-540-56402-0\_33},
doi = {10.1007/3-540-56402-0\_33},
timestamp = {Sat, 20 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wg/Jansen92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/JansenS92,
author = {Klaus Jansen and
Petra Scheffler},
editor = {Ernst W. Mayr},
title = {Generalized Coloring for Tree-like Graphs},
booktitle = {Graph-Theoretic Concepts in Computer Science, 18th International Workshop,
{WG} '92, Wiesbaden-Naurod, Germany, June 19-20, 1992, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {657},
pages = {50--59},
publisher = {Springer},
year = {1992},
url = {https://doi.org/10.1007/3-540-56402-0\_35},
doi = {10.1007/3-540-56402-0\_35},
timestamp = {Sat, 20 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wg/JansenS92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/Kant92,
author = {Goos Kant},
editor = {Ernst W. Mayr},
title = {Hexagonal Grid Drawings},
booktitle = {Graph-Theoretic Concepts in Computer Science, 18th International Workshop,
{WG} '92, Wiesbaden-Naurod, Germany, June 19-20, 1992, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {657},
pages = {263--276},
publisher = {Springer},
year = {1992},
url = {https://doi.org/10.1007/3-540-56402-0\_53},
doi = {10.1007/3-540-56402-0\_53},
timestamp = {Sat, 20 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wg/Kant92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/LitovskyMZ92,
author = {Igor Litovsky and
Yves M{\'{e}}tivier and
Wieslaw Zielonka},
editor = {Ernst W. Mayr},
title = {The Power and the Limitations of Local Computations on Graphs},
booktitle = {Graph-Theoretic Concepts in Computer Science, 18th International Workshop,
{WG} '92, Wiesbaden-Naurod, Germany, June 19-20, 1992, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {657},
pages = {333--345},
publisher = {Springer},
year = {1992},
url = {https://doi.org/10.1007/3-540-56402-0\_58},
doi = {10.1007/3-540-56402-0\_58},
timestamp = {Sat, 20 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wg/LitovskyMZ92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/Mosbah92,
author = {Mohamed Mosbah},
editor = {Ernst W. Mayr},
title = {Probabilistic Graph Grammars},
booktitle = {Graph-Theoretic Concepts in Computer Science, 18th International Workshop,
{WG} '92, Wiesbaden-Naurod, Germany, June 19-20, 1992, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {657},
pages = {236--247},
publisher = {Springer},
year = {1992},
url = {https://doi.org/10.1007/3-540-56402-0\_51},
doi = {10.1007/3-540-56402-0\_51},
timestamp = {Tue, 11 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wg/Mosbah92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/OReillyS92,
author = {Una{-}May O'Reilly and
Nicola Santoro},
editor = {Ernst W. Mayr},
title = {The Expressiveness of Silence: Tight Bounds for Synchronous Communication
of Information Using Bits and Silence},
booktitle = {Graph-Theoretic Concepts in Computer Science, 18th International Workshop,
{WG} '92, Wiesbaden-Naurod, Germany, June 19-20, 1992, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {657},
pages = {321--332},
publisher = {Springer},
year = {1992},
url = {https://doi.org/10.1007/3-540-56402-0\_57},
doi = {10.1007/3-540-56402-0\_57},
timestamp = {Sat, 20 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wg/OReillyS92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/Parisi-Presicce92,
author = {Francesco Parisi{-}Presicce},
editor = {Ernst W. Mayr},
title = {Single vs. Double Pushout Derivations of Graphs},
booktitle = {Graph-Theoretic Concepts in Computer Science, 18th International Workshop,
{WG} '92, Wiesbaden-Naurod, Germany, June 19-20, 1992, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {657},
pages = {248--262},
publisher = {Springer},
year = {1992},
url = {https://doi.org/10.1007/3-540-56402-0\_52},
doi = {10.1007/3-540-56402-0\_52},
timestamp = {Sat, 20 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wg/Parisi-Presicce92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/Preilowski92,
author = {Waldemar Preilowski},
editor = {Ernst W. Mayr},
title = {Parallel Triangulation of Nonconvex Polytopes},
booktitle = {Graph-Theoretic Concepts in Computer Science, 18th International Workshop,
{WG} '92, Wiesbaden-Naurod, Germany, June 19-20, 1992, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {657},
pages = {78--89},
publisher = {Springer},
year = {1992},
url = {https://doi.org/10.1007/3-540-56402-0\_38},
doi = {10.1007/3-540-56402-0\_38},
timestamp = {Sat, 20 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wg/Preilowski92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/Thorup92,
author = {Mikkel Thorup},
editor = {Ernst W. Mayr},
title = {On Shortcutting Digraphs},
booktitle = {Graph-Theoretic Concepts in Computer Science, 18th International Workshop,
{WG} '92, Wiesbaden-Naurod, Germany, June 19-20, 1992, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {657},
pages = {205--211},
publisher = {Springer},
year = {1992},
url = {https://doi.org/10.1007/3-540-56402-0\_48},
doi = {10.1007/3-540-56402-0\_48},
timestamp = {Thu, 15 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wg/Thorup92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of 
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-05-02 15:11 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:
