default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJesse Beisegel
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c7]Jesse Beisegel, Ekkehard Köhler, Fabienne Ratajczak, Robert Scheffler
, Martin Strehler:
Graph Search Trees and the Intermezzo Problem. MFCS 2024: 22:1-22:18- [c6]Jesse Beisegel, Nina Chiarelli, Ekkehard Köhler, Martin Milanic, Peter Mursic, Robert Scheffler:
The Simultaneous Interval Number: A New Width Parameter that Measures the Similarity to Interval Graphs. SWAT 2024: 7:1-7:20 - [i9]Jesse Beisegel, Nina Chiarelli, Ekkehard Köhler, Martin Milanic, Peter Mursic, Robert Scheffler:
The Simultaneous Interval Number: A New Width Parameter that Measures the Similarity to Interval Graphs. CoRR abs/2404.10670 (2024) - [i8]Jesse Beisegel, Fabienne Ratajczak, Robert Scheffler:
Computing Hamiltonian Paths with Partial Order Restrictions. CoRR abs/2404.16662 (2024) - [i7]Jesse Beisegel, Ekkehard Köhler, Fabienne Ratajczak, Robert Scheffler, Martin Strehler:
Graph Search Trees and the Intermezzo Problem. CoRR abs/2404.18645 (2024) - 2023
- [j4]Jesse Beisegel, Ekkehard Köhler, Robert Scheffler, Martin Strehler:
Certifying Fully Dynamic Algorithms for Recognition and Hamiltonicity of Threshold and Chain Graphs. Algorithmica 85(8): 2454-2481 (2023) - [i6]Isidor Konrad Maier, Johannes Kuhn, Jesse Beisegel, Markus Huber-Liebl, Matthias Wolff:
Minimalist Grammar: Construction without Overgeneration. CoRR abs/2311.01820 (2023) - 2022
- [j3]Jesse Beisegel, Maria Chudnovsky, Vladimir Gurvich, Martin Milanic, Mary Servatius:
Avoidable vertices and edges in graphs: Existence, characterization, and applications. Discret. Appl. Math. 309: 285-300 (2022) - 2021
- [j2]Jesse Beisegel, Carolin Denkert, Ekkehard Köhler, Matjaz Krnc, Nevena Pivac, Robert Scheffler, Martin Strehler:
The Recognition Problem of Graph Search Trees. SIAM J. Discret. Math. 35(2): 1418-1446 (2021) - 2020
- [c5]Jesse Beisegel, Ekkehard Köhler, Robert Scheffler, Martin Strehler:
Linear Time LexDFS on Chordal Graphs. ESA 2020: 13:1-13:13 - [c4]Jesse Beisegel, Nina Chiarelli, Ekkehard Köhler, Matjaz Krnc, Martin Milanic, Nevena Pivac, Robert Scheffler, Martin Strehler:
Edge Elimination and Weighted Graph Classes. WG 2020: 134-147 - [i5]Jesse Beisegel, Ekkehard Köhler, Robert Scheffler, Martin Strehler:
Linear Time LexDFS on Chordal Graphs. CoRR abs/2005.03523 (2020)
2010 – 2019
- 2019
- [j1]Jesse Beisegel, Carolin Denkert, Ekkehard Köhler, Matjaz Krnc, Nevena Pivac, Robert Scheffler, Martin Strehler:
On the End-Vertex Problem of Graph Searches. Discret. Math. Theor. Comput. Sci. 21(1) (2019) - [c3]Jesse Beisegel, Maria Chudnovsky, Vladimir Gurvich, Martin Milanic, Mary Servatius:
Avoidable Vertices and Edges in Graphs. WADS 2019: 126-139 - [c2]Jesse Beisegel, Carolin Denkert, Ekkehard Köhler, Matjaz Krnc, Nevena Pivac, Robert Scheffler, Martin Strehler:
Recognizing Graph Search Trees. LAGOS 2019: 99-110 - [i4]Jesse Beisegel, Maria Chudnovsky, Vladimir Gurvich, Martin Milanic, Mary Servatius:
Avoidable Vertices and Edges in Graphs. CoRR abs/1907.12078 (2019) - 2018
- [c1]Jesse Beisegel:
Characterising AT-free Graphs with BFS. WG 2018: 15-26 - [i3]Jesse Beisegel:
Characterising AT-free Graphs with BFS. CoRR abs/1807.05065 (2018) - [i2]Jesse Beisegel, Carolin Denkert, Ekkehard Köhler, Matjaz Krnc, Nevena Pivac, Robert Scheffler, Martin Strehler:
On the End-Vertex Problem of Graph Searches. CoRR abs/1810.12253 (2018) - [i1]Jesse Beisegel, Carolin Denkert, Ekkehard Köhler, Matjaz Krnc, Nevena Pivac, Robert Scheffler, Martin Strehler:
Recognizing Graph Search Trees. CoRR abs/1811.09249 (2018)
Coauthor Index
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.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:25 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:
