Martin Charles Golumbic

Publication Activity (10 Years)

Years Active: 1976-2024
Publications (10 Years): 16

Top Venues

CoRR

Discret. Appl. Math.

Ann. Math. Artif. Intell.

Publications

Dimitrios I. Diochnos, Martin Charles Golumbic, Frederick Hoffman
ISAIM-2022: international symposium on artificial intelligence and mathematics. Ann. Math. Artif. Intell. 92 (1) (2024)
Liliana Alcón, Martin Charles Golumbic, Noemí Gudiño, Marisa Gutierrez, Vincent Limouzy
On dually-CPT and strong-CPT posets. CoRR (2022)
Martin Charles Golumbic, Vincent Limouzy
Containment Graphs and Posets of Paths in a Tree: Wheels and Partial Wheels. Order 38 (1) (2021)
Dror Epstein, Martin Charles Golumbic, Abhiruk Lahiri, Gila Morgenstern
Hardness and approximation for L-EPG and B1-EPG graphs. Discret. Appl. Math. 281 (2020)
Claudson F. Bornstein, Martin Charles Golumbic, Tanilson D. Santos, Uéverton S. Souza, Jayme Luiz Szwarcfiter
EPG Graph Recognition. Discret. Math. Theor. Comput. Sci. 22 (1) (2020)
Claudson F. Bornstein, Martin Charles Golumbic, Tanilson D. Santos, Uéverton S. Souza, Jayme Luiz Szwarcfiter
EPG Graph Recognition. CoRR (2019)
Boi Faltings, Martin Charles Golumbic
An Effective Upperbound on Treewidth Using Partial Fill-in of Separators. CoRR (2019)
Martin Charles Golumbic, Edward R. Scheinerman
Containment Graphs, Posets, and Related Classes of Graphs. CoRR (2019)
Emile Ziedan, Deepak Rajendraprasad, Rogers Mathew, Martin Charles Golumbic, Jérémie Dusart
The Induced Separation Dimension of a Graph. Algorithmica 80 (10) (2018)
Martin Charles Golumbic
Total coloring of rooted path graphs. Inf. Process. Lett. 135 (2018)
Martin Charles Golumbic, Gila Morgenstern, Deepak Rajendraprasad
Edge-intersection graphs of boundary-generated paths in a grid. Discret. Appl. Math. 236 (2018)
Elad Cohen, Martin Charles Golumbic, Marina Lipshteyn, Michal Stern
Tolerance intersection graphs of degree bounded subtrees of a tree with constant tolerance 2. Discret. Math. 340 (2) (2017)
Martin Charles Golumbic
A note from the Editor-in-Chief. Ann. Math. Artif. Intell. 77 (1-2) (2016)
Emile Ziedan, Deepak Rajendraprasad, Rogers Mathew, Martin Charles Golumbic, Jérémie Dusart
Induced Separation Dimension. WG (2016)
Elad Cohen, Martin Charles Golumbic, William T. Trotter, Ruidong Wang
Posets and VPG Graphs. Order 33 (1) (2016)
Manu Basavaraju, L. Sunil Chandran, Martin Charles Golumbic, Rogers Mathew, Deepak Rajendraprasad
Separation Dimension of Graphs and Hypergraphs. Algorithmica 75 (1) (2016)
Manu Basavaraju, L. Sunil Chandran, Martin Charles Golumbic, Rogers Mathew, Deepak Rajendraprasad
Boxicity and separation dimension. CoRR (2014)
Elad Cohen, Martin Charles Golumbic, Bernard Ries
Characterizations of cographs as intersection graphs of paths on a grid. Discret. Appl. Math. 178 (2014)
Manu Basavaraju, L. Sunil Chandran, Martin Charles Golumbic, Rogers Mathew, Deepak Rajendraprasad
Boxicity and Separation Dimension. WG (2014)
Martin Charles Golumbic, Nirit Lefel Weingarten, Vincent Limouzy
Co-TT graphs and a characterization of split co-TT graphs. Discret. Appl. Math. 165 (2014)
Robert B. K. Dewar, Martin Charles Golumbic, Clinton F. Goss
Micro Spitbol. CoRR (2013)
Martin Charles Golumbic, Marina Lipshteyn, Michal Stern
"edge intersection graphs of single bend paths on a grid". Networks 62 (2) (2013)
Dror Epstein, Martin Charles Golumbic, Gila Morgenstern
Approximation Algorithms for B 1-EPG Graphs. WADS (2013)
Martin Charles Golumbic, Bernard Ries
On the Intersection Graphs of Orthogonal Line Segments in the Plane: Characterizations of Some Subclasses of Chordal Graphs. Graphs Comb. 29 (3) (2013)
Andrei Asinowski, Elad Cohen, Martin Charles Golumbic, Vincent Limouzy, Marina Lipshteyn, Michal Stern
Vertex Intersection Graphs of Paths on a Grid. J. Graph Algorithms Appl. 16 (2) (2012)
Martin Charles Golumbic, Michal Stern, Avivit Levy, Gila Morgenstern
Student Poster Session. WG (2012)
Martin Charles Golumbic
Forward. Ann. Math. Artif. Intell. 61 (1) (2011)
Andreas Brandstädt, Martin Charles Golumbic, Van Bang Le, Marina Lipshteyn
Path-Bicolorable Graphs. Graphs Comb. 27 (6) (2011)
Andreas Brandstädt, Martin Charles Golumbic, Pinar Heggernes, Ross M. McConnell
Exploiting graph structure to cope with hard problems (Dagstuhl Seminar 11182). Dagstuhl Reports 1 (5) (2011)
Simone Dantas, Celina M. H. de Figueiredo, Martin Charles Golumbic, Sulamita Klein, Frédéric Maffray
The chain graph sandwich problem. Ann. Oper. Res. 188 (1) (2011)
Martin Charles Golumbic
Graph sandwich problems. CTW (2011)
Martin Charles Golumbic, Frédéric Maffray, Grégory Morel
A characterization of chain probe graphs. Ann. Oper. Res. 188 (1) (2011)
Andrei Asinowski, Elad Cohen, Martin Charles Golumbic, Vincent Limouzy, Marina Lipshteyn, Michal Stern
String graphs of k-bend paths on a grid. Electron. Notes Discret. Math. 37 (2011)
Elad Cohen, Martin Charles Golumbic, Marina Lipshteyn, Michal Stern
On the bi-enhancement of chordal-bipartite probe graphs. Inf. Process. Lett. 110 (5) (2010)
Martin Charles Golumbic, Marina Lipshteyn, Michal Stern
Intersection models of weakly chordal graphs. Discret. Appl. Math. 157 (9) (2009)
Martin Charles Golumbic, Marina Lipshteyn, Michal Stern
Edge intersection graphs of single bend paths on a grid. Networks 54 (3) (2009)
Martin Charles Golumbic
Landmarks in Algorithmic Graph Theory: A Personal Retrospective. Graph Theory, Computational Intelligence and Thought (2009)
Shimon Shrem, Michal Stern, Martin Charles Golumbic
Smallest Odd Holes in Claw-Free Graphs (Extended Abstract). WG (2009)
Andreas Brandstädt, Martin Charles Golumbic, Van Bang Le, Marina Lipshteyn
Path-Bicolorable Graphs. Graph Theory, Computational Intelligence and Thought (2009)
Martin Charles Golumbic, Marina Lipshteyn, Michal Stern
Equivalences and the complete hierarchy of intersection graphs of paths in a tree. Discret. Appl. Math. 156 (17) (2008)
Elad Cohen, Martin Charles Golumbic, Marina Lipshteyn, Michal Stern
What Is between Chordal and Weakly Chordal Graphs?. WG (2008)
Elad Cohen, Martin Charles Golumbic, Marina Lipshteyn, Michal Stern
On the Bi-enhancement of Chordal-bipartite Probe Graphs. CTW (2008)
Martin Charles Golumbic, Marina Lipshteyn, Michal Stern
Representing edge intersection graphs of paths on degree 4 trees. Discret. Math. 308 (8) (2008)
Martin Charles Golumbic, Marina Lipshteyn, Michal Stern
The k-edge intersection graphs of paths in a tree. Discret. Appl. Math. 156 (4) (2008)
Martin Charles Golumbic, Aviad Mintz, Udi Rotics
An improvement on the complexity of factoring read-once Boolean functions. Discret. Appl. Math. 156 (10) (2008)
Martin Charles Golumbic, Marina Lipshteyn, Michal Stern
Edge intersection graphs of single bend paths on a grid. CTW (2007)
Anne Berry, Martin Charles Golumbic, Marina Lipshteyn
Recognizing Chordal Probe Graphs and Cycle-Bicolorable Graphs. SIAM J. Discret. Math. 21 (3) (2007)
Anne Berry, Eric SanJuan, Maurice Pouzet, Martin Charles Golumbic
Introduction to the special volume on knowledge discovery and discrete mathematics and a tribute to the memory of Peter L. Hammer. Ann. Math. Artif. Intell. 49 (1-4) (2007)
Martin Charles Golumbic, Marina Lipshteyn, Michal Stern
Finding Intersection Models of Weakly Chordal Graphs. WG (2006)
Martin Charles Golumbic, Aviad Mintz, Udi Rotics
Factoring and recognition of read-once functions using cographs and normality and the readability of functions associated with partial k-trees. Discret. Appl. Math. 154 (10) (2006)
Martin Charles Golumbic, Robert E. Jamison
Rank-tolerance graph classes. J. Graph Theory 52 (4) (2006)
Martin Charles Golumbic
Twenty Years of EPT Graphs: From Haifa to Rostock. Electron. Notes Discret. Math. 27 (2006)
Aviad Mintz, Martin Charles Golumbic
Factoring Boolean functions using graph partitioning. Discret. Appl. Math. 149 (1-3) (2005)
Martin Charles Golumbic, Haim Kaplan, Elad Verbin
On the complexity of cell flipping in permutation diagrams and multiprocessor scheduling problems. Discret. Math. 296 (1) (2005)
Martin Charles Golumbic, Aviad Mintz, Udi Rotics
Read-Once Functions Revisited and the Readability Number of a Boolean Function. Electron. Notes Discret. Math. 22 (2005)
Anne Berry, Martin Charles Golumbic, Marina Lipshteyn
Two tricks to triangulate chordal probe graphs in polynomial time. SODA (2004)
Martin Charles Golumbic, Marina Lipshteyn
Chordal probe graphs. Discret. Appl. Math. 143 (1-3) (2004)
Martin Charles Golumbic
Graph Theoretic Models for Reasoning About Time. ASIAN (2004)
Martin Charles Golumbic, Marina Lipshteyn
Chordal Probe Graphs. WG (2003)
Martin Charles Golumbic, Robert E. Jamison, Ann N. Trenk
Archimedean ϕ -tolerance graphs. J. Graph Theory 41 (3) (2002)
Endre Boros, Martin Charles Golumbic, Vadim E. Levit
On the number of vertices belonging to all maximum stable sets of a graph. Discret. Appl. Math. 124 (1-3) (2002)
Martin Charles Golumbic, Assaf Siani
Coloring Algorithms for Tolerance Graphs: Reasoning and Scheduling with Interval Constraints. AISC (2002)
Martin Charles Golumbic, Uri N. Peled
Block duplicate graphs and a hierarchy of chordal graphs. Discret. Appl. Math. 124 (1-3) (2002)
Martin Charles Golumbic, Aviad Mintz, Udi Rotics
Factoring and Recognition of Read-Once Functions using Cographs and Normality. DAC (2001)
Martin Charles Golumbic, Tirza Hirst, Moshe Lewenstein
Uniquely Restricted Matchings. Algorithmica 31 (2) (2001)
Martin Charles Golumbic
Editor's remarks. Ann. Math. Artif. Intell. 28 (1-4) (2000)
Martin Charles Golumbic, Udi Rotics
On the Clique-Width of Some Perfect Graph Classes. Int. J. Found. Comput. Sci. 11 (3) (2000)
Martin Charles Golumbic, Moshe Lewenstein
New results on induced matchings. Discret. Appl. Math. 101 (1-3) (2000)
Martin Charles Golumbic
1999 Bar Illan Symposium on the Foundations of Artificial Intelligence. AI Mag. 21 (1) (2000)
Martin Charles Golumbic, Aviad Mintz
Factoring logic functions using graph partitioning. ICCAD (1999)
Martin Charles Golumbic, Udi Rotics
On the Clique-Width of Perfect Graph Classes. WG (1999)
Martin Charles Golumbic, Amir Wassermann
Complexity and Algorithms for Graph and Hypergraph Sandwich Problems. Graphs Comb. 14 (3) (1998)
Martin Charles Golumbic, Haim Kaplan
Cell Flipping in Permutation Diagrams. STACS (1998)
Martin Charles Golumbic, Haim Kaplan, Ron Shamir
Graph Sandwich Problems. J. Algorithms 19 (3) (1995)
Paul W. Goldberg, Martin Charles Golumbic, Haim Kaplan, Ron Shamir
Four Strikes Against Physical Mapping of DNA. J. Comput. Biol. 2 (1) (1995)
Martin Charles Golumbic, Renu C. Laskar
Introduction. Discret. Appl. Math. 44 (1-3) (1993)
Martin Charles Golumbic, Renu C. Laskar
Irredundancy in Circular Arc Graphs. Discret. Appl. Math. 44 (1-3) (1993)
Alexander Belfer, Martin Charles Golumbic
Counting endpoint sequences for interval orders and interval graphs. Discret. Math. 114 (1-3) (1993)
Martin Charles Golumbic, Vladimir Rainish
Instruction Scheduling Across Control Flow. Sci. Program. 2 (3) (1993)
Martin Charles Golumbic, Haim Kaplan, Ron Shamir
Algorithms and Complexity of Sandwich Problems in Graphs (Extended Abstract). WG (1993)
Martin Charles Golumbic, Ron Shamir
Complexity and Algorithms for Reasoning about Time: A Graph-Theoretic Approach. J. ACM 40 (5) (1993)
Martin Charles Golumbic, Ron Shamir
Interval Graphs, Interval Orders and the Consistency of Temporal Events. ISTCS (1992)
Martin Charles Golumbic
Reasoning About Time. AISMC (1992)
Martin Charles Golumbic, Ron Shamir
Algorithms and Complexity for Reasoning about Time. AAAI (1992)
Martin Charles Golumbic, Moshe Markovich, Michael L. Tiomkin
A knowledge representation language for university requirements. Decis. Support Syst. 7 (1) (1991)
Martin Charles Golumbic, Vladimir Rainish
Instruction Scheduling Beyond Basic Blocks. IBM J. Res. Dev. 34 (1) (1990)
Ronen Feldman, Martin Charles Golumbic
Optimization Algorithms for Student Scheduling via Constraint Satisfiability. Comput. J. 33 (4) (1990)
Alexander Belfer, Martin Charles Golumbic
A combinatorial approach to temporal reasoning. Jerusalem Conference on Information Technology (1990)
Ronen Feldman, Martin Charles Golumbic
Ineractive Scheduling as a Constraint Satisfiability Problem. Ann. Math. Artif. Intell. 1 (1990)
Ronen Feldman, Martin Charles Golumbic
Constraint Satisfiability Algorithms for Interactive Student Scheduling. IJCAI (1989)
David Bernstein, Dina Q. Goldin, Martin Charles Golumbic, Hugo Krawczyk, Yishay Mansour, Itai Nahshon, Ron Y. Pinter
Spill Code Minimization Techniques for Optimizing Compilers. PLDI (1989)
Ido Dagan, Martin Charles Golumbic, Ron Y. Pinter
Trapezoid graphs and their coloring. Discret. Appl. Math. 21 (1) (1988)
Martin Charles Golumbic
Algorithmic aspects of intersection graphs and representation hypergraphs. Graphs Comb. 4 (1) (1988)
Martin Charles Golumbic, Peter L. Hammer
Stability in Circular Arc Graphs. J. Algorithms 9 (3) (1988)
Martin Charles Golumbic
A General Method for Avoiding Cycling in a Network. Inf. Process. Lett. 24 (4) (1987)
Martin Charles Golumbic, Robert E. Jamison
Edge and vertex intersection of paths in a tree. Discret. Math. 55 (2) (1985)
Martin Charles Golumbic, Robert E. Jamison
The edge intersection graphs of paths in a tree. J. Comb. Theory, Ser. B 38 (1) (1985)
Martin Charles Golumbic
Interval graphs and related topics. Discret. Math. 55 (2) (1985)
Martin Charles Golumbic, Clyde L. Monma, William T. Trotter
Tolerance graphs. Discret. Appl. Math. 9 (2) (1984)
Mark A. Buckingham, Martin Charles Golumbic
Partitionable graphs, circle graphs, and the berge strong perfect graph conjecture. Discret. Math. 44 (1) (1983)

Martin Charles Golumbic.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Martin Charles Golumbic