Combinatorial Merging. - Martin Charles Golumbic (IEEE Trans. Computers, 1976)

The complexity of comparability graph recognition and coloring. - Martin Charles Golumbic (Computing, 1977)

Comparability graphs and a new matroid. - Martin Charles Golumbic (J. Comb. Theory B, 1977)

Trivially perfect graphs. - Martin Charles Golumbic (Discret. Math., 1978)

Perfect Elimination and Chordal Bipartite Graphs. - Martin Charles Golumbic; Clinton F. Goss (J. Graph Theory, 1978)

Generalized fibonacci maximum path graphs. - Martin Charles Golumbic; Yehoshua Perl (Discret. Math., 1979)

Partitionable graphs, circle graphs, and the berge strong perfect graph conjecture. - Mark A. Buckingham; Martin Charles Golumbic (Discret. Math., 1983)

Comparability graphs and intersection graphs. - Martin Charles Golumbic; Doron Rotem; Jorge Urrutia (Discret. Math., 1983)

Tolerance graphs. - Martin Charles Golumbic; Clyde L. Monma; William T. Trotter (Discret. Appl. Math., 1984)

Interval graphs and related topics. - Martin Charles Golumbic (Discret. Math., 1985)

Edge and vertex intersection of paths in a tree. - Martin Charles Golumbic; Robert E. Jamison (Discret. Math., 1985)

The edge intersection graphs of paths in a tree. - Martin Charles Golumbic; Robert E. Jamison (J. Comb. Theory B, 1985)

A General Method for Avoiding Cycling in a Network. - Martin Charles Golumbic (Inf. Process. Lett., 1987)

Trapezoid graphs and their coloring. - Ido Dagan; Martin Charles Golumbic; Ron Y. Pinter (Discret. Appl. Math., 1988)

Algorithmic aspects of intersection graphs and representation hypergraphs. - Martin Charles Golumbic (Graphs Comb., 1988)

Stability in Circular Arc Graphs. - Martin Charles Golumbic; Peter L. Hammer (J. Algorithms, 1988)

Constraint Satisfiability Algorithms for Interactive Student Scheduling. - Ronen Feldman; Martin Charles Golumbic (IJCAI, 1989)

Spill Code Minimization Techniques for Optimizing Compilers. - David Bernstein; Dina Q. Goldin; Martin Charles Golumbic; Hugo Krawczyk; Yishay Mansour; Itai Nahshon; Ron Y. Pinter (PLDI, 1989)

A combinatorial approach to temporal reasoning. - Alexander Belfer; Martin Charles Golumbic (Jerusalem Conference on Information Technology, 1990)

Ineractive Scheduling as a Constraint Satisfiability Problem. - Ronen Feldman; Martin Charles Golumbic (Ann. Math. Artif. Intell., 1990)

Optimization Algorithms for Student Scheduling via Constraint Satisfiability. - Ronen Feldman; Martin Charles Golumbic (Comput. J., 1990)

Instruction Scheduling Beyond Basic Blocks. - Martin Charles Golumbic; Vladimir Rainish (IBM J. Res. Dev., 1990)

A knowledge representation language for university requirements. - Martin Charles Golumbic; Moshe Markovich; Michael L. Tiomkin (Decis. Support Syst., 1991)

Algorithms and Complexity for Reasoning about Time. - Martin Charles Golumbic; Ron Shamir (AAAI, 1992)

Reasoning About Time. - Martin Charles Golumbic (AISMC, 1992)

Interval Graphs, Interval Orders and the Consistency of Temporal Events. - Martin Charles Golumbic; Ron Shamir (ISTCS, 1992)

Algorithms and Complexity of Sandwich Problems in Graphs (Extended Abstract). - Martin Charles Golumbic; Haim Kaplan; Ron Shamir (WG, 1993)

Irredundancy in Circular Arc Graphs. - Martin Charles Golumbic; Renu C. Laskar (Discret. Appl. Math., 1993)

Introduction. - Martin Charles Golumbic; Renu C. Laskar (Discret. Appl. Math., 1993)

Counting endpoint sequences for interval orders and interval graphs. - Alexander Belfer; Martin Charles Golumbic (Discret. Math., 1993)

Complexity and Algorithms for Reasoning about Time: A Graph-Theoretic Approach. - Martin Charles Golumbic; Ron Shamir (J. ACM, 1993)

Instruction Scheduling Across Control Flow. - Martin Charles Golumbic; Vladimir Rainish (Sci. Program., 1993)

Graph Sandwich Problems. - Martin Charles Golumbic; Haim Kaplan; Ron Shamir (J. Algorithms, 1995)

Four Strikes Against Physical Mapping of DNA. - Paul W. Goldberg; Martin Charles Golumbic; Haim Kaplan; Ron Shamir (J. Comput. Biol., 1995)

Cell Flipping in Permutation Diagrams. - Martin Charles Golumbic; Haim Kaplan (STACS, 1998)

Complexity and Algorithms for Graph and Hypergraph Sandwich Problems. - Martin Charles Golumbic; Amir Wassermann (Graphs Comb., 1998)

Factoring logic functions using graph partitioning. - Martin Charles Golumbic; Aviad Mintz (ICCAD, 1999)

On the Clique-Width of Perfect Graph Classes. - Martin Charles Golumbic; Udi Rotics (WG, 1999)

1999 Bar Illan Symposium on the Foundations of Artificial Intelligence. - Martin Charles Golumbic (AI Mag., 2000)

Editor's remarks. - Martin Charles Golumbic (Ann. Math. Artif. Intell., 2000)

New results on induced matchings. - Martin Charles Golumbic; Moshe Lewenstein (Discret. Appl. Math., 2000)

On the Clique-Width of Some Perfect Graph Classes. - Martin Charles Golumbic; Udi Rotics (Int. J. Found. Comput. Sci., 2000)

Factoring and Recognition of Read-Once Functions using Cographs and Normality. - Martin Charles Golumbic; Aviad Mintz; Udi Rotics (DAC, 2001)

Uniquely Restricted Matchings. - Martin Charles Golumbic; Tirza Hirst; Moshe Lewenstein (Algorithmica, 2001)

Coloring Algorithms for Tolerance Graphs: Reasoning and Scheduling with Interval Constraints. - Martin Charles Golumbic; Assaf Siani (AISC, 2002)

On the number of vertices belonging to all maximum stable sets of a graph. - Endre Boros; Martin Charles Golumbic; Vadim E. Levit (Discret. Appl. Math., 2002)

Block duplicate graphs and a hierarchy of chordal graphs. - Martin Charles Golumbic; Uri N. Peled (Discret. Appl. Math., 2002)

Archimedean ϕ -tolerance graphs. - Martin Charles Golumbic; Robert E. Jamison; Ann N. Trenk (J. Graph Theory, 2002)

Graph Theoretic Models for Reasoning About Time. - Martin Charles Golumbic (ASIAN, 2004)

Two tricks to triangulate chordal probe graphs in polynomial time. - Anne Berry; Martin Charles Golumbic; Marina Lipshteyn (SODA, 2004)

Chordal probe graphs. - Martin Charles Golumbic; Marina Lipshteyn (Discret. Appl. Math., 2004)

Factoring Boolean functions using graph partitioning. - Aviad Mintz; Martin Charles Golumbic (Discret. Appl. Math., 2005)

On the complexity of cell flipping in permutation diagrams and multiprocessor scheduling problems. - Martin Charles Golumbic; Haim Kaplan; Elad Verbin (Discret. Math., 2005)

Read-Once Functions Revisited and the Readability Number of a Boolean Function. - Martin Charles Golumbic; Aviad Mintz; Udi Rotics (Electron. Notes Discret. Math., 2005)

Finding Intersection Models of Weakly Chordal Graphs. - Martin Charles Golumbic; Marina Lipshteyn; Michal Stern (WG, 2006)

Factoring and recognition of read-once functions using cographs and normality and the readability of functions associated with partial k-trees. - Martin Charles Golumbic; Aviad Mintz; Udi Rotics (Discret. Appl. Math., 2006)

Twenty Years of EPT Graphs: From Haifa to Rostock. - Martin Charles Golumbic (Electron. Notes Discret. Math., 2006)

Rank-tolerance graph classes. - Martin Charles Golumbic; Robert E. Jamison (J. Graph Theory, 2006)

Introduction to the special volume on knowledge discovery and discrete mathematics and a tribute to the memory of Peter L. Hammer. - Anne Berry; Eric SanJuan; Maurice Pouzet; Martin Charles Golumbic (Ann. Math. Artif. Intell., 2007)

Recognizing Chordal Probe Graphs and Cycle-Bicolorable Graphs. - Anne Berry; Martin Charles Golumbic; Marina Lipshteyn (SIAM J. Discret. Math., 2007)

Fighting Terror Online - The Convergence of Security, Technology, and the Law. - Martin Charles Golumbic (Springer, 2008)

What Is between Chordal and Weakly Chordal Graphs?. - Elad Cohen; Martin Charles Golumbic; Marina Lipshteyn; Michal Stern (WG, 2008)

The k-edge intersection graphs of paths in a tree. - Martin Charles Golumbic; Marina Lipshteyn; Michal Stern (Discret. Appl. Math., 2008)

Equivalences and the complete hierarchy of intersection graphs of paths in a tree. - Martin Charles Golumbic; Marina Lipshteyn; Michal Stern (Discret. Appl. Math., 2008)

An improvement on the complexity of factoring read-once Boolean functions. - Martin Charles Golumbic; Aviad Mintz; Udi Rotics (Discret. Appl. Math., 2008)

Representing edge intersection graphs of paths on degree 4 trees. - Martin Charles Golumbic; Marina Lipshteyn; Michal Stern (Discret. Math., 2008)

Landmarks in Algorithmic Graph Theory: A Personal Retrospective. - Martin Charles Golumbic (Graph Theory, Computational Intelligence and Thought, 2009)

Smallest Odd Holes in Claw-Free Graphs (Extended Abstract). - Shimon Shrem; Michal Stern; Martin Charles Golumbic (WG, 2009)

Intersection models of weakly chordal graphs. - Martin Charles Golumbic; Marina Lipshteyn; Michal Stern (Discret. Appl. Math., 2009)

Edge intersection graphs of single bend paths on a grid. - Martin Charles Golumbic; Marina Lipshteyn; Michal Stern (Networks, 2009)

On the bi-enhancement of chordal-bipartite probe graphs. - Elad Cohen; Martin Charles Golumbic; Marina Lipshteyn; Michal Stern (Inf. Process. Lett., 2010)

Graph sandwich problems. - Martin Charles Golumbic (CTW, 2011)

Forward. - Martin Charles Golumbic (Ann. Math. Artif. Intell., 2011)

The chain graph sandwich problem. - Simone Dantas; Celina M. H. de Figueiredo; Martin Charles Golumbic; Sulamita Klein; Frédéric Maffray (Ann. Oper. Res., 2011)

A characterization of chain probe graphs. - Martin Charles Golumbic; Frédéric Maffray; Grégory Morel (Ann. Oper. Res., 2011)

Exploiting graph structure to cope with hard problems (Dagstuhl Seminar 11182). - Andreas Brandstädt; Martin Charles Golumbic; Pinar Heggernes; Ross M. McConnell (Dagstuhl Reports, 2011)

String graphs of k-bend paths on a grid. - Andrei Asinowski; Elad Cohen; Martin Charles Golumbic; Vincent Limouzy; Marina Lipshteyn; Michal Stern (Electron. Notes Discret. Math., 2011)

Path-Bicolorable Graphs. - Andreas Brandstädt; Martin Charles Golumbic; Van Bang Le; Marina Lipshteyn (Graphs Comb., 2011)

Student Poster Session. - Martin Charles Golumbic; Michal Stern; Avivit Levy; Gila Morgenstern (WG, 2012)

Vertex Intersection Graphs of Paths on a Grid. - Andrei Asinowski; Elad Cohen; Martin Charles Golumbic; Vincent Limouzy; Marina Lipshteyn; Michal Stern (J. Graph Algorithms Appl., 2012)

Perspectives on Reasoning About Time. - Martin Charles Golumbic (Ubiquitous Display Environments, 2012)

Approximation Algorithms for B 1-EPG Graphs. - Dror Epstein; Martin Charles Golumbic; Gila Morgenstern (WADS, 2013)

Micro Spitbol. - Robert B. K. Dewar; Martin Charles Golumbic; Clinton F. Goss (CoRR, 2013)

On the Intersection Graphs of Orthogonal Line Segments in the Plane: Characterizations of Some Subclasses of Chordal Graphs. - Martin Charles Golumbic; Bernard Ries (Graphs Comb., 2013)

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". - Martin Charles Golumbic; Marina Lipshteyn; Michal Stern (Networks, 2013)

Boxicity and Separation Dimension. - Manu Basavaraju; L. Sunil Chandran; Martin Charles Golumbic; Rogers Mathew; Deepak Rajendraprasad (WG, 2014)

Characterizations of cographs as intersection graphs of paths on a grid. - Elad Cohen; Martin Charles Golumbic; Bernard Ries (Discret. Appl. Math., 2014)

Co-TT graphs and a characterization of split co-TT graphs. - Martin Charles Golumbic; Nirit Lefel Weingarten; Vincent Limouzy (Discret. Appl. Math., 2014)

Induced Separation Dimension. - Emile Ziedan; Deepak Rajendraprasad; Rogers Mathew; Martin Charles Golumbic; Jérémie Dusart (WG, 2016)

Separation Dimension of Graphs and Hypergraphs. - Manu Basavaraju; L. Sunil Chandran; Martin Charles Golumbic; Rogers Mathew; Deepak Rajendraprasad (Algorithmica, 2016)

A note from the Editor-in-Chief. - Martin Charles Golumbic (Ann. Math. Artif. Intell., 2016)

Posets and VPG Graphs. - Elad Cohen; Martin Charles Golumbic; William T. Trotter; Ruidong Wang (Order, 2016)

Tolerance intersection graphs of degree bounded subtrees of a tree with constant tolerance 2. - Elad Cohen; Martin Charles Golumbic; Marina Lipshteyn; Michal Stern (Discret. Math., 2017)

The Induced Separation Dimension of a Graph. - Emile Ziedan; Deepak Rajendraprasad; Rogers Mathew; Martin Charles Golumbic; Jérémie Dusart (Algorithmica, 2018)

Edge-intersection graphs of boundary-generated paths in a grid. - Martin Charles Golumbic; Gila Morgenstern; Deepak Rajendraprasad (Discret. Appl. Math., 2018)

Total coloring of rooted path graphs. - Martin Charles Golumbic (Inf. Process. Lett., 2018)

Containment Graphs, Posets, and Related Classes of Graphs. - Martin Charles Golumbic; Edward R. Scheinerman (CoRR, 2019)

An Effective Upperbound on Treewidth Using Partial Fill-in of Separators. - Boi Faltings; Martin Charles Golumbic (CoRR, 2019)

Hardness and approximation for L-EPG and B1-EPG graphs. - Dror Epstein; Martin Charles Golumbic; Abhiruk Lahiri; Gila Morgenstern (Discret. Appl. Math., 2020)

The Complexity of Helly-B1 EPG Graph Recognition. - Claudson F. Bornstein; Martin Charles Golumbic; Tanilson D. Santos; Uéverton S. Souza; Jayme Luiz Szwarcfiter (Discret. Math. Theor. Comput. Sci., 2020)

Containment Graphs and Posets of Paths in a Tree: Wheels and Partial Wheels. - Martin Charles Golumbic; Vincent Limouzy (Order, 2021)

On dually-CPT and strong-CPT posets. - Liliana Alcón; Martin Charles Golumbic; Noemí Gudiño; Marisa Gutierrez; Vincent Limouzy (CoRR, 2022)

Containment orders - a lifelong journey. - Martin Charles Golumbic (AKCE Int. J. Graphs Comb., 2024)

ISAIM-2022: international symposium on artificial intelligence and mathematics. - Dimitrios I. Diochnos; Martin Charles Golumbic; Frederick Hoffman (Ann. Math. Artif. Intell., 2024)

On Dually-CPT and Strongly-CPT Posets. - Liliana Alcón; Martin Charles Golumbic; Noemí Gudiño; Marisa Gutierrez; Vincent Limouzy (Order, 2024)

35 years of math and AI. - Martin Charles Golumbic (Ann. Math. Artif. Intell., 2025)