Herbert Fleischner

VLDB 2026 Research / reviewers in the wild / expert

dblp:06/5188 · DBLP profile ↗

← Back

12ranked-venue papers

7as first author

2since 2021 · last 2026

0000-0001-8588-5212ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Theory of computation · 11 · 6 first-author · 1 since 2021Databases, data management, data science and information retrieval · 1 · 1 first-author

Year	Publication	Venue	Position
2026	Putting Tutte's counterexample to Tait's conjecture in perspective to Hamiltonicity and non-Hamiltonicity in certain planar cubic graphs Herbert Fleischner, Enrico Iurlano, Günther R. Raidl	INOC	1
2022	On Finding Hamiltonian Cycles in Barnette Graphs abstract In this paper we deal with hamiltonicity in planar cubic graphs G having a facial 2–factor 𝒬 via (quasi) spanning trees of faces in G/𝒬 and study the algorithmic complexity of finding such (quasi) spanning trees of faces. Moreover, we show that if Barnette’s Conjecture is false, then hamiltonicity in 3–connected planar cubic bipartite graphs is an NP-complete problem. Behrooz Bagheri Gh., Tomás Feder, Herbert Fleischner, Carlos S. Subi	Fundam. Informaticae	3
2020	A model for finding transition-minors Benedikt Klocker, Herbert Fleischner, Günther R. Raidl	Discret. Appl. Math.	2
2016	Supereulerian graphs with width s and s-collapsible graphs Ping Li 0023, Herbert Fleischner, Hong-Jian Lai	Discret. Appl. Math.	4
2009	Covering graphs with few complete bipartite subgraphs Herbert Fleischner, Egbert Mujuni, Daniël Paulusma, Stefan Szeider	Theor. Comput. Sci.	1
2007	Covering Graphs with Few Complete Bipartite Subgraphs Herbert Fleischner, Egbert Mujuni, Daniël Paulusma, Stefan Szeider	FSTTCS	1
2002	Polynomial-time recognition of minimal unsatisfiable formulas with fixed clause-variable difference Herbert Fleischner, Oliver Kullmann, Stefan Szeider	Theor. Comput. Sci.	1
1998	Algorithms and Outerplanar Conditions for A-trails in Plane Eulerian Graphs Lars Døvling Andersen, Herbert Fleischner, Susanne Regner	Discret. Appl. Math.	2
1995	The NP-completeness of Finding A-trails in Eulerian Graphs and of Finding Spanning Trees in Hypergraphs Lars Døvling Andersen, Herbert Fleischner	Discret. Appl. Math.	2
1992	Detecting Cycles Through Three Fixed Vertices in a Graph Herbert Fleischner, Gerhard J. Woeginger	Inf. Process. Lett.	1
1989	Elementary proofs of (relatively) recent characterizations of Eulerian graphs Herbert Fleischner	Discret. Appl. Math.	1
1977	On the Equivalence of Mealy-Type and Moore-Type Automata and a Relation between Reducibility and Moore-Reducibility Herbert Fleischner	J. Comput. Syst. Sci.	1