default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBibTeX records: Christian Rosenke
@article{DBLP:journals/jgaa/LeR24,
author = {Van Bang Le and
Christian Rosenke},
title = {Computing Optimal Leaf Roots of Chordal Cographs in Linear Time},
journal = {J. Graph Algorithms Appl.},
volume = {28},
number = {1},
pages = {243--274},
year = {2024},
url = {https://doi.org/10.7155/jgaa.v28i1.2942},
doi = {10.7155/JGAA.V28I1.2942},
timestamp = {Wed, 26 Jun 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgaa/LeR24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fct/LeR23,
author = {Van Bang Le and
Christian Rosenke},
editor = {Henning Fernau and
Klaus Jansen},
title = {Computing Optimal Leaf Roots of Chordal Cographs in Linear Time},
booktitle = {Fundamentals of Computation Theory - 24th International Symposium,
{FCT} 2023, Trier, Germany, September 18-21, 2023, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {14292},
pages = {348--362},
publisher = {Springer},
year = {2023},
url = {https://doi.org/10.1007/978-3-031-43587-4\_25},
doi = {10.1007/978-3-031-43587-4\_25},
timestamp = {Fri, 27 Oct 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/fct/LeR23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2308-10756,
author = {Van Bang Le and
Christian Rosenke},
title = {Computing Optimal Leaf Roots of Chordal Cographs in Linear Time},
journal = {CoRR},
volume = {abs/2308.10756},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2308.10756},
doi = {10.48550/ARXIV.2308.10756},
eprinttype = {arXiv},
eprint = {2308.10756},
timestamp = {Fri, 25 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2308-10756.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iandc/RosenkeL20,
author = {Christian Rosenke and
Maciej Liskiewicz},
title = {The generic combinatorial algorithm for image matching with classes
of projective transformations},
journal = {Inf. Comput.},
volume = {275},
pages = {104550},
year = {2020},
url = {https://doi.org/10.1016/j.ic.2020.104550},
doi = {10.1016/J.IC.2020.104550},
timestamp = {Tue, 15 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/iandc/RosenkeL20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/RosenkeT20,
author = {Christian Rosenke and
Ronny Tredup},
title = {The complexity of synthesizing elementary net systems relative to
natural parameters},
journal = {J. Comput. Syst. Sci.},
volume = {110},
pages = {37--54},
year = {2020},
url = {https://doi.org/10.1016/j.jcss.2019.12.007},
doi = {10.1016/J.JCSS.2019.12.007},
timestamp = {Fri, 21 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/RosenkeT20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/apn/LiebkeR20,
author = {Torsten Liebke and
Christian Rosenke},
editor = {Michael K{\"{o}}hler{-}Bu{\ss}meier and
Ekkart Kindler and
Heiko R{\"{o}}lke},
title = {Faster Enabledness-Updates for the Reachability Graph Computation},
booktitle = {Proceedings of the International Workshop on Petri Nets and Software
Engineering co-located with 41st International Conference on Application
and Theory of Petri Nets and Concurrency {(PETRI} {NETS} 2020), Paris,
France, June 24, 2020 (due to {COVID-19:} virtual conference)},
series = {{CEUR} Workshop Proceedings},
volume = {2651},
pages = {108--117},
publisher = {CEUR-WS.org},
year = {2020},
url = {https://ceur-ws.org/Vol-2651/paper7.pdf},
timestamp = {Fri, 10 Mar 2023 16:22:38 +0100},
biburl = {https://dblp.org/rec/conf/apn/LiebkeR20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/apn/TredupR19,
author = {Ronny Tredup and
Christian Rosenke},
editor = {Wil M. P. van der Aalst and
Robin Bergenthum and
Josep Carmona},
title = {On the Hardness of Synthesizing Boolean Nets},
booktitle = {Proceedings of the International Workshop on Algorithms {\&} Theories
for the Analysis of Event Data 2019 Satellite event of the conferences:
40th International Conference on Application and Theory of Petri Nets
and Concurrency Petri Nets 2019 and 19th International Conference
on Application of Concurrency to System Design {ACSD} 2019, ATAED@Petri
Nets/ACSD 2019, Aachen, Germany, June 25, 2019},
series = {{CEUR} Workshop Proceedings},
volume = {2371},
pages = {71--86},
publisher = {CEUR-WS.org},
year = {2019},
url = {https://ceur-ws.org/Vol-2371/ATAED2019-71-86.pdf},
timestamp = {Fri, 10 Mar 2023 16:22:38 +0100},
biburl = {https://dblp.org/rec/conf/apn/TredupR19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/tamc/TredupR19,
author = {Ronny Tredup and
Christian Rosenke},
editor = {T. V. Gopal and
Junzo Watada},
title = {The Complexity of Synthesis for 43 Boolean Petri Net Types},
booktitle = {Theory and Applications of Models of Computation - 15th Annual Conference,
{TAMC} 2019, Kitakyushu, Japan, April 13-16, 2019, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {11436},
pages = {615--634},
publisher = {Springer},
year = {2019},
url = {https://doi.org/10.1007/978-3-030-14812-6\_38},
doi = {10.1007/978-3-030-14812-6\_38},
timestamp = {Tue, 14 May 2019 10:00:46 +0200},
biburl = {https://dblp.org/rec/conf/tamc/TredupR19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/biodb/LambuschWWSRH18,
author = {Fabienne Lambusch and
Dagmar Waltemath and
Olaf Wolkenhauer and
Kurt Sandkuhl and
Christian Rosenke and
Ron Henkel},
title = {Identifying frequent patterns in biochemical reaction networks: a
workflow},
journal = {Database J. Biol. Databases Curation},
volume = {2018},
pages = {bay051},
year = {2018},
url = {https://doi.org/10.1093/database/bay051},
doi = {10.1093/DATABASE/BAY051},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/biodb/LambuschWWSRH18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/apn/TredupRW18,
author = {Ronny Tredup and
Christian Rosenke and
Karsten Wolf},
editor = {Victor Khomenko and
Olivier H. Roux},
title = {Elementary Net Synthesis Remains NP-Complete Even for Extremely Simple
Inputs},
booktitle = {Application and Theory of Petri Nets and Concurrency - 39th International
Conference, {PETRI} {NETS} 2018, Bratislava, Slovakia, June 24-29,
2018, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {10877},
pages = {40--59},
publisher = {Springer},
year = {2018},
url = {https://doi.org/10.1007/978-3-319-91268-4\_3},
doi = {10.1007/978-3-319-91268-4\_3},
timestamp = {Tue, 14 May 2019 10:00:45 +0200},
biburl = {https://dblp.org/rec/conf/apn/TredupRW18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/concur/TredupR18,
author = {Ronny Tredup and
Christian Rosenke},
editor = {Sven Schewe and
Lijun Zhang},
title = {Narrowing down the Hardness Barrier of Synthesizing Elementary Net
Systems},
booktitle = {29th International Conference on Concurrency Theory, {CONCUR} 2018,
September 4-7, 2018, Beijing, China},
series = {LIPIcs},
volume = {118},
pages = {16:1--16:15},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2018},
url = {https://doi.org/10.4230/LIPIcs.CONCUR.2018.16},
doi = {10.4230/LIPICS.CONCUR.2018.16},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/concur/TredupR18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1806-03703,
author = {Ronny Tredup and
Christian Rosenke},
title = {Towards Completely Characterizing the Complexity of Boolean Nets Synthesis},
journal = {CoRR},
volume = {abs/1806.03703},
year = {2018},
url = {http://arxiv.org/abs/1806.03703},
eprinttype = {arXiv},
eprint = {1806.03703},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1806-03703.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/peerjpre/LambuschWWSRH18,
author = {Fabienne Lambusch and
Dagmar Waltemath and
Olaf Wolkenhauer and
Kurt Sandkuhl and
Christian Rosenke and
Ron Henkel},
title = {Identifying frequent patterns in biochemical reaction networks - a
workflow},
journal = {PeerJ Prepr.},
volume = {6},
pages = {e1479},
year = {2018},
url = {https://doi.org/10.7287/peerj.preprints.1479v4},
doi = {10.7287/PEERJ.PREPRINTS.1479V4},
timestamp = {Thu, 09 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/peerjpre/LambuschWWSRH18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1711-00220,
author = {Christian Rosenke and
Ronny Tredup},
title = {The Hardness of Synthesizing Elementary Net Systems from Highly Restricted
Inputs},
journal = {CoRR},
volume = {abs/1711.00220},
year = {2017},
url = {http://arxiv.org/abs/1711.00220},
eprinttype = {arXiv},
eprint = {1711.00220},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1711-00220.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/peerjpre/LambuschWWSRH17,
author = {Fabienne Lambusch and
Dagmar Waltemath and
Olaf Wolkenhauer and
Kurt Sandkuhl and
Christian Rosenke and
Ron Henkel},
title = {Identifying frequent patterns in biochemical reaction networks - a
workflow},
journal = {PeerJ Prepr.},
volume = {5},
pages = {e1479},
year = {2017},
url = {https://doi.org/10.7287/peerj.preprints.1479v3},
doi = {10.7287/PEERJ.PREPRINTS.1479V3},
timestamp = {Thu, 09 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/peerjpre/LambuschWWSRH17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/gc/NevriesR16,
author = {Ragnar Nevries and
Christian Rosenke},
title = {Towards a Characterization of Leaf Powers by Clique Arrangements},
journal = {Graphs Comb.},
volume = {32},
number = {5},
pages = {2053--2077},
year = {2016},
url = {https://doi.org/10.1007/s00373-016-1707-x},
doi = {10.1007/S00373-016-1707-X},
timestamp = {Thu, 04 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/gc/NevriesR16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/Rosenke16,
author = {Christian Rosenke},
title = {The exact complexity of projective image matching},
journal = {J. Comput. Syst. Sci.},
volume = {82},
number = {8},
pages = {1360--1387},
year = {2016},
url = {https://doi.org/10.1016/j.jcss.2016.06.002},
doi = {10.1016/J.JCSS.2016.06.002},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/Rosenke16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/peerjpre/HenkelLWSRW16,
author = {Ron Henkel and
Fabienne Lambusch and
Olaf Wolkenhauer and
Kurt Sandkuhl and
Christian Rosenke and
Dagmar Waltemath},
title = {Finding patterns in biochemical reaction networks},
journal = {PeerJ Prepr.},
volume = {4},
pages = {e1479},
year = {2016},
url = {https://doi.org/10.7287/peerj.preprints.1479v2},
doi = {10.7287/PEERJ.PREPRINTS.1479V2},
timestamp = {Thu, 09 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/peerjpre/HenkelLWSRW16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/NevriesR15,
author = {Ragnar Nevries and
Christian Rosenke},
title = {Characterizing and computing the structure of clique intersections
in strongly chordal graphs},
journal = {Discret. Appl. Math.},
volume = {181},
pages = {221--234},
year = {2015},
url = {https://doi.org/10.1016/j.dam.2014.09.003},
doi = {10.1016/J.DAM.2014.09.003},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/NevriesR15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sofsem/NevriesR15,
author = {Ragnar Nevries and
Christian Rosenke},
editor = {Giuseppe F. Italiano and
Tiziana Margaria{-}Steffen and
Jaroslav Pokorn{\'{y}} and
Jean{-}Jacques Quisquater and
Roger Wattenhofer},
title = {Towards a Characterization of Leaf Powers by Clique Arrangements},
booktitle = {{SOFSEM} 2015: Theory and Practice of Computer Science - 41st International
Conference on Current Trends in Theory and Practice of Computer Science,
Pec pod Sn{\v{e}}{\v{z}}kou, Czech Republic, January 24-29, 2015.
Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8939},
pages = {364--376},
publisher = {Springer},
year = {2015},
url = {https://doi.org/10.1007/978-3-662-46078-8\_30},
doi = {10.1007/978-3-662-46078-8\_30},
timestamp = {Sun, 02 Jun 2019 21:12:07 +0200},
biburl = {https://dblp.org/rec/conf/sofsem/NevriesR15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat4ls/RosenkeW14,
author = {Christian Rosenke and
Dagmar Waltemath},
editor = {Adrian Paschke and
Albert Burger and
Paolo Romano and
M. Scott Marshall and
Andrea Splendiani},
title = {How Can Semantic Annotations Support the Identification of Network
Similarities?},
booktitle = {Proceedings of the 7th International Workshop on Semantic Web Applications
and Tools for Life Sciences, Berlin, Germany, December 9-11, 2014},
series = {{CEUR} Workshop Proceedings},
volume = {1320},
publisher = {CEUR-WS.org},
year = {2014},
url = {https://ceur-ws.org/Vol-1320/paper\_37.pdf},
timestamp = {Fri, 10 Mar 2023 16:23:02 +0100},
biburl = {https://dblp.org/rec/conf/swat4ls/RosenkeW14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/NevriesR14,
author = {Ragnar Nevries and
Christian Rosenke},
title = {Towards a Characterization of Leaf Powers by Clique Arrangements},
journal = {CoRR},
volume = {abs/1402.1425},
year = {2014},
url = {http://arxiv.org/abs/1402.1425},
eprinttype = {arXiv},
eprint = {1402.1425},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/NevriesR14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/NevriesR13,
author = {Ragnar Nevries and
Christian Rosenke},
editor = {Andreas Brandst{\"{a}}dt and
Klaus Jansen and
R{\"{u}}diger Reischuk},
title = {Characterizing and Computing the Structure of Clique Intersections
in Strongly Chordal Graphs},
booktitle = {Graph-Theoretic Concepts in Computer Science - 39th International
Workshop, {WG} 2013, L{\"{u}}beck, Germany, June 19-21, 2013,
Revised Papers},
series = {Lecture Notes in Computer Science},
volume = {8165},
pages = {382--393},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-642-45043-3\_33},
doi = {10.1007/978-3-642-45043-3\_33},
timestamp = {Tue, 14 May 2019 10:00:40 +0200},
biburl = {https://dblp.org/rec/conf/wg/NevriesR13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@phdthesis{DBLP:phd/dnb/Hundt12,
author = {Christian Hundt},
title = {On the computational complexity of projective image matching},
school = {University of L{\"{u}}beck},
year = {2012},
url = {http://www.students.informatik.uni-luebeck.de/zhb/ediss1057.pdf},
urn = {urn:nbn:de:gbv:841-2012022878},
timestamp = {Sat, 17 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/phd/dnb/Hundt12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cpm/HundtW12,
author = {Christian Hundt and
Florian Wendland},
editor = {Juha K{\"{a}}rkk{\"{a}}inen and
Jens Stoye},
title = {Efficient Two-Dimensional Pattern Matching with Scaling and Rotation
and Higher-Order Interpolation},
booktitle = {Combinatorial Pattern Matching - 23rd Annual Symposium, {CPM} 2012,
Helsinki, Finland, July 3-5, 2012. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7354},
pages = {124--137},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-31265-6\_10},
doi = {10.1007/978-3-642-31265-6\_10},
timestamp = {Sun, 06 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/cpm/HundtW12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/HundtL11,
author = {Christian Hundt and
Maciej Liskiewicz},
title = {New complexity bounds for image matching under rotation and scaling},
journal = {J. Discrete Algorithms},
volume = {9},
number = {1},
pages = {122--136},
year = {2011},
url = {https://doi.org/10.1016/j.jda.2010.06.002},
doi = {10.1016/J.JDA.2010.06.002},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/HundtL11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/BrandstadtHMW10,
author = {Andreas Brandst{\"{a}}dt and
Christian Hundt and
Federico Mancini and
Peter Wagner},
title = {Rooted directed path graphs are leaf powers},
journal = {Discret. Math.},
volume = {310},
number = {4},
pages = {897--910},
year = {2010},
url = {https://doi.org/10.1016/j.disc.2009.10.006},
doi = {10.1016/J.DISC.2009.10.006},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/BrandstadtHMW10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cpm/Hundt10,
author = {Christian Hundt},
editor = {Amihood Amir and
Laxmi Parida},
title = {Affine Image Matching Is Uniform TC\({}^{\mbox{0}}\)-Complete},
booktitle = {Combinatorial Pattern Matching, 21st Annual Symposium, {CPM} 2010,
New York, NY, USA, June 21-23, 2010. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6129},
pages = {13--25},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-13509-5\_2},
doi = {10.1007/978-3-642-13509-5\_2},
timestamp = {Tue, 14 May 2019 10:00:38 +0200},
biburl = {https://dblp.org/rec/conf/cpm/Hundt10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/latin/BrandstadtHN10,
author = {Andreas Brandst{\"{a}}dt and
Christian Hundt and
Ragnar Nevries},
editor = {Alejandro L{\'{o}}pez{-}Ortiz},
title = {Efficient Edge Domination on Hole-Free Graphs in Polynomial Time},
booktitle = {{LATIN} 2010: Theoretical Informatics, 9th Latin American Symposium,
Oaxaca, Mexico, April 19-23, 2010. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6034},
pages = {650--661},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-12200-2\_56},
doi = {10.1007/978-3-642-12200-2\_56},
timestamp = {Tue, 14 May 2019 10:00:53 +0200},
biburl = {https://dblp.org/rec/conf/latin/BrandstadtHN10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/HundtLN09,
author = {Christian Hundt and
Maciej Liskiewicz and
Ragnar Nevries},
title = {A combinatorial geometrical approach to two-dimensional robust pattern
matching with scaling and rotation},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {51},
pages = {5317--5333},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.09.009},
doi = {10.1016/J.TCS.2009.09.009},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/HundtLN09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cpm/HundtL09,
author = {Christian Hundt and
Maciej Liskiewicz},
editor = {Gregory Kucherov and
Esko Ukkonen},
title = {New Complexity Bounds for Image Matching under Rotation and Scaling},
booktitle = {Combinatorial Pattern Matching, 20th Annual Symposium, {CPM} 2009,
Lille, France, June 22-24, 2009, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5577},
pages = {127--141},
publisher = {Springer},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-02441-2\_12},
doi = {10.1007/978-3-642-02441-2\_12},
timestamp = {Tue, 14 May 2019 10:00:38 +0200},
biburl = {https://dblp.org/rec/conf/cpm/HundtL09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cocoa/FanHWE08,
author = {Hongbing Fan and
Christian Hundt and
Yu{-}Liang Wu and
Jason Ernst},
editor = {Boting Yang and
Ding{-}Zhu Du and
Cao An Wang},
title = {Algorithms and Implementation for Interconnection Graph Problem},
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 = {201--210},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-85097-7\_19},
doi = {10.1007/978-3-540-85097-7\_19},
timestamp = {Tue, 14 May 2019 10:00:52 +0200},
biburl = {https://dblp.org/rec/conf/cocoa/FanHWE08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cocoon/HundtO08,
author = {Christian Hundt and
Ulf Ochsenfahrt},
editor = {Xiaodong Hu and
Jie Wang},
title = {Damaged BZip Files Are Difficult to Repair},
booktitle = {Computing and Combinatorics, 14th Annual International Conference,
{COCOON} 2008, Dalian, China, June 27-29, 2008, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5092},
pages = {12--21},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-69733-6\_2},
doi = {10.1007/978-3-540-69733-6\_2},
timestamp = {Tue, 10 Dec 2019 14:59:33 +0100},
biburl = {https://dblp.org/rec/conf/cocoon/HundtO08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cpm/HundtL08,
author = {Christian Hundt and
Maciej Liskiewicz},
editor = {Paolo Ferragina and
Gad M. Landau},
title = {Two-Dimensional Pattern Matching with Combined Scaling and Rotation},
booktitle = {Combinatorial Pattern Matching, 19th Annual Symposium, {CPM} 2008,
Pisa, Italy, June 18-20, 2008, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5029},
pages = {5--17},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-69068-9\_4},
doi = {10.1007/978-3-540-69068-9\_4},
timestamp = {Tue, 14 May 2019 10:00:38 +0200},
biburl = {https://dblp.org/rec/conf/cpm/HundtL08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/latin/BrandstadtH08,
author = {Andreas Brandst{\"{a}}dt and
Christian Hundt},
editor = {Eduardo Sany Laber and
Claudson F. Bornstein and
Loana Tito Nogueira and
Lu{\'{e}}rbio Faria},
title = {Ptolemaic Graphs and Interval Graphs Are Leaf Powers},
booktitle = {{LATIN} 2008: Theoretical Informatics, 8th Latin American Symposium,
B{\'{u}}zios, Brazil, April 7-11, 2008, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4957},
pages = {479--491},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-78773-0\_42},
doi = {10.1007/978-3-540-78773-0\_42},
timestamp = {Tue, 14 May 2019 10:00:53 +0200},
biburl = {https://dblp.org/rec/conf/latin/BrandstadtH08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/HundtL08,
author = {Christian Hundt and
Maciej Liskiewicz},
editor = {Edward Ochmanski and
Jerzy Tyszkiewicz},
title = {Combinatorial Bounds and Algorithmic Aspects of Image Matching under
Projective Transformations},
booktitle = {Mathematical Foundations of Computer Science 2008, 33rd International
Symposium, {MFCS} 2008, Torun, Poland, August 25-29, 2008, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5162},
pages = {395--406},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-85238-4\_32},
doi = {10.1007/978-3-540-85238-4\_32},
timestamp = {Tue, 14 May 2019 10:00:37 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/HundtL08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/HundtL07,
author = {Christian Hundt and
Maciej Liskiewicz},
editor = {Wolfgang Thomas and
Pascal Weil},
title = {On the Complexity of Affine Image Matching},
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 = {284--295},
publisher = {Springer},
year = {2007},
url = {https://doi.org/10.1007/978-3-540-70918-3\_25},
doi = {10.1007/978-3-540-70918-3\_25},
timestamp = {Tue, 14 May 2019 10:00:48 +0200},
biburl = {https://dblp.org/rec/conf/stacs/HundtL07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/HundtL07,
author = {Christian Hundt and
Maciej Liskiewicz},
title = {A Combinatorial Geometric Approach to Linear Image Matching},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR07-066}},
year = {2007},
url = {https://eccc.weizmann.ac.il/eccc-reports/2007/TR07-066/index.html},
eprinttype = {ECCC},
eprint = {TR07-066},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/HundtL07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/HundtLW06,
author = {Christian Hundt and
Maciej Liskiewicz and
Ulrich W{\"{o}}lfel},
editor = {Tetsuo Asano},
title = {Provably Secure Steganography and the Complexity of Sampling},
booktitle = {Algorithms and Computation, 17th International Symposium, {ISAAC}
2006, Kolkata, India, December 18-20, 2006, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4288},
pages = {754--763},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11940128\_75},
doi = {10.1007/11940128\_75},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/isaac/HundtLW06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-08-05 21:13 CEST 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:
