Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBibTeX records: Peter Damaschke
@inproceedings{DBLP:conf/stringology/Damaschke23,
author = {Peter Damaschke},
editor = {Jan Holub and
Jan Zd{\'{a}}rek},
title = {Tandem Duplication Parameterized by the Length Difference},
booktitle = {Prague Stringology Conference 2023, Prague, Czech Republic, August
28-29, 2023},
pages = {18--29},
publisher = {Czech Technical University in Prague, Faculty of Information Technology,
Department of Theoretical Computer Science},
year = {2023},
url = {http://www.stringology.org/event/2023/p03.html},
timestamp = {Wed, 31 Jan 2024 17:00:02 +0100},
biburl = {https://dblp.org/rec/conf/stringology/Damaschke23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/atmos/Damaschke21,
author = {Peter Damaschke},
editor = {Matthias M{\"{u}}ller{-}Hannemann and
Federico Perea},
title = {Distance-Based Solution of Patrolling Problems with Individual Waiting
Times},
booktitle = {21st Symposium on Algorithmic Approaches for Transportation Modelling,
Optimization, and Systems, {ATMOS} 2021, September 9-10, 2021, Lisbon,
Portugal (Virtual Conference)},
series = {OASIcs},
volume = {96},
pages = {14:1--14:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/OASIcs.ATMOS.2021.14},
doi = {10.4230/OASICS.ATMOS.2021.14},
timestamp = {Tue, 15 Feb 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/atmos/Damaschke21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwoca/Damaschke21,
author = {Peter Damaschke},
editor = {Paola Flocchini and
Lucia Moura},
title = {On an Ordering Problem in Weighted Hypergraphs},
booktitle = {Combinatorial Algorithms - 32nd International Workshop, {IWOCA} 2021,
Ottawa, ON, Canada, July 5-7, 2021, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {12757},
pages = {252--264},
publisher = {Springer},
year = {2021},
url = {https://doi.org/10.1007/978-3-030-79987-8\_18},
doi = {10.1007/978-3-030-79987-8\_18},
timestamp = {Mon, 12 Jul 2021 09:19:27 +0200},
biburl = {https://dblp.org/rec/conf/iwoca/Damaschke21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ajc/Damaschke20,
author = {Peter Damaschke},
title = {Equitable induced decompositions of twin graphs},
journal = {Australas. {J} Comb.},
volume = {76},
pages = {24--40},
year = {2020},
url = {http://ajc.maths.uq.edu.au/pdf/76/ajc\_v76\_p024.pdf},
timestamp = {Tue, 23 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ajc/Damaschke20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/Damaschke20,
author = {Peter Damaschke},
title = {Dividing Splittable Goods Evenly and With Limited Fragmentation},
journal = {Algorithmica},
volume = {82},
number = {5},
pages = {1298--1328},
year = {2020},
url = {https://doi.org/10.1007/s00453-019-00643-z},
doi = {10.1007/S00453-019-00643-Z},
timestamp = {Fri, 14 May 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/Damaschke20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/Damaschke20,
author = {Peter Damaschke},
title = {Enumerating Grid Layouts of Graphs},
journal = {J. Graph Algorithms Appl.},
volume = {24},
number = {3},
pages = {433--460},
year = {2020},
url = {https://doi.org/10.7155/jgaa.00541},
doi = {10.7155/JGAA.00541},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/Damaschke20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/SalmanED20,
author = {Raad Salman and
Fredrik Ekstedt and
Peter Damaschke},
title = {Branch-and-bound for the Precedence Constrained Generalized Traveling
Salesman Problem},
journal = {Oper. Res. Lett.},
volume = {48},
number = {2},
pages = {163--166},
year = {2020},
url = {https://doi.org/10.1016/j.orl.2020.01.009},
doi = {10.1016/J.ORL.2020.01.009},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/SalmanED20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwoca/Damaschke20,
author = {Peter Damaschke},
editor = {Leszek Gasieniec and
Ralf Klasing and
Tomasz Radzik},
title = {Two Robots Patrolling on a Line: Integer Version and Approximability},
booktitle = {Combinatorial Algorithms - 31st International Workshop, {IWOCA} 2020,
Bordeaux, France, June 8-10, 2020, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {12126},
pages = {211--223},
publisher = {Springer},
year = {2020},
url = {https://doi.org/10.1007/978-3-030-48966-3\_16},
doi = {10.1007/978-3-030-48966-3\_16},
timestamp = {Fri, 29 May 2020 16:43:36 +0200},
biburl = {https://dblp.org/rec/conf/iwoca/Damaschke20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwoca/Damaschke20a,
author = {Peter Damaschke},
editor = {Leszek Gasieniec and
Ralf Klasing and
Tomasz Radzik},
title = {Ordering a Sparse Graph to Minimize the Sum of Right Ends of Edges},
booktitle = {Combinatorial Algorithms - 31st International Workshop, {IWOCA} 2020,
Bordeaux, France, June 8-10, 2020, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {12126},
pages = {224--236},
publisher = {Springer},
year = {2020},
url = {https://doi.org/10.1007/978-3-030-48966-3\_17},
doi = {10.1007/978-3-030-48966-3\_17},
timestamp = {Fri, 29 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/iwoca/Damaschke20a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/socs/SalmanED20,
author = {Raad Salman and
Fredrik Ekstedt and
Peter Damaschke},
editor = {Daniel Harabor and
Mauro Vallati},
title = {Branch-and-Bound for the Precedence Constrained Generalized Traveling
Salesman Problem},
booktitle = {Proceedings of the Thirteenth International Symposium on Combinatorial
Search, {SOCS} 2020, Online Conference [Vienna, Austria], 26-28 May
2020},
pages = {137--138},
publisher = {{AAAI} Press},
year = {2020},
url = {https://doi.org/10.1609/socs.v11i1.18520},
doi = {10.1609/SOCS.V11I1.18520},
timestamp = {Mon, 18 Dec 2023 04:11:03 +0100},
biburl = {https://dblp.org/rec/conf/socs/SalmanED20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/Damaschke19,
author = {Peter Damaschke},
title = {Parameterized Mixed Graph Coloring},
journal = {J. Comb. Optim.},
volume = {38},
number = {2},
pages = {362--374},
year = {2019},
url = {https://doi.org/10.1007/s10878-019-00388-z},
doi = {10.1007/S10878-019-00388-Z},
timestamp = {Tue, 20 Aug 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/Damaschke19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ol/Damaschke19,
author = {Peter Damaschke},
title = {Optimal partial clique edge covering guided by potential energy minimization},
journal = {Optim. Lett.},
volume = {13},
number = {7},
pages = {1469--1481},
year = {2019},
url = {https://doi.org/10.1007/s11590-019-01469-y},
doi = {10.1007/S11590-019-01469-Y},
timestamp = {Fri, 03 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ol/Damaschke19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Damaschke19,
author = {Peter Damaschke},
title = {Combinatorial search in two and more rounds},
journal = {Theor. Comput. Sci.},
volume = {780},
pages = {1--11},
year = {2019},
url = {https://doi.org/10.1016/j.tcs.2019.02.004},
doi = {10.1016/J.TCS.2019.02.004},
timestamp = {Wed, 03 Jul 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/Damaschke19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/Damaschke18,
author = {Peter Damaschke},
title = {The Solution Space of Sorting with Recurring Comparison Faults},
journal = {Theory Comput. Syst.},
volume = {62},
number = {6},
pages = {1427--1442},
year = {2018},
url = {https://doi.org/10.1007/s00224-017-9807-4},
doi = {10.1007/S00224-017-9807-4},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/Damaschke18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sofsem/DamaschkeS18,
author = {Peter Damaschke and
Alexander Schliep},
editor = {A Min Tjoa and
Ladjel Bellatreche and
Stefan Biffl and
Jan van Leeuwen and
Jir{\'{\i}} Wiedermann},
title = {An Optimization Problem Related to Bloom Filters with Bit Patterns},
booktitle = {{SOFSEM} 2018: Theory and Practice of Computer Science - 44th International
Conference on Current Trends in Theory and Practice of Computer Science,
Krems, Austria, January 29 - February 2, 2018, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {10706},
pages = {525--538},
publisher = {Springer},
year = {2018},
url = {https://doi.org/10.1007/978-3-319-73117-9\_37},
doi = {10.1007/978-3-319-73117-9\_37},
timestamp = {Sat, 30 Sep 2023 09:57:10 +0200},
biburl = {https://dblp.org/rec/conf/sofsem/DamaschkeS18.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 = {Tue, 14 May 2019 10:00:40 +0200},
biburl = {https://dblp.org/rec/conf/wg/Damaschke18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dmaa/Damaschke17,
author = {Peter Damaschke},
title = {Finding defectives on a line by random docking and interval group
tests},
journal = {Discret. Math. Algorithms Appl.},
volume = {9},
number = {3},
pages = {1750029:1--1750029:11},
year = {2017},
url = {https://doi.org/10.1142/S179383091750029X},
doi = {10.1142/S179383091750029X},
timestamp = {Wed, 12 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dmaa/Damaschke17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Damaschke17,
author = {Peter Damaschke},
title = {Refined algorithms for hitting many intervals},
journal = {Inf. Process. Lett.},
volume = {118},
pages = {117--122},
year = {2017},
url = {https://doi.org/10.1016/j.ipl.2016.11.001},
doi = {10.1016/J.IPL.2016.11.001},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Damaschke17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ol/Damaschke17,
author = {Peter Damaschke},
title = {Calculating approximation guarantees for partial set cover of pairs},
journal = {Optim. Lett.},
volume = {11},
number = {7},
pages = {1293--1302},
year = {2017},
url = {https://doi.org/10.1007/s11590-017-1108-y},
doi = {10.1007/S11590-017-1108-Y},
timestamp = {Fri, 03 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ol/Damaschke17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/Damaschke17,
author = {Peter Damaschke},
editor = {Kim G. Larsen and
Hans L. Bodlaender and
Jean{-}Fran{\c{c}}ois Raskin},
title = {Dividing Splittable Goods Evenly and With Limited Fragmentation},
booktitle = {42nd International Symposium on Mathematical Foundations of Computer
Science, {MFCS} 2017, August 21-25, 2017 - Aalborg, Denmark},
series = {LIPIcs},
volume = {83},
pages = {9:1--9:13},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2017},
url = {https://doi.org/10.4230/LIPIcs.MFCS.2017.9},
doi = {10.4230/LIPICS.MFCS.2017.9},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/mfcs/Damaschke17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/Damaschke16,
author = {Peter Damaschke},
title = {Adaptive group testing with a constrained number of positive responses
improved},
journal = {Discret. Appl. Math.},
volume = {205},
pages = {208--212},
year = {2016},
url = {https://doi.org/10.1016/j.dam.2016.01.010},
doi = {10.1016/J.DAM.2016.01.010},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/Damaschke16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Damaschke16,
author = {Peter Damaschke},
title = {Sufficient conditions for edit-optimal clusters},
journal = {Inf. Process. Lett.},
volume = {116},
number = {4},
pages = {267--272},
year = {2016},
url = {https://doi.org/10.1016/j.ipl.2015.12.004},
doi = {10.1016/J.IPL.2015.12.004},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Damaschke16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Damaschke16,
author = {Peter Damaschke},
title = {Deterministic versus randomized adaptive test cover},
journal = {Theor. Comput. Sci.},
volume = {653},
pages = {42--52},
year = {2016},
url = {https://doi.org/10.1016/j.tcs.2016.09.019},
doi = {10.1016/J.TCS.2016.09.019},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Damaschke16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwoca/Damaschke16,
author = {Peter Damaschke},
editor = {Veli M{\"{a}}kinen and
Simon J. Puglisi and
Leena Salmela},
title = {Computing Giant Graph Diameters},
booktitle = {Combinatorial Algorithms - 27th International Workshop, {IWOCA} 2016,
Helsinki, Finland, August 17-19, 2016, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {9843},
pages = {373--384},
publisher = {Springer},
year = {2016},
url = {https://doi.org/10.1007/978-3-319-44543-4\_29},
doi = {10.1007/978-3-319-44543-4\_29},
timestamp = {Tue, 14 May 2019 10:00:53 +0200},
biburl = {https://dblp.org/rec/conf/iwoca/Damaschke16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwoca/Damaschke16a,
author = {Peter Damaschke},
editor = {Veli M{\"{a}}kinen and
Simon J. Puglisi and
Leena Salmela},
title = {The Solution Space of Sorting with Recurring Comparison Faults},
booktitle = {Combinatorial Algorithms - 27th International Workshop, {IWOCA} 2016,
Helsinki, Finland, August 17-19, 2016, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {9843},
pages = {397--408},
publisher = {Springer},
year = {2016},
url = {https://doi.org/10.1007/978-3-319-44543-4\_31},
doi = {10.1007/978-3-319-44543-4\_31},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/iwoca/Damaschke16a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sofsem/MuhammadDM16,
author = {Azam Sheikh Muhammad and
Peter Damaschke and
Olof Mogren},
editor = {Rusins Martins Freivalds and
Gregor Engels and
Barbara Catania},
title = {Summarizing Online User Reviews Using Bicliques},
booktitle = {{SOFSEM} 2016: Theory and Practice of Computer Science - 42nd International
Conference on Current Trends in Theory and Practice of Computer Science,
Harrachov, Czech Republic, January 23-28, 2016, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {9587},
pages = {569--579},
publisher = {Springer},
year = {2016},
url = {https://doi.org/10.1007/978-3-662-49192-8\_46},
doi = {10.1007/978-3-662-49192-8\_46},
timestamp = {Sun, 25 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/sofsem/MuhammadDM16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/Damaschke15,
author = {Peter Damaschke},
title = {Parameterizations of hitting set of bundles and inverse scope},
journal = {J. Comb. Optim.},
volume = {29},
number = {4},
pages = {847--858},
year = {2015},
url = {https://doi.org/10.1007/s10878-013-9629-5},
doi = {10.1007/S10878-013-9629-5},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/Damaschke15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Damaschke15,
author = {Peter Damaschke},
title = {Finding and enumerating large intersections},
journal = {Theor. Comput. Sci.},
volume = {580},
pages = {75--82},
year = {2015},
url = {https://doi.org/10.1016/j.tcs.2015.02.034},
doi = {10.1016/J.TCS.2015.02.034},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Damaschke15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/Damaschke15,
author = {Peter Damaschke},
editor = {Vangelis Th. Paschos and
Peter Widmayer},
title = {Randomized Adaptive Test Cover},
booktitle = {Algorithms and Complexity - 9th International Conference, {CIAC} 2015,
Paris, France, May 20-22, 2015. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {9079},
pages = {182--193},
publisher = {Springer},
year = {2015},
url = {https://doi.org/10.1007/978-3-319-18173-8\_13},
doi = {10.1007/978-3-319-18173-8\_13},
timestamp = {Tue, 14 May 2019 10:00:53 +0200},
biburl = {https://dblp.org/rec/conf/ciac/Damaschke15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fct/Damaschke15,
author = {Peter Damaschke},
editor = {Adrian Kosowski and
Igor Walukiewicz},
title = {Pairs Covered by a Sequence of Sets},
booktitle = {Fundamentals of Computation Theory - 20th International Symposium,
{FCT} 2015, Gda{\'{n}}sk, Poland, August 17-19, 2015, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {9210},
pages = {214--226},
publisher = {Springer},
year = {2015},
url = {https://doi.org/10.1007/978-3-319-22177-9\_17},
doi = {10.1007/978-3-319-22177-9\_17},
timestamp = {Tue, 14 May 2019 10:00:53 +0200},
biburl = {https://dblp.org/rec/conf/fct/Damaschke15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Damaschke14,
author = {Peter Damaschke},
title = {Enumerating maximal bicliques in bipartite graphs with favorable degree
sequences},
journal = {Inf. Process. Lett.},
volume = {114},
number = {6},
pages = {317--321},
year = {2014},
url = {https://doi.org/10.1016/j.ipl.2014.02.001},
doi = {10.1016/J.IPL.2014.02.001},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Damaschke14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/DamaschkeMW14,
author = {Peter Damaschke and
Azam Sheikh Muhammad and
G{\'{a}}bor Wiener},
title = {Strict group testing and the set basis problem},
journal = {J. Comb. Theory, Ser. {A}},
volume = {126},
pages = {70--91},
year = {2014},
url = {https://doi.org/10.1016/j.jcta.2014.04.005},
doi = {10.1016/J.JCTA.2014.04.005},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jct/DamaschkeMW14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/DamaschkeM14,
author = {Peter Damaschke and
Olof Mogren},
title = {Editing Simple Graphs},
journal = {J. Graph Algorithms Appl.},
volume = {18},
number = {4},
pages = {557--576},
year = {2014},
url = {https://doi.org/10.7155/jgaa.00337},
doi = {10.7155/JGAA.00337},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/DamaschkeM14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/walcom/DamaschkeM14,
author = {Peter Damaschke and
Olof Mogren},
editor = {Sudebkumar Prasant Pal and
Kunihiko Sadakane},
title = {Editing the Simplest Graphs},
booktitle = {Algorithms and Computation - 8th International Workshop, {WALCOM}
2014, Chennai, India, February 13-15, 2014, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8344},
pages = {249--260},
publisher = {Springer},
year = {2014},
url = {https://doi.org/10.1007/978-3-319-04657-0\_24},
doi = {10.1007/978-3-319-04657-0\_24},
timestamp = {Tue, 14 May 2019 10:00:40 +0200},
biburl = {https://dblp.org/rec/conf/walcom/DamaschkeM14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/DamaschkeMT13,
author = {Peter Damaschke and
Azam Sheikh Muhammad and
Eberhard Triesch},
title = {Two New Perspectives on Multi-Stage Group Testing},
journal = {Algorithmica},
volume = {67},
number = {3},
pages = {324--354},
year = {2013},
url = {https://doi.org/10.1007/s00453-013-9781-4},
doi = {10.1007/S00453-013-9781-4},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/DamaschkeMT13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Damaschke13,
author = {Peter Damaschke},
title = {Sparse solutions of sparse linear systems: Fixed-parameter tractability
and an application of complex group testing},
journal = {Theor. Comput. Sci.},
volume = {511},
pages = {137--146},
year = {2013},
url = {https://doi.org/10.1016/j.tcs.2012.07.001},
doi = {10.1016/J.TCS.2012.07.001},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Damaschke13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cocoon/DamaschkeM13,
author = {Peter Damaschke and
Azam Sheikh Muhammad},
editor = {Ding{-}Zhu Du and
Guochuan Zhang},
title = {A Toolbox for Provably Optimal Multistage Strict Group Testing Strategies},
booktitle = {Computing and Combinatorics, 19th International Conference, {COCOON}
2013, Hangzhou, China, June 21-23, 2013. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7936},
pages = {446--457},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-642-38768-5\_40},
doi = {10.1007/978-3-642-38768-5\_40},
timestamp = {Sun, 25 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/cocoon/DamaschkeM13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwoca/Damaschke13,
author = {Peter Damaschke},
editor = {Thierry Lecroq and
Laurent Mouchard},
title = {Cluster Editing with Locally Bounded Modifications Revisited},
booktitle = {Combinatorial Algorithms - 24th International Workshop, {IWOCA} 2013,
Rouen, France, July 10-12, 2013, Revised Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {8288},
pages = {433--437},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-642-45278-9\_38},
doi = {10.1007/978-3-642-45278-9\_38},
timestamp = {Wed, 25 Sep 2019 18:08:04 +0200},
biburl = {https://dblp.org/rec/conf/iwoca/Damaschke13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/walcom/DamaschkeEM13,
author = {Peter Damaschke and
{\"{O}}mer Egecioglu and
Leonid Molokov},
editor = {Subir Kumar Ghosh and
Takeshi Tokuyama},
title = {Fixed-Parameter Tractability of Error Correction in Graphical Linear
Systems},
booktitle = {{WALCOM:} Algorithms and Computation, 7th International Workshop,
{WALCOM} 2013, Kharagpur, India, February 14-16, 2013. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7748},
pages = {245--256},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-642-36065-7\_23},
doi = {10.1007/978-3-642-36065-7\_23},
timestamp = {Sat, 30 Sep 2023 09:58:46 +0200},
biburl = {https://dblp.org/rec/conf/walcom/DamaschkeEM13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/BockerD12,
author = {Sebastian B{\"{o}}cker and
Peter Damaschke},
title = {A note on the parameterized complexity of unordered maximum tree orientation},
journal = {Discret. Appl. Math.},
volume = {160},
number = {10-11},
pages = {1634--1638},
year = {2012},
url = {https://doi.org/10.1016/j.dam.2012.02.017},
doi = {10.1016/J.DAM.2012.02.017},
timestamp = {Fri, 09 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dam/BockerD12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/DamaschkeM12,
author = {Peter Damaschke and
Leonid Molokov},
title = {Parameterized reductions and algorithms for a graph editing problem
that generalizes vertex cover},
journal = {Theor. Comput. Sci.},
volume = {452},
pages = {39--46},
year = {2012},
url = {https://doi.org/10.1016/j.tcs.2012.05.031},
doi = {10.1016/J.TCS.2012.05.031},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/DamaschkeM12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isbra/DamaschkeM12,
author = {Peter Damaschke and
Leonid Molokov},
editor = {Leonidas G. Bleris and
Ion I. Mandoiu and
Russell Schwartz and
Jianxin Wang},
title = {Error Propagation in Sparse Linear Systems with Peptide-Protein Incidence
Matrices},
booktitle = {Bioinformatics Research and Applications - 8th International Symposium,
{ISBRA} 2012, Dallas, TX, USA, May 21-23, 2012. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7292},
pages = {72--83},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-30191-9\_7},
doi = {10.1007/978-3-642-30191-9\_7},
timestamp = {Tue, 14 May 2019 10:00:51 +0200},
biburl = {https://dblp.org/rec/conf/isbra/DamaschkeM12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sofsem/DamaschkeM12,
author = {Peter Damaschke and
Azam Sheikh Muhammad},
editor = {M{\'{a}}ria Bielikov{\'{a}} and
Gerhard Friedrich and
Georg Gottlob and
Stefan Katzenbeisser and
Gy{\"{o}}rgy Tur{\'{a}}n},
title = {Randomized Group Testing Both Query-Optimal and Minimal Adaptive},
booktitle = {{SOFSEM} 2012: Theory and Practice of Computer Science - 38th Conference
on Current Trends in Theory and Practice of Computer Science, {\v{S}}pindler{\r{u}}v
Ml{\'{y}}n, Czech Republic, January 21-27, 2012. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7147},
pages = {214--225},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-27660-6\_18},
doi = {10.1007/978-3-642-27660-6\_18},
timestamp = {Sun, 25 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/sofsem/DamaschkeM12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/disopt/Damaschke11,
author = {Peter Damaschke},
title = {Parameterized algorithms for double hypergraph dualization with rank
limitation and maximum minimal vertex cover},
journal = {Discret. Optim.},
volume = {8},
number = {1},
pages = {18--24},
year = {2011},
url = {https://doi.org/10.1016/j.disopt.2010.02.006},
doi = {10.1016/J.DISOPT.2010.02.006},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/disopt/Damaschke11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dmaa/DamaschkeM11,
author = {Peter Damaschke and
Azam Sheikh Muhammad},
title = {Bounds for Nonadaptive Group Tests to estimate the Amount of Defectives},
journal = {Discret. Math. Algorithms Appl.},
volume = {3},
number = {4},
pages = {517--536},
year = {2011},
url = {https://doi.org/10.1142/S1793830911001383},
doi = {10.1142/S1793830911001383},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dmaa/DamaschkeM11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/BockerD11,
author = {Sebastian B{\"{o}}cker and
Peter Damaschke},
title = {Even faster parameterized cluster deletion and cluster editing},
journal = {Inf. Process. Lett.},
volume = {111},
number = {14},
pages = {717--721},
year = {2011},
url = {https://doi.org/10.1016/j.ipl.2011.05.003},
doi = {10.1016/J.IPL.2011.05.003},
timestamp = {Fri, 09 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/BockerD11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/Damaschke11,
author = {Peter Damaschke},
title = {Finding hidden hubs and dominating sets in sparse graphs by randomized
neighborhood queries},
journal = {Networks},
volume = {57},
number = {4},
pages = {344--350},
year = {2011},
url = {https://doi.org/10.1002/net.20404},
doi = {10.1002/NET.20404},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/Damaschke11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwpec/Damaschke11,
author = {Peter Damaschke},
editor = {D{\'{a}}niel Marx and
Peter Rossmanith},
title = {Sparse Solutions of Sparse Linear Systems: Fixed-Parameter Tractability
and an Application of Complex Group Testing},
booktitle = {Parameterized and Exact Computation - 6th International Symposium,
{IPEC} 2011, Saarbr{\"{u}}cken, Germany, September 6-8, 2011.
Revised Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {7112},
pages = {94--105},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-28050-4\_8},
doi = {10.1007/978-3-642-28050-4\_8},
timestamp = {Fri, 09 Apr 2021 18:49:30 +0200},
biburl = {https://dblp.org/rec/conf/iwpec/Damaschke11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wads/DamaschkeM11,
author = {Peter Damaschke and
Leonid Molokov},
editor = {Frank Dehne and
John Iacono and
J{\"{o}}rg{-}R{\"{u}}diger Sack},
title = {Parameterized Reductions and Algorithms for Another Vertex Cover Generalization},
booktitle = {Algorithms and Data Structures - 12th International Symposium, {WADS}
2011, New York, NY, USA, August 15-17, 2011. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6844},
pages = {279--289},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-22300-6\_24},
doi = {10.1007/978-3-642-22300-6\_24},
timestamp = {Tue, 14 May 2019 10:00:50 +0200},
biburl = {https://dblp.org/rec/conf/wads/DamaschkeM11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/Damaschke10,
author = {Peter Damaschke},
title = {Homogeneous String Segmentation using Trees and Weighted Independent
Sets},
journal = {Algorithmica},
volume = {57},
number = {4},
pages = {621--640},
year = {2010},
url = {https://doi.org/10.1007/s00453-008-9225-8},
doi = {10.1007/S00453-008-9225-8},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/Damaschke10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dmaa/DamaschkeM10,
author = {Peter Damaschke and
Azam Sheikh Muhammad},
title = {Competitive Group Testing and Learning Hidden Vertex Covers with Minimum
Adaptivity},
journal = {Discret. Math. Algorithms Appl.},
volume = {2},
number = {3},
pages = {291--312},
year = {2010},
url = {https://doi.org/10.1142/S179383091000067X},
doi = {10.1142/S179383091000067X},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dmaa/DamaschkeM10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/Damaschke10,
author = {Peter Damaschke},
title = {Fixed-Parameter Enumerability of Cluster Editing and Related Problems},
journal = {Theory Comput. Syst.},
volume = {46},
number = {2},
pages = {261--283},
year = {2010},
url = {https://doi.org/10.1007/s00224-008-9130-1},
doi = {10.1007/S00224-008-9130-1},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/Damaschke10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cocoa/DamaschkeM10,
author = {Peter Damaschke and
Azam Sheikh Muhammad},
editor = {Weili Wu and
Ovidiu Daescu},
title = {Bounds for Nonadaptive Group Tests to Estimate the Amount of Defectives},
booktitle = {Combinatorial Optimization and Applications - 4th International Conference,
{COCOA} 2010, Kailua-Kona, HI, USA, December 18-20, 2010, Proceedings,
Part {II}},
series = {Lecture Notes in Computer Science},
volume = {6509},
pages = {117--130},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-17461-2\_10},
doi = {10.1007/978-3-642-17461-2\_10},
timestamp = {Thu, 02 Dec 2021 16:45:00 +0100},
biburl = {https://dblp.org/rec/conf/cocoa/DamaschkeM10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/DamaschkeHT09,
author = {Peter Damaschke and
Phuong Hoai Ha and
Philippas Tsigas},
title = {Online Search with Time-Varying Price Bounds},
journal = {Algorithmica},
volume = {55},
number = {4},
pages = {619--642},
year = {2009},
url = {https://doi.org/10.1007/s00453-007-9156-9},
doi = {10.1007/S00453-007-9156-9},
timestamp = {Mon, 15 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/DamaschkeHT09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/Damaschke09,
author = {Peter Damaschke},
title = {Ranking hypotheses to minimize the search cost in probabilistic inference
models},
journal = {Discret. Appl. Math.},
volume = {157},
number = {6},
pages = {1218--1228},
year = {2009},
url = {https://doi.org/10.1016/j.dam.2007.12.006},
doi = {10.1016/J.DAM.2007.12.006},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/Damaschke09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/Damaschke09,
author = {Peter Damaschke},
title = {Multiple hypernode hitting sets and smallest two-cores with targets},
journal = {J. Comb. Optim.},
volume = {18},
number = {3},
pages = {294--306},
year = {2009},
url = {https://doi.org/10.1007/s10878-009-9234-9},
doi = {10.1007/S10878-009-9234-9},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/Damaschke09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/DamaschkeM09,
author = {Peter Damaschke and
Leonid Molokov},
title = {The union of minimal hitting sets: Parameterized combinatorial bounds
and counting},
journal = {J. Discrete Algorithms},
volume = {7},
number = {4},
pages = {391--401},
year = {2009},
url = {https://doi.org/10.1016/j.jda.2009.01.003},
doi = {10.1016/J.JDA.2009.01.003},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/DamaschkeM09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fct/DamaschkeM09,
author = {Peter Damaschke and
Azam Sheikh Muhammad},
editor = {Miroslaw Kutylowski and
Witold Charatonik and
Maciej Gebala},
title = {Competitive Group Testing and Learning Hidden Vertex Covers with Minimum
Adaptivity},
booktitle = {Fundamentals of Computation Theory, 17th International Symposium,
{FCT} 2009, Wroclaw, Poland, September 2-4, 2009. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5699},
pages = {84--95},
publisher = {Springer},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-03409-1\_9},
doi = {10.1007/978-3-642-03409-1\_9},
timestamp = {Sun, 25 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/fct/DamaschkeM09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwpec/Damaschke09,
author = {Peter Damaschke},
editor = {Jianer Chen and
Fedor V. Fomin},
title = {Bounded-Degree Techniques Accelerate Some Parameterized Graph Algorithms},
booktitle = {Parameterized and Exact Computation, 4th International Workshop, {IWPEC}
2009, Copenhagen, Denmark, September 10-11, 2009, Revised Selected
Papers},
series = {Lecture Notes in Computer Science},
volume = {5917},
pages = {98--109},
publisher = {Springer},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-11269-0\_8},
doi = {10.1007/978-3-642-11269-0\_8},
timestamp = {Tue, 14 May 2019 10:00:45 +0200},
biburl = {https://dblp.org/rec/conf/iwpec/Damaschke09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwpec/Damaschke09a,
author = {Peter Damaschke},
editor = {Jianer Chen and
Fedor V. Fomin},
title = {Pareto Complexity of Two-Parameter {FPT} Problems: {A} Case Study
for Partial Vertex Cover},
booktitle = {Parameterized and Exact Computation, 4th International Workshop, {IWPEC}
2009, Copenhagen, Denmark, September 10-11, 2009, Revised Selected
Papers},
series = {Lecture Notes in Computer Science},
volume = {5917},
pages = {110--121},
publisher = {Springer},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-11269-0\_9},
doi = {10.1007/978-3-642-11269-0\_9},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/iwpec/Damaschke09a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cccg/Damaschke08,
author = {Peter Damaschke},
title = {Competitive Search for Longest Empty Intervals},
booktitle = {Proceedings of the 20th Annual Canadian Conference on Computational
Geometry, Montr{\'{e}}al, Canada, August 13-15, 2008},
year = {2008},
timestamp = {Wed, 12 May 2021 14:19:37 +0200},
biburl = {https://dblp.org/rec/conf/cccg/Damaschke08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cocoa/Damaschke08,
author = {Peter Damaschke},
editor = {Boting Yang and
Ding{-}Zhu Du and
Cao An Wang},
title = {Multiple Hypernode Hitting Sets and Smallest Two-Cores with Targets},
booktitle = {Combinatorial Optimization and Applications, Second International
Conference, {COCOA} 2008, St. John's, NL, Canada, August 21-24, 2008.
Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5165},
pages = {32--42},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-85097-7\_4},
doi = {10.1007/978-3-540-85097-7\_4},
timestamp = {Tue, 14 May 2019 10:00:52 +0200},
biburl = {https://dblp.org/rec/conf/cocoa/Damaschke08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wabi/Damaschke08,
author = {Peter Damaschke},
editor = {Keith A. Crandall and
Jens Lagergren},
title = {Minimum Common String Partition Parameterized},
booktitle = {Algorithms in Bioinformatics, 8th International Workshop, {WABI} 2008,
Karlsruhe, Germany, September 15-19, 2008. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5251},
pages = {87--98},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-87361-7\_8},
doi = {10.1007/978-3-540-87361-7\_8},
timestamp = {Tue, 14 May 2019 10:00:40 +0200},
biburl = {https://dblp.org/rec/conf/wabi/Damaschke08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/CicaleseDTW07,
author = {Ferdinando Cicalese and
Peter Damaschke and
Libertad Tansini and
S{\"{o}}ren Werth},
title = {Overlaps help: Improved bounds for group testing with interval queries},
journal = {Discret. Appl. Math.},
volume = {155},
number = {3},
pages = {288--299},
year = {2007},
url = {https://doi.org/10.1016/j.dam.2006.07.002},
doi = {10.1016/J.DAM.2006.07.002},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/CicaleseDTW07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/Damaschke07,
author = {Peter Damaschke},
editor = {Wolfgang Thomas and
Pascal Weil},
title = {The Union of Minimal Hitting Sets: Parameterized Combinatorial Bounds
and Counting},
booktitle = {{STACS} 2007, 24th Annual Symposium on Theoretical Aspects of Computer
Science, Aachen, Germany, February 22-24, 2007, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4393},
pages = {332--343},
publisher = {Springer},
year = {2007},
url = {https://doi.org/10.1007/978-3-540-70918-3\_29},
doi = {10.1007/978-3-540-70918-3\_29},
timestamp = {Tue, 14 May 2019 10:00:48 +0200},
biburl = {https://dblp.org/rec/conf/stacs/Damaschke07.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 = {Tue, 14 May 2019 10:00:40 +0200},
biburl = {https://dblp.org/rec/conf/wg/Damaschke07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/Damaschke06,
author = {Peter Damaschke},
title = {Multiple Spin-Block Decisions},
journal = {Algorithmica},
volume = {44},
number = {1},
pages = {33--48},
year = {2006},
url = {https://doi.org/10.1007/s00453-005-1163-0},
doi = {10.1007/S00453-005-1163-0},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/Damaschke06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/Damaschke06,
author = {Peter Damaschke},
title = {Randomized vs. deterministic distance query strategies for point location
on the line},
journal = {Discret. Appl. Math.},
volume = {154},
number = {3},
pages = {478--484},
year = {2006},
url = {https://doi.org/10.1016/j.dam.2005.07.014},
doi = {10.1016/J.DAM.2005.07.014},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/Damaschke06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Damaschke06,
author = {Peter Damaschke},
title = {A remark on the subsequence problem for arc-annotated sequences with
pairwise nested arcs},
journal = {Inf. Process. Lett.},
volume = {100},
number = {2},
pages = {64--68},
year = {2006},
url = {https://doi.org/10.1016/j.ipl.2006.05.008},
doi = {10.1016/J.IPL.2006.05.008},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Damaschke06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jmlr/BergkvistDL06,
author = {Anders Bergkvist and
Peter Damaschke and
Marcel L{\"{u}}thi},
title = {Linear Programs for Hypotheses Selection in Probabilistic Inference
Models},
journal = {J. Mach. Learn. Res.},
volume = {7},
pages = {1339--1355},
year = {2006},
url = {http://jmlr.org/papers/v7/bergkvist06a.html},
timestamp = {Wed, 10 Jul 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jmlr/BergkvistDL06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/pr/BergkvistD06,
author = {Anders Bergkvist and
Peter Damaschke},
title = {Fast algorithms for finding disjoint subsequences with extremal densities},
journal = {Pattern Recognit.},
volume = {39},
number = {12},
pages = {2281--2292},
year = {2006},
url = {https://doi.org/10.1016/j.patcog.2006.01.008},
doi = {10.1016/J.PATCOG.2006.01.008},
timestamp = {Mon, 24 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/pr/BergkvistD06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/scheduling/Damaschke06,
author = {Peter Damaschke},
title = {Scheduling search procedures: The wheel of fortune},
journal = {J. Sched.},
volume = {9},
number = {6},
pages = {545--557},
year = {2006},
url = {https://doi.org/10.1007/s10951-006-8788-y},
doi = {10.1007/S10951-006-8788-Y},
timestamp = {Wed, 01 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/scheduling/Damaschke06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Damaschke06,
author = {Peter Damaschke},
title = {Parameterized enumeration, transversals, and imperfect phylogeny reconstruction},
journal = {Theor. Comput. Sci.},
volume = {351},
number = {3},
pages = {337--350},
year = {2006},
url = {https://doi.org/10.1016/j.tcs.2005.10.004},
doi = {10.1016/J.TCS.2005.10.004},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Damaschke06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/Damaschke06,
author = {Peter Damaschke},
editor = {Tiziana Calamoneri and
Irene Finocchi and
Giuseppe F. Italiano},
title = {Fixed-Parameter Tractable Generalizations of Cluster Editing},
booktitle = {Algorithms and Complexity, 6th Italian Conference, {CIAC} 2006, Rome,
Italy, May 29-31, 2006, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3998},
pages = {344--355},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11758471\_33},
doi = {10.1007/11758471\_33},
timestamp = {Tue, 14 May 2019 10:00:53 +0200},
biburl = {https://dblp.org/rec/conf/ciac/Damaschke06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/europar/DamaschkeHT06,
author = {Peter Damaschke and
Phuong Hoai Ha and
Philippas Tsigas},
editor = {Wolfgang E. Nagel and
Wolfgang V. Walter and
Wolfgang Lehner},
title = {Competitive Freshness Algorithms for Wait-Free Data Objects},
booktitle = {Euro-Par 2006, Parallel Processing, 12th International Euro-Par Conference,
Dresden, Germany, August 28 - September 1, 2006, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4128},
pages = {811--820},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11823285\_85},
doi = {10.1007/11823285\_85},
timestamp = {Mon, 15 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/europar/DamaschkeHT06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/gtitc/Damaschke06,
author = {Peter Damaschke},
editor = {Rudolf Ahlswede and
Lars B{\"{a}}umer and
Ning Cai and
Harout K. Aydinian and
Vladimir M. Blinovsky and
Christian Deppe and
Haik Mashurian},
title = {Threshold Group Testing},
booktitle = {General Theory of Information Transfer and Combinatorics},
series = {Lecture Notes in Computer Science},
volume = {4123},
pages = {707--718},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11889342\_45},
doi = {10.1007/11889342\_45},
timestamp = {Tue, 14 May 2019 10:00:39 +0200},
biburl = {https://dblp.org/rec/conf/gtitc/Damaschke06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/Damaschke05,
author = {Peter Damaschke},
title = {Threshold Group Testing},
journal = {Electron. Notes Discret. Math.},
volume = {21},
pages = {265--271},
year = {2005},
url = {https://doi.org/10.1016/j.endm.2005.07.040},
doi = {10.1016/J.ENDM.2005.07.040},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/endm/Damaschke05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijbra/CicaleseDV05,
author = {Ferdinando Cicalese and
Peter Damaschke and
Ugo Vaccaro},
title = {Optimal group testing algorithms with interval queries and their application
to splice site detection},
journal = {Int. J. Bioinform. Res. Appl.},
volume = {1},
number = {4},
pages = {363--388},
year = {2005},
url = {https://doi.org/10.1504/IJBRA.2005.008441},
doi = {10.1504/IJBRA.2005.008441},
timestamp = {Fri, 11 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ijbra/CicaleseDV05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/DamaschkeZ05,
author = {Peter Damaschke and
Zhen Zhou},
title = {On queuing lengths in on-line switching},
journal = {Theor. Comput. Sci.},
volume = {339},
number = {2-3},
pages = {333--343},
year = {2005},
url = {https://doi.org/10.1016/j.tcs.2005.03.025},
doi = {10.1016/J.TCS.2005.03.025},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/DamaschkeZ05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cocoon/CicaleseDTW05,
author = {Ferdinando Cicalese and
Peter Damaschke and
Libertad Tansini and
S{\"{o}}ren Werth},
editor = {Lusheng Wang},
title = {Overlaps Help: Improved Bounds for Group Testing with Interval Queries},
booktitle = {Computing and Combinatorics, 11th Annual International Conference,
{COCOON} 2005, Kunming, China, August 16-29, 2005, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3595},
pages = {935--944},
publisher = {Springer},
year = {2005},
url = {https://doi.org/10.1007/11533719\_94},
doi = {10.1007/11533719\_94},
timestamp = {Tue, 14 May 2019 10:00:35 +0200},
biburl = {https://dblp.org/rec/conf/cocoon/CicaleseDTW05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iccS/CicaleseDV05,
author = {Ferdinando Cicalese and
Peter Damaschke and
Ugo Vaccaro},
editor = {Vaidy S. Sunderam and
G. Dick van Albada and
Peter M. A. Sloot and
Jack J. Dongarra},
title = {Optimal Group Testing Strategies with Interval Queries and Their Application
to Splice Site Detection},
booktitle = {Computational Science - {ICCS} 2005, 5th International Conference,
Atlanta, GA, USA, May 22-25, 2005, Proceedings, Part {II}},
series = {Lecture Notes in Computer Science},
volume = {3515},
pages = {1029--1037},
publisher = {Springer},
year = {2005},
url = {https://doi.org/10.1007/11428848\_130},
doi = {10.1007/11428848\_130},
timestamp = {Tue, 14 May 2019 10:00:48 +0200},
biburl = {https://dblp.org/rec/conf/iccS/CicaleseDV05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/BergkvistD05,
author = {Anders Bergkvist and
Peter Damaschke},
editor = {Xiaotie Deng and
Ding{-}Zhu Du},
title = {Fast Algorithms for Finding Disjoint Subsequences with Extremal Densities},
booktitle = {Algorithms and Computation, 16th International Symposium, {ISAAC}
2005, Sanya, Hainan, China, December 19-21, 2005, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3827},
pages = {714--723},
publisher = {Springer},
year = {2005},
url = {https://doi.org/10.1007/11602613\_72},
doi = {10.1007/11602613\_72},
timestamp = {Tue, 14 May 2019 10:00:50 +0200},
biburl = {https://dblp.org/rec/conf/isaac/BergkvistD05.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 = {Tue, 14 May 2019 10:00:40 +0200},
biburl = {https://dblp.org/rec/conf/wg/Damaschke05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/Damaschke04,
author = {Peter Damaschke},
title = {Approximate location of relevant variables under the crossover distribution},
journal = {Discret. Appl. Math.},
volume = {137},
number = {1},
pages = {47--67},
year = {2004},
url = {https://doi.org/10.1016/S0166-218X(03)00188-4},
doi = {10.1016/S0166-218X(03)00188-4},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/Damaschke04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/scheduling/Damaschke04,
author = {Peter Damaschke},
title = {Scheduling Search Procedures},
journal = {J. Sched.},
volume = {7},
number = {5},
pages = {349--364},
year = {2004},
url = {https://doi.org/10.1023/B:JOSH.0000036859.97424.e5},
doi = {10.1023/B:JOSH.0000036859.97424.E5},
timestamp = {Wed, 01 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/scheduling/Damaschke04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwpec/Damaschke04,
author = {Peter Damaschke},
editor = {Rodney G. Downey and
Michael R. Fellows and
Frank K. H. A. Dehne},
title = {Parameterized Enumeration, Transversals, and Imperfect Phylogeny Reconstruction},
booktitle = {Parameterized and Exact Computation, First International Workshop,
{IWPEC} 2004, Bergen, Norway, September 14-17, 2004, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3162},
pages = {1--12},
publisher = {Springer},
year = {2004},
url = {https://doi.org/10.1007/978-3-540-28639-4\_1},
doi = {10.1007/978-3-540-28639-4\_1},
timestamp = {Tue, 14 May 2019 10:00:45 +0200},
biburl = {https://dblp.org/rec/conf/iwpec/Damaschke04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/Damaschke03,
author = {Peter Damaschke},
title = {Point placement on the line by distance data},
journal = {Discret. Appl. Math.},
volume = {127},
number = {1},
pages = {53--62},
year = {2003},
url = {https://doi.org/10.1016/S0166-218X(02)00284-6},
doi = {10.1016/S0166-218X(02)00284-6},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/Damaschke03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/AgnarssonDH03,
author = {Geir Agnarsson and
Peter Damaschke and
Magn{\'{u}}s M. Halld{\'{o}}rsson},
title = {Powers of geometric intersection graphs and dispersion algorithms},
journal = {Discret. Appl. Math.},
volume = {132},
number = {1-3},
pages = {3--16},
year = {2003},
url = {https://doi.org/10.1016/S0166-218X(03)00386-X},
doi = {10.1016/S0166-218X(03)00386-X},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/AgnarssonDH03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Damaschke03,
author = {Peter Damaschke},
title = {Linear-time recognition of bipartite graphs plus two edges},
journal = {Discret. Math.},
volume = {262},
number = {1-3},
pages = {99--112},
year = {2003},
url = {https://doi.org/10.1016/S0012-365X(02)00493-4},
doi = {10.1016/S0012-365X(02)00493-4},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Damaschke03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/Damaschke03,
author = {Peter Damaschke},
title = {On parallel attribute-efficient learning},
journal = {J. Comput. Syst. Sci.},
volume = {67},
number = {1},
pages = {46--62},
year = {2003},
url = {https://doi.org/10.1016/S0022-0000(03)00047-3},
doi = {10.1016/S0022-0000(03)00047-3},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/Damaschke03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Damaschke03,
author = {Peter Damaschke},
title = {Nearly optimal strategies for special cases of on-line capital investment},
journal = {Theor. Comput. Sci.},
volume = {302},
number = {1-3},
pages = {35--44},
year = {2003},
url = {https://doi.org/10.1016/S0304-3975(02)00727-2},
doi = {10.1016/S0304-3975(02)00727-2},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Damaschke03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fct/Damaschke03,
author = {Peter Damaschke},
editor = {Andrzej Lingas and
Bengt J. Nilsson},
title = {Fast Perfect Phylogeny Haplotype Inference},
booktitle = {Fundamentals of Computation Theory, 14th International Symposium,
{FCT} 2003, Malm{\"{o}}, Sweden, August 12-15, 2003, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2751},
pages = {183--194},
publisher = {Springer},
year = {2003},
url = {https://doi.org/10.1007/978-3-540-45077-1\_18},
doi = {10.1007/978-3-540-45077-1\_18},
timestamp = {Tue, 14 May 2019 10:00:53 +0200},
biburl = {https://dblp.org/rec/conf/fct/Damaschke03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/Damaschke03,
author = {Peter Damaschke},
editor = {Helmut Alt and
Michel Habib},
title = {Distributed Soft Path Coloring},
booktitle = {{STACS} 2003, 20th Annual Symposium on Theoretical Aspects of Computer
Science, Berlin, Germany, February 27 - March 1, 2003, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2607},
pages = {523--534},
publisher = {Springer},
year = {2003},
url = {https://doi.org/10.1007/3-540-36494-3\_46},
doi = {10.1007/3-540-36494-3\_46},
timestamp = {Thu, 14 Oct 2021 10:38:16 +0200},
biburl = {https://dblp.org/rec/conf/stacs/Damaschke03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Damaschke02,
author = {Peter Damaschke},
title = {Optimizing a mail-order with discount and shipping costs},
journal = {Inf. Process. Lett.},
volume = {82},
number = {2},
pages = {93--97},
year = {2002},
url = {https://doi.org/10.1016/S0020-0190(01)00248-4},
doi = {10.1016/S0020-0190(01)00248-4},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Damaschke02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Damaschke02,
author = {Peter Damaschke},
title = {Online strategies for backups},
journal = {Theor. Comput. Sci.},
volume = {285},
number = {1},
pages = {43--53},
year = {2002},
url = {https://doi.org/10.1016/S0304-3975(01)00289-4},
doi = {10.1016/S0304-3975(01)00289-4},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Damaschke02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Damaschke02a,
author = {Peter Damaschke},
title = {Two short notes on the on-line travelling salesman: handling times
and lookahead},
journal = {Theor. Comput. Sci.},
volume = {289},
number = {1},
pages = {845--852},
year = {2002},
url = {https://doi.org/10.1016/S0304-3975(01)00323-1},
doi = {10.1016/S0304-3975(01)00323-1},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Damaschke02a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/Damaschke02,
author = {Peter Damaschke},
editor = {Peter Widmayer and
Francisco Triguero Ruiz and
Rafael Morales Bueno and
Matthew Hennessy and
Stephan J. Eidenbenz and
Ricardo Conejo},
title = {Scheduling Search Procedures},
booktitle = {Automata, Languages and Programming, 29th International Colloquium,
{ICALP} 2002, Malaga, Spain, July 8-13, 2002, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2380},
pages = {281--292},
publisher = {Springer},
year = {2002},
url = {https://doi.org/10.1007/3-540-45465-9\_25},
doi = {10.1007/3-540-45465-9\_25},
timestamp = {Wed, 11 Sep 2019 13:15:53 +0200},
biburl = {https://dblp.org/rec/conf/icalp/Damaschke02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/AgnarssonDH02,
author = {Geir Agnarsson and
Peter Damaschke and
Magn{\'{u}}s M. Halld{\'{o}}rsson},
editor = {Martti Penttonen and
Erik Meineche Schmidt},
title = {Powers of Geometric Intersection Graphs and Dispersion Algorithms},
booktitle = {Algorithm Theory - {SWAT} 2002, 8th Scandinavian Workshop on Algorithm
Theory, Turku, Finland, July 3-5, 2002 Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2368},
pages = {140--149},
publisher = {Springer},
year = {2002},
url = {https://doi.org/10.1007/3-540-45471-3\_15},
doi = {10.1007/3-540-45471-3\_15},
timestamp = {Tue, 14 May 2019 10:00:39 +0200},
biburl = {https://dblp.org/rec/conf/swat/AgnarssonDH02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/Damaschke01,
author = {Peter Damaschke},
title = {Minus domination in small-degree graphs},
journal = {Discret. Appl. Math.},
volume = {108},
number = {1-2},
pages = {53--64},
year = {2001},
url = {https://doi.org/10.1016/S0166-218X(00)00219-5},
doi = {10.1016/S0166-218X(00)00219-5},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/Damaschke01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/saga/Damaschke01,
author = {Peter Damaschke},
editor = {Kathleen Steinh{\"{o}}fel},
title = {Approximate Location of Relevant Variables under the Crossover Distribution},
booktitle = {Stochastic Algorithms: Foundations and Applications, International
Symposium, {SAGA} 2001 Berlin, Germany, December 13-14, 2001, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2264},
pages = {189--202},
publisher = {Springer},
year = {2001},
url = {https://doi.org/10.1007/3-540-45322-9\_13},
doi = {10.1007/3-540-45322-9\_13},
timestamp = {Tue, 14 May 2019 10:00:40 +0200},
biburl = {https://dblp.org/rec/conf/saga/Damaschke01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sirocco/Damaschke01,
author = {Peter Damaschke},
editor = {Francesc Comellas and
Josep F{\`{a}}brega and
Pierre Fraigniaud},
title = {Worst-case bounds for blind broadcasting in small-degree networks},
booktitle = {{SIROCCO} 8, Proceedings of the 8th International Colloquium on Structural
Information and Communication Complexity, Vall de N{\'{u}}ria,
Girona-Barcelona, Catalonia, Spain, 27-29 June, 2001},
series = {Proceedings in Informatics},
volume = {8},
pages = {105--116},
publisher = {Carleton Scientific},
year = {2001},
timestamp = {Thu, 05 Feb 2004 10:15:17 +0100},
biburl = {https://dblp.org/rec/conf/sirocco/Damaschke01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Damaschke00,
author = {Peter Damaschke},
title = {Degree-preserving spanning trees in small-degree graphs},
journal = {Discret. Math.},
volume = {222},
number = {1-3},
pages = {51--60},
year = {2000},
url = {https://doi.org/10.1016/S0012-365X(00)00005-4},
doi = {10.1016/S0012-365X(00)00005-4},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Damaschke00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ml/Damaschke00,
author = {Peter Damaschke},
title = {Adaptive Versus Nonadaptive Attribute-Efficient Learning},
journal = {Mach. Learn.},
volume = {41},
number = {2},
pages = {197--215},
year = {2000},
url = {https://doi.org/10.1023/A:1007616604496},
doi = {10.1023/A:1007616604496},
timestamp = {Mon, 02 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ml/Damaschke00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/Damaschke00,
author = {Peter Damaschke},
editor = {Gian Carlo Bongiovanni and
Giorgio Gambosi and
Rossella Petreschi},
title = {Online Strategies for Backups},
booktitle = {Algorithms and Complexity, 4th Italian Conference, {CIAC} 2000, Rome,
Italy, March 2000, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1767},
pages = {63--71},
publisher = {Springer},
year = {2000},
url = {https://doi.org/10.1007/3-540-46521-9\_6},
doi = {10.1007/3-540-46521-9\_6},
timestamp = {Tue, 14 May 2019 10:00:53 +0200},
biburl = {https://dblp.org/rec/conf/ciac/Damaschke00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/Damaschke00,
author = {Peter Damaschke},
editor = {Magn{\'{u}}s M. Halld{\'{o}}rsson},
title = {Parallel Attribute-Efficient Learning of Monotone Boolean Functions},
booktitle = {Algorithm Theory - {SWAT} 2000, 7th Scandinavian Workshop on Algorithm
Theory, Bergen, Norway, July 5-7, 2000, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1851},
pages = {504--512},
publisher = {Springer},
year = {2000},
url = {https://doi.org/10.1007/3-540-44985-X\_42},
doi = {10.1007/3-540-44985-X\_42},
timestamp = {Fri, 27 Mar 2020 08:50:36 +0100},
biburl = {https://dblp.org/rec/conf/swat/Damaschke00.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 = {Tue, 14 May 2019 10:00:40 +0200},
biburl = {https://dblp.org/rec/conf/wg/Damaschke00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/Damaschke99,
author = {Peter Damaschke},
editor = {Alok Aggarwal and
C. Pandu Rangan},
title = {Multiple Spin-Block Decisions},
booktitle = {Algorithms and Computation, 10th International Symposium, {ISAAC}
'99, Chennai, India, December 16-18, 1999, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1741},
pages = {27--36},
publisher = {Springer},
year = {1999},
url = {https://doi.org/10.1007/3-540-46632-0\_4},
doi = {10.1007/3-540-46632-0\_4},
timestamp = {Tue, 14 May 2019 10:00:50 +0200},
biburl = {https://dblp.org/rec/conf/isaac/Damaschke99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Damaschke98,
author = {Peter Damaschke},
title = {Randomized Group Testing for Mutually Obscuring Defectives},
journal = {Inf. Process. Lett.},
volume = {67},
number = {3},
pages = {131--135},
year = {1998},
url = {https://doi.org/10.1016/S0020-0190(98)00096-9},
doi = {10.1016/S0020-0190(98)00096-9},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Damaschke98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/alt/Damaschke98,
author = {Peter Damaschke},
editor = {Michael M. Richter and
Carl H. Smith and
Rolf Wiehagen and
Thomas Zeugmann},
title = {Computational Aspects of Parallel Attribute-Efficient Learning},
booktitle = {Algorithmic Learning Theory, 9th International Conference, {ALT} '98,
Otzenhausen, Germany, October 8-10, 1998, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1501},
pages = {103--111},
publisher = {Springer},
year = {1998},
url = {https://doi.org/10.1007/3-540-49730-7\_8},
doi = {10.1007/3-540-49730-7\_8},
timestamp = {Tue, 14 May 2019 10:00:51 +0200},
biburl = {https://dblp.org/rec/conf/alt/Damaschke98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cats/AlbersD98,
author = {Frank Albers and
Peter Damaschke},
editor = {Xuemin Lin},
title = {Delayed Correction - Binary Search with Errors Made Very Simple but
Efficient},
booktitle = {Proceedings of Computing: The Fourth Australasian Theory Symposium
(CATS'98), Perth, WA, Australia, February 2-3, 1998},
series = {Australian Computer Science Communications},
volume = {20},
number = {3},
pages = {97--106},
publisher = {Springer-Verlag Singapore Pte. Ltd.},
year = {1998},
timestamp = {Mon, 16 Mar 2020 17:44:09 +0100},
biburl = {https://dblp.org/rec/conf/cats/AlbersD98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/latin/Damaschke98,
author = {Peter Damaschke},
editor = {Claudio L. Lucchesi and
Arnaldo V. Moura},
title = {A Chip Search Problem on Binary Numbers},
booktitle = {{LATIN} '98: Theoretical Informatics, Third Latin American Symposium,
Campinas, Brazil, April, 20-24, 1998, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1380},
pages = {11--22},
publisher = {Springer},
year = {1998},
url = {https://doi.org/10.1007/BFb0054306},
doi = {10.1007/BFB0054306},
timestamp = {Tue, 14 May 2019 10:00:53 +0200},
biburl = {https://dblp.org/rec/conf/latin/Damaschke98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Damaschke98,
author = {Peter Damaschke},
editor = {Jeffrey Scott Vitter},
title = {Adaptive versus Nonadaptive Attribute-Efficient Learning},
booktitle = {Proceedings of the Thirtieth Annual {ACM} Symposium on the Theory
of Computing, Dallas, Texas, USA, May 23-26, 1998},
pages = {590--596},
publisher = {{ACM}},
year = {1998},
url = {https://doi.org/10.1145/276698.276874},
doi = {10.1145/276698.276874},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/Damaschke98.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, 14 May 2019 10:00:40 +0200},
biburl = {https://dblp.org/rec/conf/wg/Damaschke98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Damaschke97,
author = {Peter Damaschke},
title = {An Optimal Parallel Algorithm for Digital Curve Segmentation},
journal = {Theor. Comput. Sci.},
volume = {178},
number = {1-2},
pages = {225--236},
year = {1997},
url = {https://doi.org/10.1016/S0304-3975(96)00227-7},
doi = {10.1016/S0304-3975(96)00227-7},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Damaschke97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/Damaschke97,
author = {Peter Damaschke},
editor = {Gian Carlo Bongiovanni and
Daniel P. Bovet and
Giuseppe Di Battista},
title = {The Algorithmic Complexity of Chemical Threshold Testing},
booktitle = {Algorithms and Complexity, Third Italian Conference, {CIAC} '97, Rome,
Italy, March 12-14, 1997, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1203},
pages = {205--216},
publisher = {Springer},
year = {1997},
url = {https://doi.org/10.1007/3-540-62592-5\_73},
doi = {10.1007/3-540-62592-5\_73},
timestamp = {Tue, 14 May 2019 10:00:53 +0200},
biburl = {https://dblp.org/rec/conf/ciac/Damaschke97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/europar/Damaschke97,
author = {Peter Damaschke},
editor = {Christian Lengauer and
Martin Griebl and
Sergei Gorlatch},
title = {Finding a Pair on a Mesh with Multiple Broadcasting is Hard},
booktitle = {Euro-Par '97 Parallel Processing, Third International Euro-Par Conference,
Passau, Germany, August 26-29, 1997, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1300},
pages = {266--271},
publisher = {Springer},
year = {1997},
url = {https://doi.org/10.1007/BFb0002743},
doi = {10.1007/BFB0002743},
timestamp = {Tue, 14 May 2019 10:00:46 +0200},
biburl = {https://dblp.org/rec/conf/europar/Damaschke97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ipps/Damaschke96,
author = {Peter Damaschke},
title = {Coping with Sparse Inputs on Enhanced Meshes - Semigroup Computation
with {COMMON} {CRCW} Buses},
booktitle = {Proceedings of {IPPS} '96, The 10th International Parallel Processing
Symposium, April 15-19, 1996, Honolulu, Hawaii, {USA}},
pages = {682--686},
publisher = {{IEEE} Computer Society},
year = {1996},
url = {https://doi.org/10.1109/IPPS.1996.508131},
doi = {10.1109/IPPS.1996.508131},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/ipps/Damaschke96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Damaschke95,
author = {Peter Damaschke},
title = {A Parallel Algorithm for Nearly Optimal Edge Search},
journal = {Inf. Process. Lett.},
volume = {56},
number = {4},
pages = {233--236},
year = {1995},
url = {https://doi.org/10.1016/0020-0190(95)00139-4},
doi = {10.1016/0020-0190(95)00139-4},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Damaschke95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/prl/Damaschke95,
author = {Peter Damaschke},
title = {The linear time recognition of digital arcs},
journal = {Pattern Recognit. Lett.},
volume = {16},
number = {5},
pages = {543--548},
year = {1995},
url = {https://doi.org/10.1016/0167-8655(95)00127-3},
doi = {10.1016/0167-8655(95)00127-3},
timestamp = {Sat, 22 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/prl/Damaschke95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/Damaschke95,
author = {Peter Damaschke},
editor = {Paul G. Spirakis},
title = {An Optimal Parallel Algorithm for Digital Curve Segmentation Using
Hough Polygons and Monotone Function Search},
booktitle = {Algorithms - {ESA} '95, Third Annual European Symposium, Corfu, Greece,
September 25-27, 1995, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {979},
pages = {570--581},
publisher = {Springer},
year = {1995},
url = {https://doi.org/10.1007/3-540-60313-1\_171},
doi = {10.1007/3-540-60313-1\_171},
timestamp = {Tue, 14 May 2019 10:00:54 +0200},
biburl = {https://dblp.org/rec/conf/esa/Damaschke95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/Damaschke95,
author = {Peter Damaschke},
editor = {John Staples and
Peter Eades and
Naoki Katoh and
Alistair Moffat},
title = {Searching for a Monotone Function by Independent Threshold Queries},
booktitle = {Algorithms and Computation, 6th International Symposium, {ISAAC} '95,
Cairns, Australia, December 4-6, 1995, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1004},
pages = {284--290},
publisher = {Springer},
year = {1995},
url = {https://doi.org/10.1007/BFb0015433},
doi = {10.1007/BFB0015433},
timestamp = {Tue, 14 May 2019 10:00:50 +0200},
biburl = {https://dblp.org/rec/conf/isaac/Damaschke95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/Damaschke95,
author = {Peter Damaschke},
editor = {Ernst W. Mayr and
Claude Puech},
title = {Line Segmentation of Digital Curves in Parallel},
booktitle = {{STACS} 95, 12th Annual Symposium on Theoretical Aspects of Computer
Science, Munich, Germany, March 2-4, 1995, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {900},
pages = {539--549},
publisher = {Springer},
year = {1995},
url = {https://doi.org/10.1007/3-540-59042-0\_103},
doi = {10.1007/3-540-59042-0\_103},
timestamp = {Sat, 07 Sep 2019 11:59:26 +0200},
biburl = {https://dblp.org/rec/conf/stacs/Damaschke95.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 = {Thu, 14 Oct 2021 10:32:32 +0200},
biburl = {https://dblp.org/rec/conf/wg/Damaschke95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@phdthesis{DBLP:books/daglib/0083570,
author = {Peter Damaschke},
title = {Berechnungskomplexit{\"{a}}t der Erkennung der semantischen Unabh{\"{a}}ngigkeit
von Relationen},
school = {FernUniv. Hagen},
year = {1994},
timestamp = {Wed, 23 Mar 2011 00:00:00 +0100},
biburl = {https://dblp.org/rec/books/daglib/0083570.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/Damaschke94,
author = {Peter Damaschke},
title = {A Tight Upper Bound for Group Testing in Graphs},
journal = {Discret. Appl. Math.},
volume = {48},
number = {2},
pages = {101--109},
year = {1994},
url = {https://doi.org/10.1016/0166-218X(92)00120-B},
doi = {10.1016/0166-218X(92)00120-B},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/Damaschke94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/Damaschke94a,
author = {Peter Damaschke},
title = {{PLA} Folding in Special Graph Classes},
journal = {Discret. Appl. Math.},
volume = {51},
number = {1-2},
pages = {63--74},
year = {1994},
url = {https://doi.org/10.1016/0166-218X(94)90094-9},
doi = {10.1016/0166-218X(94)90094-9},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/Damaschke94a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/DahlhausD94,
author = {Elias Dahlhaus and
Peter Damaschke},
title = {The Parallel Solution of Domination Problems on Chordal and Strongly
Chordal Graphs},
journal = {Discret. Appl. Math.},
volume = {52},
number = {3},
pages = {261--273},
year = {1994},
url = {https://doi.org/10.1016/0166-218X(94)90145-7},
doi = {10.1016/0166-218X(94)90145-7},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/DahlhausD94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/KratschDL94,
author = {Dieter Kratsch and
Peter Damaschke and
Anna Lubiw},
title = {Dominating cliques in chordal graphs},
journal = {Discret. Math.},
volume = {128},
number = {1-3},
pages = {269--275},
year = {1994},
url = {https://doi.org/10.1016/0012-365X(94)90118-X},
doi = {10.1016/0012-365X(94)90118-X},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/KratschDL94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Damaschke93,
author = {Peter Damaschke},
title = {Paths in interval graphs and circular arc graphs},
journal = {Discret. Math.},
volume = {112},
number = {1-3},
pages = {49--64},
year = {1993},
url = {https://doi.org/10.1016/0012-365X(93)90223-G},
doi = {10.1016/0012-365X(93)90223-G},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Damaschke93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/Damaschke92,
author = {Peter Damaschke},
title = {Distances in cocomparability graphs and their powers},
journal = {Discret. Appl. Math.},
volume = {35},
number = {1},
pages = {67--72},
year = {1992},
url = {https://doi.org/10.1016/0166-218X(92)90296-M},
doi = {10.1016/0166-218X(92)90296-M},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/Damaschke92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Damaschke91,
author = {Peter Damaschke},
title = {Irredundance number versus domination number},
journal = {Discret. Math.},
volume = {89},
number = {1},
pages = {101--104},
year = {1991},
url = {https://doi.org/10.1016/0012-365X(91)90403-O},
doi = {10.1016/0012-365X(91)90403-O},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Damaschke91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/Damaschke91,
author = {Peter Damaschke},
editor = {Gunther Schmidt and
Rudolf Berghammer},
title = {Logic Arrays for Interval Indicator Functions},
booktitle = {17th International Workshop, {WG} '91, Fischbachau, Germany, June
17-19, 1991, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {570},
pages = {219--225},
publisher = {Springer},
year = {1991},
url = {https://doi.org/10.1007/3-540-55121-2\_22},
doi = {10.1007/3-540-55121-2\_22},
timestamp = {Sun, 02 Oct 2022 16:17:33 +0200},
biburl = {https://dblp.org/rec/conf/wg/Damaschke91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/DamaschkeMK90,
author = {Peter Damaschke and
Haiko M{\"{u}}ller and
Dieter Kratsch},
title = {Domination in Convex and Chordal Bipartite Graphs},
journal = {Inf. Process. Lett.},
volume = {36},
number = {5},
pages = {231--236},
year = {1990},
url = {https://doi.org/10.1016/0020-0190(90)90147-P},
doi = {10.1016/0020-0190(90)90147-P},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/DamaschkeMK90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/Damaschke90,
author = {Peter Damaschke},
title = {Induced subgraphs and well-quasi-ordering},
journal = {J. Graph Theory},
volume = {14},
number = {4},
pages = {427--435},
year = {1990},
url = {https://doi.org/10.1002/jgt.3190140406},
doi = {10.1002/JGT.3190140406},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/Damaschke90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/Damaschke90,
author = {Peter Damaschke},
editor = {Rolf H. M{\"{o}}hring},
title = {Induced Subgraph Isomorphism for Cographs in NP-Complete},
booktitle = {Graph-Theoretic Concepts in Computer Science, 16rd International Workshop,
{WG} '90, Berlin, Germany, June 20-22, 1990, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {484},
pages = {72--78},
publisher = {Springer},
year = {1990},
url = {https://doi.org/10.1007/3-540-53832-1\_32},
doi = {10.1007/3-540-53832-1\_32},
timestamp = {Fri, 17 Jul 2020 16:12:47 +0200},
biburl = {https://dblp.org/rec/conf/wg/Damaschke90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Damaschke89,
author = {Peter Damaschke},
title = {The Hamiltonian Circuit Problem for Circle Graphs is NP-Complete},
journal = {Inf. Process. Lett.},
volume = {32},
number = {1},
pages = {1--2},
year = {1989},
url = {https://doi.org/10.1016/0020-0190(89)90059-8},
doi = {10.1016/0020-0190(89)90059-8},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Damaschke89.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.
last updated on 2024-02-01 20:25 CET 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:
