Martin Charles Golumbic

113 papers A* 5A 2B 11C 3Misc 1Journal 83Unranked 6

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