Martin Charles Golumbic

From MaRDI portal
Person:251894

Available identifiers

zbMath Open golumbic.martin-charlesWikidataQ6775135 ScholiaQ6775135MaRDI QIDQ251894

List of research outcomes





PublicationDate of PublicationType
On dually-CPT and strongly-CPT posets2025-01-15Paper
Containment orders – a lifelong journey2024-11-26Paper
Algorithms and complexity of sandwich problems in graphs (extended abstract)2024-01-05Paper
Graph algorithms2022-12-21Paper
Preliminaries2022-12-21Paper
Dually and strongly chordal graphs2022-12-21Paper
Chordal graphs2022-12-21Paper
Containment graphs and posets of paths in a tree: wheels and partial wheels2021-04-16Paper
The Zeroth Book of Graph Theory2021-02-18Paper
https://portal.mardi4nfdi.de/entity/Q33866162021-01-05Paper
https://portal.mardi4nfdi.de/entity/Q51336522020-11-10Paper
Hardness and approximation for L-EPG and \(B_1\)-EPG graphs2020-05-29Paper
An Effective Upperbound on Treewidth Using Partial Fill-in of Separators2019-09-06Paper
The induced separation dimension of a graph2018-07-26Paper
Total coloring of rooted path graphs2018-04-05Paper
Edge-intersection graphs of boundary-generated paths in a grid2018-01-11Paper
Induced Separation Dimension2016-12-22Paper
Tolerance intersection graphs of degree bounded subtrees of a tree with constant tolerance 22016-12-14Paper
Separation dimension of graphs and hypergraphs2016-06-28Paper
Single bend paths on a grid have strong Helly number 4: errata atque emendationes ad ``Edge intersection graphs of single bend paths on a grid2016-06-10Paper
Posets and VPG graphs2016-03-02Paper
Boxicity and Separation Dimension2015-09-09Paper
https://portal.mardi4nfdi.de/entity/Q55013622015-08-03Paper
ON THE CLIQUE-WIDTH OF SOME PERFECT GRAPH CLASSES2015-04-29Paper
Characterizations of cographs as intersection graphs of paths on a grid2014-09-12Paper
Co-TT graphs and a characterization of split co-TT graphs2014-05-05Paper
Approximation algorithms for \(B _{1}\)-EPG graphs2013-08-12Paper
String graphs of \(k\)-bend paths on a grid2013-07-23Paper
On the intersection graphs of orthogonal line segments in the plane: characterizations of some subclasses of chordal graphs2013-06-26Paper
Vertex Intersection Graphs of Paths on a Grid2012-12-04Paper
Path-bicolorable graphs2012-01-24Paper
The chain graph sandwich problem2011-11-17Paper
A characterization of chain probe graphs2011-11-17Paper
Edge intersection graphs of single bend paths on a grid2010-11-24Paper
On the bi-enhancement of chordal-bipartite probe graphs2010-09-07Paper
https://portal.mardi4nfdi.de/entity/Q35766662010-07-30Paper
Smallest odd holes in claw-free graphs (extended abstract)2010-01-21Paper
Chordal probe graphs (extended abstract)2010-01-12Paper
Landmarks in Algorithmic Graph Theory: A Personal Retrospective2010-01-07Paper
Path-bicolorable graphs. (Extended abstract)2010-01-07Paper
Intersection models of weakly chordal graphs2009-06-24Paper
Equivalences and the complete hierarchy of intersection graphs of paths in a tree2009-03-04Paper
What Is between Chordal and Weakly Chordal Graphs?2009-01-20Paper
An improvement on the complexity of factoring read-once Boolean functions2008-09-10Paper
Finding Intersection Models of Weakly Chordal Graphs2008-09-04Paper
Recognizing Chordal Probe Graphs and Cycle-Bicolorable Graphs2008-08-13Paper
Representing edge intersection graphs of paths on degree 4 trees2008-03-18Paper
The \(k\)-edge intersection graphs of paths in a tree2008-02-26Paper
Read-Once Functions Revisited and the Readability Number of a Boolean Function2007-05-29Paper
Twenty Years of EPT Graphs: From Haifa to Rostock2007-05-29Paper
Chain Graphs have Unbounded Readability2006-10-15Paper
Rank‐tolerance graph classes2006-09-06Paper
Factoring and recognition of read-once functions using cographs and normality and the readability of functions associated with partial \(k\)-trees2006-06-09Paper
Algorithmic graph theory and its applications2006-03-09Paper
Factoring Boolean functions using graph partitioning2005-09-02Paper
Advances in Computer Science - ASIAN 2004. Higher-Level Decision Making2005-08-17Paper
On the complexity of cell flipping in permutation diagrams and multiprocessor scheduling problems2005-08-01Paper
Chordal probe graphs2004-11-23Paper
https://portal.mardi4nfdi.de/entity/Q48285412004-11-22Paper
Algorithmic graph theory and perfect graphs2004-11-15Paper
https://portal.mardi4nfdi.de/entity/Q48087192004-08-12Paper
Archimedean ϕ ‐tolerance graphs2003-03-19Paper
Block duplicate graphs and a hierarchy of chordal graphs2002-12-02Paper
On the number of vertices belonging to all maximum stable sets of a graph2002-12-02Paper
https://portal.mardi4nfdi.de/entity/Q43291172002-10-24Paper
Uniquely restricted matchings2001-10-14Paper
https://portal.mardi4nfdi.de/entity/Q49498652001-05-17Paper
https://portal.mardi4nfdi.de/entity/Q49498122001-05-17Paper
New results on induced matchings2000-12-11Paper
https://portal.mardi4nfdi.de/entity/Q49449732000-05-22Paper
Matrix sandwich problems2000-03-13Paper
https://portal.mardi4nfdi.de/entity/Q44008831998-12-14Paper
Complexity and algorithms for graph and hypergraph sandwich problems1998-10-14Paper
Interactive scheduling as a constraint satisfiability problem1997-12-14Paper
Graph Sandwich Problems1996-05-27Paper
On the complexity of DNA physical mapping1994-11-23Paper
Complexity and algorithms for reasoning about time1994-09-11Paper
Irredundancy in circular arc graphs1994-03-13Paper
Counting endpoint sequences for interval orders and interval graphs1993-10-24Paper
Containment Graphs, Posets, and Related Classes of Graphs1992-06-25Paper
https://portal.mardi4nfdi.de/entity/Q31988991989-01-01Paper
Trapezoid graphs and their coloring1988-01-01Paper
Stability in circular arc graphs1988-01-01Paper
Algorithmic aspects of intersection graphs and representation hypergraphs1988-01-01Paper
Edge and vertex intersection of paths in a tree1985-01-01Paper
The edge intersection graphs of paths in a tree1985-01-01Paper
Interval graphs and related topics1985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q32214201984-01-01Paper
Tolerance graphs1984-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36884091984-01-01Paper
Comparability graphs and intersection graphs1983-01-01Paper
Partitionable graphs, circle graphs, and the Berge strong perfect graph conjecture1983-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33221501982-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33285831980-01-01Paper
The edge inducibility of graphs1980-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39144531980-01-01Paper
Generalized Fibonacci maximum path graphs1979-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39367811979-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41964631978-01-01Paper
Trivially perfect graphs1978-01-01Paper
Perfect Elimination and Chordal Bipartite Graphs1978-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41827961978-01-01Paper
A note on perfect Gaussian elimination1978-01-01Paper
The complexity of comparability graph recognition and coloring1977-01-01Paper
Comparability graphs and a new matroid1977-01-01Paper
Combinatorial Merging1976-01-01Paper
The inducibility of graphs1975-01-01Paper
https://portal.mardi4nfdi.de/entity/Q40780521975-01-01Paper

Research outcomes over time

This page was built for person: Martin Charles Golumbic