Jesse Beisegel

According to our database, Jesse Beisegel authored at least 13 papers between 2018 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

Computing Hamiltonian Paths with Partial Order Restrictions.

Jesse Beisegel, Fabienne Ratajczak, Robert Scheffler

CoRR, 2024

The Simultaneous Interval Number: A New Width Parameter that Measures the Similarity to Interval Graphs.

Jesse Beisegel, Nina Chiarelli, Ekkehard Köhler, Martin Milanic, Peter Mursic, Robert Scheffler

Proceedings of the 19th Scandinavian Symposium and Workshops on Algorithm Theory, 2024

Graph Search Trees and the Intermezzo Problem.

Jesse Beisegel, Ekkehard Köhler, Fabienne Ratajczak, Robert Scheffler, Martin Strehler

Proceedings of the 49th International Symposium on Mathematical Foundations of Computer Science, 2024

2023

Certifying Fully Dynamic Algorithms for Recognition and Hamiltonicity of Threshold and Chain Graphs.

Jesse Beisegel, Ekkehard Köhler, Robert Scheffler, Martin Strehler

Algorithmica, August, 2023

Minimalist Grammar: Construction without Overgeneration.

Isidor Konrad Maier, Johannes Kuhn, Jesse Beisegel, Markus Huber-Liebl, Matthias Wolff

CoRR, 2023

2022

Avoidable vertices and edges in graphs: Existence, characterization, and applications.

Jesse Beisegel, Maria Chudnovsky, Vladimir Gurvich, Martin Milanic, Mary Servatius

Discret. Appl. Math., 2022

2021

The Recognition Problem of Graph Search Trees.

Jesse Beisegel, Carolin Denkert, Ekkehard Köhler, Matjaz Krnc, Nevena Pivac, Robert Scheffler, Martin Strehler

SIAM J. Discret. Math., 2021

2020

Edge Elimination and Weighted Graph Classes.

Jesse Beisegel, Nina Chiarelli, Ekkehard Köhler, Matjaz Krnc, Martin Milanic, Nevena Pivac, Robert Scheffler, Martin Strehler

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2020

Linear Time LexDFS on Chordal Graphs.

Jesse Beisegel, Ekkehard Köhler, Robert Scheffler, Martin Strehler

Proceedings of the 28th Annual European Symposium on Algorithms, 2020

2019

Recognizing Graph Search Trees.

Jesse Beisegel, Carolin Denkert, Ekkehard Köhler, Matjaz Krnc, Nevena Pivac, Robert Scheffler, Martin Strehler

Proceedings of the tenth Latin and American Algorithms, Graphs and Optimization Symposium, 2019

On the End-Vertex Problem of Graph Searches.

Jesse Beisegel, Carolin Denkert, Ekkehard Köhler, Matjaz Krnc, Nevena Pivac, Robert Scheffler, Martin Strehler

Discret. Math. Theor. Comput. Sci., 2019

Avoidable Vertices and Edges in Graphs.

Jesse Beisegel, Maria Chudnovsky, Vladimir Gurvich, Martin Milanic, Mary Servatius

Proceedings of the Algorithms and Data Structures - 16th International Symposium, 2019

2018

Characterising AT-free Graphs with BFS.

Jesse Beisegel

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2018