Publication | Date of Publication | Type |
---|
Algorithms and complexity of sandwich problems in graphs (extended abstract) | 2024-01-05 | Paper |
Preliminaries | 2022-12-21 | Paper |
Graph algorithms | 2022-12-21 | Paper |
Chordal graphs | 2022-12-21 | Paper |
Dually and strongly chordal graphs | 2022-12-21 | Paper |
Containment graphs and posets of paths in a tree: wheels and partial wheels | 2021-04-16 | Paper |
The Zeroth Book of Graph Theory | 2021-02-18 | Paper |
https://portal.mardi4nfdi.de/entity/Q3386616 | 2021-01-05 | Paper |
https://portal.mardi4nfdi.de/entity/Q5133652 | 2020-11-10 | Paper |
Hardness and approximation for L-EPG and \(B_1\)-EPG graphs | 2020-05-29 | Paper |
An Effective Upperbound on Treewidth Using Partial Fill-in of Separators | 2019-09-06 | Paper |
The induced separation dimension of a graph | 2018-07-26 | Paper |
Total coloring of rooted path graphs | 2018-04-05 | Paper |
Edge-intersection graphs of boundary-generated paths in a grid | 2018-01-11 | Paper |
Induced Separation Dimension | 2016-12-22 | Paper |
Tolerance intersection graphs of degree bounded subtrees of a tree with constant tolerance 2 | 2016-12-14 | Paper |
Separation dimension of graphs and hypergraphs | 2016-06-28 | Paper |
Single bend paths on a grid have strong helly number 4: errata atque emendationes ad “edge intersection graphs of single bend paths on a grid” | 2016-06-10 | Paper |
Posets and VPG graphs | 2016-03-02 | Paper |
Boxicity and Separation Dimension | 2015-09-09 | Paper |
https://portal.mardi4nfdi.de/entity/Q5501362 | 2015-08-03 | Paper |
ON THE CLIQUE-WIDTH OF SOME PERFECT GRAPH CLASSES | 2015-04-29 | Paper |
Characterizations of cographs as intersection graphs of paths on a grid | 2014-09-12 | Paper |
Co-TT graphs and a characterization of split co-TT graphs | 2014-05-05 | Paper |
Approximation Algorithms for B 1-EPG Graphs | 2013-08-12 | Paper |
String graphs of k-bend paths on a grid | 2013-07-23 | Paper |
On the intersection graphs of orthogonal line segments in the plane: characterizations of some subclasses of chordal graphs | 2013-06-26 | Paper |
Vertex Intersection Graphs of Paths on a Grid | 2012-12-04 | Paper |
Path-bicolorable graphs | 2012-01-24 | Paper |
The chain graph sandwich problem | 2011-11-17 | Paper |
A characterization of chain probe graphs | 2011-11-17 | Paper |
Edge intersection graphs of single bend paths on a grid | 2010-11-24 | Paper |
On the bi-enhancement of chordal-bipartite probe graphs | 2010-09-07 | Paper |
https://portal.mardi4nfdi.de/entity/Q3576666 | 2010-07-30 | Paper |
Smallest Odd Holes in Claw-Free Graphs (Extended Abstract) | 2010-01-21 | Paper |
Graph-Theoretic Concepts in Computer Science | 2010-01-12 | Paper |
Landmarks in Algorithmic Graph Theory: A Personal Retrospective | 2010-01-07 | Paper |
Path-Bicolorable Graphs | 2010-01-07 | Paper |
Intersection models of weakly chordal graphs | 2009-06-24 | Paper |
Equivalences and the complete hierarchy of intersection graphs of paths in a tree | 2009-03-04 | Paper |
What Is between Chordal and Weakly Chordal Graphs? | 2009-01-20 | Paper |
An improvement on the complexity of factoring read-once Boolean functions | 2008-09-10 | Paper |
Finding Intersection Models of Weakly Chordal Graphs | 2008-09-04 | Paper |
Recognizing Chordal Probe Graphs and Cycle-Bicolorable Graphs | 2008-08-13 | Paper |
Representing edge intersection graphs of paths on degree 4 trees | 2008-03-18 | Paper |
The \(k\)-edge intersection graphs of paths in a tree | 2008-02-26 | Paper |
Read-Once Functions Revisited and the Readability Number of a Boolean Function | 2007-05-29 | Paper |
Twenty Years of EPT Graphs: From Haifa to Rostock | 2007-05-29 | Paper |
Chain Graphs have Unbounded Readability | 2006-10-15 | Paper |
Rank‐tolerance graph classes | 2006-09-06 | Paper |
Factoring and recognition of read-once functions using cographs and normality and the readability of functions associated with partial \(k\)-trees | 2006-06-09 | Paper |
https://portal.mardi4nfdi.de/entity/Q3374244 | 2006-03-09 | Paper |
Factoring Boolean functions using graph partitioning | 2005-09-02 | Paper |
Advances in Computer Science - ASIAN 2004. Higher-Level Decision Making | 2005-08-17 | Paper |
On the complexity of cell flipping in permutation diagrams and multiprocessor scheduling problems | 2005-08-01 | Paper |
Chordal probe graphs | 2004-11-23 | Paper |
https://portal.mardi4nfdi.de/entity/Q4828541 | 2004-11-22 | Paper |
Algorithmic graph theory and perfect graphs | 2004-11-15 | Paper |
https://portal.mardi4nfdi.de/entity/Q4808719 | 2004-08-12 | Paper |
Archimedean ϕ ‐tolerance graphs | 2003-03-19 | Paper |
On the number of vertices belonging to all maximum stable sets of a graph | 2002-12-02 | Paper |
Block duplicate graphs and a hierarchy of chordal graphs | 2002-12-02 | Paper |
https://portal.mardi4nfdi.de/entity/Q4329117 | 2002-10-24 | Paper |
Uniquely restricted matchings | 2001-10-14 | Paper |
https://portal.mardi4nfdi.de/entity/Q4949812 | 2001-05-17 | Paper |
https://portal.mardi4nfdi.de/entity/Q4949865 | 2001-05-17 | Paper |
New results on induced matchings | 2000-12-11 | Paper |
https://portal.mardi4nfdi.de/entity/Q4944973 | 2000-05-22 | Paper |
Matrix sandwich problems | 2000-03-13 | Paper |
https://portal.mardi4nfdi.de/entity/Q4400883 | 1998-12-14 | Paper |
Complexity and algorithms for graph and hypergraph sandwich problems | 1998-10-14 | Paper |
Interactive scheduling as a constraint satisfiability problem | 1997-12-14 | Paper |
Graph Sandwich Problems | 1996-05-27 | Paper |
On the complexity of DNA physical mapping | 1994-11-23 | Paper |
Complexity and algorithms for reasoning about time | 1994-09-11 | Paper |
Irredundancy in circular arc graphs | 1994-03-13 | Paper |
Counting endpoint sequences for interval orders and interval graphs | 1993-10-24 | Paper |
Containment Graphs, Posets, and Related Classes of Graphs | 1992-06-25 | Paper |
https://portal.mardi4nfdi.de/entity/Q3198899 | 1989-01-01 | Paper |
Trapezoid graphs and their coloring | 1988-01-01 | Paper |
Algorithmic aspects of intersection graphs and representation hypergraphs | 1988-01-01 | Paper |
Stability in circular arc graphs | 1988-01-01 | Paper |
The edge intersection graphs of paths in a tree | 1985-01-01 | Paper |
Edge and vertex intersection of paths in a tree | 1985-01-01 | Paper |
Interval graphs and related topics | 1985-01-01 | Paper |
Tolerance graphs | 1984-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q3221420 | 1984-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q3688409 | 1984-01-01 | Paper |
Comparability graphs and intersection graphs | 1983-01-01 | Paper |
Partitionable graphs, circle graphs, and the Berge strong perfect graph conjecture | 1983-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q3322150 | 1982-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q3328583 | 1980-01-01 | Paper |
The edge inducibility of graphs | 1980-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q3914453 | 1980-01-01 | Paper |
Generalized Fibonacci maximum path graphs | 1979-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q3936781 | 1979-01-01 | Paper |
A note on perfect Gaussian elimination | 1978-01-01 | Paper |
Trivially perfect graphs | 1978-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q4182796 | 1978-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q4196463 | 1978-01-01 | Paper |
Perfect Elimination and Chordal Bipartite Graphs | 1978-01-01 | Paper |
Comparability graphs and a new matroid | 1977-01-01 | Paper |
The complexity of comparability graph recognition and coloring | 1977-01-01 | Paper |
Combinatorial Merging | 1976-01-01 | Paper |
The inducibility of graphs | 1975-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q4078052 | 1975-01-01 | Paper |