Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSearch dblp for Publications
export results for "Jesse Beisegel"
download as .bib file
@inproceedings{DBLP:conf/swat/BeisegelCKMM024,
author = {Jesse Beisegel and
Nina Chiarelli and
Ekkehard K{\"{o}}hler and
Martin Milanic and
Peter Mursic and
Robert Scheffler},
editor = {Hans L. Bodlaender},
title = {The Simultaneous Interval Number: {A} New Width Parameter that Measures
the Similarity to Interval Graphs},
booktitle = {19th Scandinavian Symposium and Workshops on Algorithm Theory, {SWAT}
2024, June 12-14, 2024, Helsinki, Finland},
series = {LIPIcs},
volume = {294},
pages = {7:1--7:20},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2024},
url = {https://doi.org/10.4230/LIPIcs.SWAT.2024.7},
doi = {10.4230/LIPICS.SWAT.2024.7},
timestamp = {Mon, 03 Jun 2024 16:45:32 +0200},
biburl = {https://dblp.org/rec/conf/swat/BeisegelCKMM024.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2404-10670,
author = {Jesse Beisegel and
Nina Chiarelli and
Ekkehard K{\"{o}}hler and
Martin Milanic and
Peter Mursic and
Robert Scheffler},
title = {The Simultaneous Interval Number: {A} New Width Parameter that Measures
the Similarity to Interval Graphs},
journal = {CoRR},
volume = {abs/2404.10670},
year = {2024},
url = {https://doi.org/10.48550/arXiv.2404.10670},
doi = {10.48550/ARXIV.2404.10670},
eprinttype = {arXiv},
eprint = {2404.10670},
timestamp = {Wed, 15 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2404-10670.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2404-16662,
author = {Jesse Beisegel and
Fabienne Ratajczak and
Robert Scheffler},
title = {Computing Hamiltonian Paths with Partial Order Restrictions},
journal = {CoRR},
volume = {abs/2404.16662},
year = {2024},
url = {https://doi.org/10.48550/arXiv.2404.16662},
doi = {10.48550/ARXIV.2404.16662},
eprinttype = {arXiv},
eprint = {2404.16662},
timestamp = {Mon, 03 Jun 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2404-16662.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2404-18645,
author = {Jesse Beisegel and
Ekkehard K{\"{o}}hler and
Fabienne Ratajczak and
Robert Scheffler and
Martin Strehler},
title = {Graph Search Trees and the Intermezzo Problem},
journal = {CoRR},
volume = {abs/2404.18645},
year = {2024},
url = {https://doi.org/10.48550/arXiv.2404.18645},
doi = {10.48550/ARXIV.2404.18645},
eprinttype = {arXiv},
eprint = {2404.18645},
timestamp = {Mon, 27 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2404-18645.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BeisegelKSS23,
author = {Jesse Beisegel and
Ekkehard K{\"{o}}hler and
Robert Scheffler and
Martin Strehler},
title = {Certifying Fully Dynamic Algorithms for Recognition and Hamiltonicity
of Threshold and Chain Graphs},
journal = {Algorithmica},
volume = {85},
number = {8},
pages = {2454--2481},
year = {2023},
url = {https://doi.org/10.1007/s00453-023-01107-1},
doi = {10.1007/S00453-023-01107-1},
timestamp = {Tue, 12 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/BeisegelKSS23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2311-01820,
author = {Isidor Konrad Maier and
Johannes Kuhn and
Jesse Beisegel and
Markus Huber{-}Liebl and
Matthias Wolff},
title = {Minimalist Grammar: Construction without Overgeneration},
journal = {CoRR},
volume = {abs/2311.01820},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2311.01820},
doi = {10.48550/ARXIV.2311.01820},
eprinttype = {arXiv},
eprint = {2311.01820},
timestamp = {Tue, 07 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2311-01820.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/BeisegelCGMS22,
author = {Jesse Beisegel and
Maria Chudnovsky and
Vladimir Gurvich and
Martin Milanic and
Mary Servatius},
title = {Avoidable vertices and edges in graphs: Existence, characterization,
and applications},
journal = {Discret. Appl. Math.},
volume = {309},
pages = {285--300},
year = {2022},
url = {https://doi.org/10.1016/j.dam.2021.12.006},
doi = {10.1016/J.DAM.2021.12.006},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dam/BeisegelCGMS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/BeisegelDKKPSS21,
author = {Jesse Beisegel and
Carolin Denkert and
Ekkehard K{\"{o}}hler and
Matjaz Krnc and
Nevena Pivac and
Robert Scheffler and
Martin Strehler},
title = {The Recognition Problem of Graph Search Trees},
journal = {{SIAM} J. Discret. Math.},
volume = {35},
number = {2},
pages = {1418--1446},
year = {2021},
url = {https://doi.org/10.1137/20M1313301},
doi = {10.1137/20M1313301},
timestamp = {Mon, 04 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/BeisegelDKKPSS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/BeisegelKSS20,
author = {Jesse Beisegel and
Ekkehard K{\"{o}}hler and
Robert Scheffler and
Martin Strehler},
editor = {Fabrizio Grandoni and
Grzegorz Herman and
Peter Sanders},
title = {Linear Time LexDFS on Chordal Graphs},
booktitle = {28th Annual European Symposium on Algorithms, {ESA} 2020, September
7-9, 2020, Pisa, Italy (Virtual Conference)},
series = {LIPIcs},
volume = {173},
pages = {13:1--13:13},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.ESA.2020.13},
doi = {10.4230/LIPICS.ESA.2020.13},
timestamp = {Mon, 04 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/esa/BeisegelKSS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/BeisegelCKKMPSS20,
author = {Jesse Beisegel and
Nina Chiarelli and
Ekkehard K{\"{o}}hler and
Matjaz Krnc and
Martin Milanic and
Nevena Pivac and
Robert Scheffler and
Martin Strehler},
editor = {Isolde Adler and
Haiko M{\"{u}}ller},
title = {Edge Elimination and Weighted Graph Classes},
booktitle = {Graph-Theoretic Concepts in Computer Science - 46th International
Workshop, {WG} 2020, Leeds, UK, June 24-26, 2020, Revised Selected
Papers},
series = {Lecture Notes in Computer Science},
volume = {12301},
pages = {134--147},
publisher = {Springer},
year = {2020},
url = {https://doi.org/10.1007/978-3-030-60440-0\_11},
doi = {10.1007/978-3-030-60440-0\_11},
timestamp = {Mon, 04 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wg/BeisegelCKKMPSS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2005-03523,
author = {Jesse Beisegel and
Ekkehard K{\"{o}}hler and
Robert Scheffler and
Martin Strehler},
title = {Linear Time LexDFS on Chordal Graphs},
journal = {CoRR},
volume = {abs/2005.03523},
year = {2020},
url = {https://arxiv.org/abs/2005.03523},
eprinttype = {arXiv},
eprint = {2005.03523},
timestamp = {Mon, 04 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2005-03523.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dmtcs/BeisegelDKKPSS19,
author = {Jesse Beisegel and
Carolin Denkert and
Ekkehard K{\"{o}}hler and
Matjaz Krnc and
Nevena Pivac and
Robert Scheffler and
Martin Strehler},
title = {On the End-Vertex Problem of Graph Searches},
journal = {Discret. Math. Theor. Comput. Sci.},
volume = {21},
number = {1},
year = {2019},
url = {https://doi.org/10.23638/DMTCS-21-1-13},
doi = {10.23638/DMTCS-21-1-13},
timestamp = {Sun, 12 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dmtcs/BeisegelDKKPSS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wads/BeisegelCGMS19,
author = {Jesse Beisegel and
Maria Chudnovsky and
Vladimir Gurvich and
Martin Milanic and
Mary Servatius},
editor = {Zachary Friggstad and
J{\"{o}}rg{-}R{\"{u}}diger Sack and
Mohammad R. Salavatipour},
title = {Avoidable Vertices and Edges in Graphs},
booktitle = {Algorithms and Data Structures - 16th International Symposium, {WADS}
2019, Edmonton, AB, Canada, August 5-7, 2019, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {11646},
pages = {126--139},
publisher = {Springer},
year = {2019},
url = {https://doi.org/10.1007/978-3-030-24766-9\_10},
doi = {10.1007/978-3-030-24766-9\_10},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wads/BeisegelCGMS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:journals/entcs/BeisegelDKKPSS19,
author = {Jesse Beisegel and
Carolin Denkert and
Ekkehard K{\"{o}}hler and
Matjaz Krnc and
Nevena Pivac and
Robert Scheffler and
Martin Strehler},
editor = {Gabriel Coutinho and
Yoshiharu Kohayakawa and
Vin{\'{\i}}cius Fernandes dos Santos and
Sebasti{\'{a}}n Urrutia},
title = {Recognizing Graph Search Trees},
booktitle = {Proceedings of the tenth Latin and American Algorithms, Graphs and
Optimization Symposium, {LAGOS} 2019, Belo Horizonte, Brazil, June
2-7, 2019},
series = {Electronic Notes in Theoretical Computer Science},
volume = {346},
pages = {99--110},
publisher = {Elsevier},
year = {2019},
url = {https://doi.org/10.1016/j.entcs.2019.08.010},
doi = {10.1016/J.ENTCS.2019.08.010},
timestamp = {Tue, 16 Aug 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/entcs/BeisegelDKKPSS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1907-12078,
author = {Jesse Beisegel and
Maria Chudnovsky and
Vladimir Gurvich and
Martin Milanic and
Mary Servatius},
title = {Avoidable Vertices and Edges in Graphs},
journal = {CoRR},
volume = {abs/1907.12078},
year = {2019},
url = {http://arxiv.org/abs/1907.12078},
eprinttype = {arXiv},
eprint = {1907.12078},
timestamp = {Tue, 30 Jul 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1907-12078.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/Beisegel18,
author = {Jesse Beisegel},
editor = {Andreas Brandst{\"{a}}dt and
Ekkehard K{\"{o}}hler and
Klaus Meer},
title = {Characterising AT-free Graphs with {BFS}},
booktitle = {Graph-Theoretic Concepts in Computer Science - 44th International
Workshop, {WG} 2018, Cottbus, Germany, June 27-29, 2018, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {11159},
pages = {15--26},
publisher = {Springer},
year = {2018},
url = {https://doi.org/10.1007/978-3-030-00256-5\_2},
doi = {10.1007/978-3-030-00256-5\_2},
timestamp = {Tue, 14 May 2019 10:00:40 +0200},
biburl = {https://dblp.org/rec/conf/wg/Beisegel18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1807-05065,
author = {Jesse Beisegel},
title = {Characterising AT-free Graphs with {BFS}},
journal = {CoRR},
volume = {abs/1807.05065},
year = {2018},
url = {http://arxiv.org/abs/1807.05065},
eprinttype = {arXiv},
eprint = {1807.05065},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1807-05065.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1810-12253,
author = {Jesse Beisegel and
Carolin Denkert and
Ekkehard K{\"{o}}hler and
Matjaz Krnc and
Nevena Pivac and
Robert Scheffler and
Martin Strehler},
title = {On the End-Vertex Problem of Graph Searches},
journal = {CoRR},
volume = {abs/1810.12253},
year = {2018},
url = {http://arxiv.org/abs/1810.12253},
eprinttype = {arXiv},
eprint = {1810.12253},
timestamp = {Mon, 04 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1810-12253.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1811-09249,
author = {Jesse Beisegel and
Carolin Denkert and
Ekkehard K{\"{o}}hler and
Matjaz Krnc and
Nevena Pivac and
Robert Scheffler and
Martin Strehler},
title = {Recognizing Graph Search Trees},
journal = {CoRR},
volume = {abs/1811.09249},
year = {2018},
url = {http://arxiv.org/abs/1811.09249},
eprinttype = {arXiv},
eprint = {1811.09249},
timestamp = {Mon, 04 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1811-09249.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
retrieved on 2024-06-11 05:15 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
