Jesse Beisegel

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
The Simultaneous Interval Number: A New Width Parameter that Measures the Similarity to Interval Graphs (available as arXiv preprint)	N/A	Paper
Computing Hamiltonian Paths with Partial Order Restrictions (available as arXiv preprint)	N/A	Paper
Graph Search Trees and the Intermezzo Problem (available as arXiv preprint)	N/A	Paper
Graph search trees and the Intermezzo problem	2026-05-12	Paper
The simultaneous interval number: a new width parameter that measures the similarity to interval graphs	2025-12-02	Paper
Computing Hamiltonian paths with partial order restrictions ACM Transactions on Computation Theory	2025-04-23	Paper
Certifying fully dynamic algorithms for recognition and Hamiltonicity of threshold and chain graphs Algorithmica	2023-08-17	Paper
scientific article; zbMATH DE number 7651152 (Why is no real title available?) (available as arXiv preprint)	2023-02-07	Paper
Edge elimination and weighted graph classes	2022-12-21	Paper
Recognizing graph search trees (available as arXiv preprint)	2022-04-27	Paper
Avoidable vertices and edges in graphs: existence, characterization, and applications Discrete Applied Mathematics	2022-01-13	Paper
The recognition problem of graph search trees SIAM Journal on Discrete Mathematics	2021-06-28	Paper
Avoidable vertices and edges in graphs (available as arXiv preprint)	2020-01-16	Paper
On the end-vertex problem of graph searches (available as arXiv preprint)	2019-08-01	Paper
On the end-vertex problem of graph searches	2019-08-01	Paper
Avoidable Vertices and Edges in Graphs (available as arXiv preprint)	2019-07-28	Paper
Characterising AT-free graphs with BFS (available as arXiv preprint)	2018-11-22	Paper

Research outcomes over time

This page was built for person: Jesse Beisegel