default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMartin Charles Golumbic
Person information
- affiliation: University of Haifa, Israel
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j75]Martin Charles Golumbic:
Containment orders - a lifelong journey. AKCE Int. J. Graphs Comb. 21(2): 209-217 (2024)- [j74]Dimitrios I. Diochnos, Martin Charles Golumbic, Frederick Hoffman:
ISAIM-2022: international symposium on artificial intelligence and mathematics. Ann. Math. Artif. Intell. 92(1): 1-4 (2024) - [j73]Liliana Alcón, Martin Charles Golumbic, Noemí Gudiño, Marisa Gutierrez, Vincent Limouzy
:
On Dually-CPT and Strongly-CPT Posets. Order 41(3): 737-748 (2024) - 2022
- [i7]Liliana Alcón, Martin Charles Golumbic, Noemí Gudiño, Marisa Gutierrez, Vincent Limouzy:
On dually-CPT and strong-CPT posets. CoRR abs/2204.04729 (2022) - 2021
- [j72]Martin Charles Golumbic, Vincent Limouzy:
Containment Graphs and Posets of Paths in a Tree: Wheels and Partial Wheels. Order 38(1): 37-48 (2021) - 2020
- [j71]Dror Epstein, Martin Charles Golumbic, Abhiruk Lahiri, Gila Morgenstern:
Hardness and approximation for L-EPG and B1-EPG graphs. Discret. Appl. Math. 281: 224-228 (2020) - [j70]Claudson F. Bornstein, Martin Charles Golumbic, Tanilson D. Santos, Uéverton S. Souza, Jayme Luiz Szwarcfiter:
The Complexity of Helly-B1 EPG Graph Recognition. Discret. Math. Theor. Comput. Sci. 22(1) (2020)
2010 – 2019
- 2019
- [i6]Claudson F. Bornstein, Martin Charles Golumbic, Tanilson D. Santos, Uéverton S. Souza, Jayme Luiz Szwarcfiter:
The Complexity of Helly-B1 EPG Graph Recognition. CoRR abs/1906.11185 (2019) - [i5]Martin Charles Golumbic, Edward R. Scheinerman:
Containment Graphs, Posets, and Related Classes of Graphs. CoRR abs/1907.07414 (2019) - [i4]Boi Faltings, Martin Charles Golumbic:
An Effective Upperbound on Treewidth Using Partial Fill-in of Separators. CoRR abs/1909.02789 (2019) - 2018
- [j69]Emile Ziedan, Deepak Rajendraprasad, Rogers Mathew, Martin Charles Golumbic, Jérémie Dusart:
The Induced Separation Dimension of a Graph. Algorithmica 80(10): 2834-2848 (2018) - [j68]Martin Charles Golumbic, Gila Morgenstern, Deepak Rajendraprasad:
Edge-intersection graphs of boundary-generated paths in a grid. Discret. Appl. Math. 236: 214-222 (2018) - [j67]Martin Charles Golumbic:
Total coloring of rooted path graphs. Inf. Process. Lett. 135: 73-76 (2018) - 2017
- [j66]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): 209-222 (2017) - 2016
- [j65]Manu Basavaraju, L. Sunil Chandran, Martin Charles Golumbic, Rogers Mathew, Deepak Rajendraprasad:
Separation Dimension of Graphs and Hypergraphs. Algorithmica 75(1): 187-204 (2016) - [j64]Martin Charles Golumbic:
A note from the Editor-in-Chief. Ann. Math. Artif. Intell. 77(1-2): 1-2 (2016) - [j63]Elad Cohen, Martin Charles Golumbic, William T. Trotter, Ruidong Wang:
Posets and VPG Graphs. Order 33(1): 39-49 (2016) - [c27]Emile Ziedan, Deepak Rajendraprasad, Rogers Mathew, Martin Charles Golumbic, Jérémie Dusart:
Induced Separation Dimension. WG 2016: 121-132 - 2014
- [j62]Martin Charles Golumbic, Nirit Lefel Weingarten, Vincent Limouzy:
Co-TT graphs and a characterization of split co-TT graphs. Discret. Appl. Math. 165: 168-174 (2014) - [j61]Elad Cohen, Martin Charles Golumbic, Bernard Ries:
Characterizations of cographs as intersection graphs of paths on a grid. Discret. Appl. Math. 178: 46-57 (2014) - [c26]Manu Basavaraju, L. Sunil Chandran, Martin Charles Golumbic, Rogers Mathew, Deepak Rajendraprasad:
Boxicity and Separation Dimension. WG 2014: 81-92 - [i3]Manu Basavaraju, L. Sunil Chandran, Martin Charles Golumbic, Rogers Mathew, Deepak Rajendraprasad:
Boxicity and separation dimension. CoRR abs/1404.4486 (2014) - 2013
- [j60]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): 499-517 (2013) - [j59]Martin Charles Golumbic, Marina Lipshteyn, Michal Stern:
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". Networks 62(2): 161-163 (2013) - [c25]Dror Epstein, Martin Charles Golumbic, Gila Morgenstern:
Approximation Algorithms for B 1-EPG Graphs. WADS 2013: 328-340 - [i2]Robert B. K. Dewar, Martin Charles Golumbic, Clinton F. Goss:
Micro Spitbol. CoRR abs/1308.6096 (2013) - 2012
- [j58]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): 129-150 (2012) - [c24]Martin Charles Golumbic, Michal Stern, Avivit Levy, Gila Morgenstern:
Student Poster Session. WG 2012: 4-6 - [p1]Martin Charles Golumbic:
Perspectives on Reasoning About Time. Ubiquitous Display Environments 2012: 53-70 - [e1]Martin Charles Golumbic, Michal Stern, Avivit Levy, Gila Morgenstern:
Graph-Theoretic Concepts in Computer Science - 38th International Workshop, WG 2012, Jerusalem, Israel, June 26-28, 2012, Revised Selcted Papers. Lecture Notes in Computer Science 7551, Springer 2012, ISBN 978-3-642-34610-1 [contents] - 2011
- [j57]Martin Charles Golumbic:
Forward. Ann. Math. Artif. Intell. 61(1): 1-2 (2011) - [j56]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): 133-139 (2011) - [j55]Martin Charles Golumbic, Frédéric Maffray, Grégory Morel:
A characterization of chain probe graphs. Ann. Oper. Res. 188(1): 175-183 (2011) - [j54]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: 141-146 (2011) - [j53]Andreas Brandstädt, Martin Charles Golumbic, Van Bang Le, Marina Lipshteyn:
Path-Bicolorable Graphs. Graphs Comb. 27(6): 799-819 (2011) - [c23]Martin Charles Golumbic:
Graph sandwich problems. CTW 2011: 10 - [i1]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): 29-46 (2011) - 2010
- [j52]Elad Cohen, Martin Charles Golumbic, Marina Lipshteyn, Michal Stern:
On the bi-enhancement of chordal-bipartite probe graphs. Inf. Process. Lett. 110(5): 193-197 (2010)
2000 – 2009
- 2009
- [j51]Martin Charles Golumbic, Marina Lipshteyn, Michal Stern:
Intersection models of weakly chordal graphs. Discret. Appl. Math. 157(9): 2031-2047 (2009) - [j50]Martin Charles Golumbic, Marina Lipshteyn, Michal Stern:
Edge intersection graphs of single bend paths on a grid. Networks 54(3): 130-138 (2009) - [c22]Martin Charles Golumbic:
Landmarks in Algorithmic Graph Theory: A Personal Retrospective. Graph Theory, Computational Intelligence and Thought 2009: 1-14 - [c21]Andreas Brandstädt, Martin Charles Golumbic, Van Bang Le, Marina Lipshteyn:
Path-Bicolorable Graphs. Graph Theory, Computational Intelligence and Thought 2009: 172-182 - [c20]Shimon Shrem, Michal Stern, Martin Charles Golumbic:
Smallest Odd Holes in Claw-Free Graphs (Extended Abstract). WG 2009: 329-340 - 2008
- [b1]Martin Charles Golumbic:
Fighting Terror Online - The Convergence of Security, Technology, and the Law. Springer 2008, ISBN 978-0-387-73577-1, pp. I-XIII, 1-178 - [j49]Martin Charles Golumbic, Marina Lipshteyn, Michal Stern:
The k-edge intersection graphs of paths in a tree. Discret. Appl. Math. 156(4): 451-461 (2008) - [j48]Martin Charles Golumbic, Aviad Mintz, Udi Rotics:
An improvement on the complexity of factoring read-once Boolean functions. Discret. Appl. Math. 156(10): 1633-1636 (2008) - [j47]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): 3203-3215 (2008) - [j46]Martin Charles Golumbic, Marina Lipshteyn, Michal Stern:
Representing edge intersection graphs of paths on degree 4 trees. Discret. Math. 308(8): 1381-1387 (2008) - [c19]Elad Cohen, Martin Charles Golumbic, Marina Lipshteyn, Michal Stern:
On the Bi-enhancement of Chordal-bipartite Probe Graphs. CTW 2008: 152-156 - [c18]Elad Cohen, Martin Charles Golumbic, Marina Lipshteyn, Michal Stern:
What Is between Chordal and Weakly Chordal Graphs?. WG 2008: 275-286 - 2007
- [j45]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): 1-4 (2007) - [j44]Anne Berry, Martin Charles Golumbic, Marina Lipshteyn:
Recognizing Chordal Probe Graphs and Cycle-Bicolorable Graphs. SIAM J. Discret. Math. 21(3): 573-591 (2007) - [c17]Martin Charles Golumbic, Marina Lipshteyn, Michal Stern:
Edge intersection graphs of single bend paths on a grid. CTW 2007: 53-55 - 2006
- [j43]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): 1465-1477 (2006) - [j42]Martin Charles Golumbic:
Twenty Years of EPT Graphs: From Haifa to Rostock. Electron. Notes Discret. Math. 27: 39-40 (2006) - [j41]Martin Charles Golumbic, Robert E. Jamison:
Rank-tolerance graph classes. J. Graph Theory 52(4): 317-340 (2006) - [c16]Martin Charles Golumbic, Marina Lipshteyn, Michal Stern:
Finding Intersection Models of Weakly Chordal Graphs. WG 2006: 241-255 - 2005
- [j40]Aviad Mintz, Martin Charles Golumbic:
Factoring Boolean functions using graph partitioning. Discret. Appl. Math. 149(1-3): 131-153 (2005) - [j39]Martin Charles Golumbic, Haim Kaplan, Elad Verbin:
On the complexity of cell flipping in permutation diagrams and multiprocessor scheduling problems. Discret. Math. 296(1): 25-41 (2005) - [j38]Martin Charles Golumbic, Aviad Mintz, Udi Rotics:
Read-Once Functions Revisited and the Readability Number of a Boolean Function. Electron. Notes Discret. Math. 22: 357-361 (2005) - 2004
- [j37]Martin Charles Golumbic, Marina Lipshteyn:
Chordal probe graphs. Discret. Appl. Math. 143(1-3): 221-237 (2004) - [c15]Martin Charles Golumbic:
Graph Theoretic Models for Reasoning About Time. ASIAN 2004: 352-362 - [c14]Anne Berry, Martin Charles Golumbic, Marina Lipshteyn:
Two tricks to triangulate chordal probe graphs in polynomial time. SODA 2004: 962-969 - 2003
- [c13]Martin Charles Golumbic, Marina Lipshteyn:
Chordal Probe Graphs. WG 2003: 249-260 - 2002
- [j36]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): 17-25 (2002) - [j35]Martin Charles Golumbic, Uri N. Peled:
Block duplicate graphs and a hierarchy of chordal graphs. Discret. Appl. Math. 124(1-3): 67-71 (2002) - [j34]Martin Charles Golumbic, Robert E. Jamison, Ann N. Trenk:
Archimedean ϕ -tolerance graphs. J. Graph Theory 41(3): 179-194 (2002) - [c12]Martin Charles Golumbic, Assaf Siani:
Coloring Algorithms for Tolerance Graphs: Reasoning and Scheduling with Interval Constraints. AISC 2002: 196-207 - 2001
- [j33]Martin Charles Golumbic, Tirza Hirst, Moshe Lewenstein:
Uniquely Restricted Matchings. Algorithmica 31(2): 139-154 (2001) - [c11]Martin Charles Golumbic, Aviad Mintz, Udi Rotics:
Factoring and Recognition of Read-Once Functions using Cographs and Normality. DAC 2001: 109-114 - 2000
- [j32]Martin Charles Golumbic:
1999 Bar Illan Symposium on the Foundations of Artificial Intelligence. AI Mag. 21(1): 101 (2000) - [j31]Martin Charles Golumbic:
Editor's remarks. Ann. Math. Artif. Intell. 28(1-4): 1-2 (2000) - [j30]Martin Charles Golumbic, Moshe Lewenstein:
New results on induced matchings. Discret. Appl. Math. 101(1-3): 157-165 (2000) - [j29]Martin Charles Golumbic, Udi Rotics:
On the Clique-Width of Some Perfect Graph Classes. Int. J. Found. Comput. Sci. 11(3): 423-443 (2000)
1990 – 1999
- 1999
- [c10]Martin Charles Golumbic, Aviad Mintz:
Factoring logic functions using graph partitioning. ICCAD 1999: 195-199 - [c9]Martin Charles Golumbic, Udi Rotics:
On the Clique-Width of Perfect Graph Classes. WG 1999: 135-147 - 1998
- [j28]Martin Charles Golumbic, Amir Wassermann:
Complexity and Algorithms for Graph and Hypergraph Sandwich Problems. Graphs Comb. 14(3): 223-239 (1998) - [c8]Martin Charles Golumbic, Haim Kaplan:
Cell Flipping in Permutation Diagrams. STACS 1998: 577-586 - 1995
- [j27]Martin Charles Golumbic, Haim Kaplan, Ron Shamir:
Graph Sandwich Problems. J. Algorithms 19(3): 449-473 (1995) - [j26]Paul W. Goldberg, Martin Charles Golumbic, Haim Kaplan, Ron Shamir:
Four Strikes Against Physical Mapping of DNA. J. Comput. Biol. 2(1): 139-152 (1995) - 1993
- [j25]Martin Charles Golumbic, Renu C. Laskar:
Introduction. Discret. Appl. Math. 44(1-3): 1-3 (1993) - [j24]Martin Charles Golumbic, Renu C. Laskar:
Irredundancy in Circular Arc Graphs. Discret. Appl. Math. 44(1-3): 79-89 (1993) - [j23]Alexander Belfer, Martin Charles Golumbic:
Counting endpoint sequences for interval orders and interval graphs. Discret. Math. 114(1-3): 23-39 (1993) - [j22]Martin Charles Golumbic, Ron Shamir:
Complexity and Algorithms for Reasoning about Time: A Graph-Theoretic Approach. J. ACM 40(5): 1108-1133 (1993) - [j21]Martin Charles Golumbic, Vladimir Rainish:
Instruction Scheduling Across Control Flow. Sci. Program. 2(3): 1-5 (1993) - [c7]Martin Charles Golumbic, Haim Kaplan, Ron Shamir:
Algorithms and Complexity of Sandwich Problems in Graphs (Extended Abstract). WG 1993: 57-69 - 1992
- [c6]Martin Charles Golumbic, Ron Shamir:
Algorithms and Complexity for Reasoning about Time. AAAI 1992: 741-747 - [c5]Martin Charles Golumbic:
Reasoning About Time. AISMC 1992: 276 - [c4]Martin Charles Golumbic, Ron Shamir:
Interval Graphs, Interval Orders and the Consistency of Temporal Events. ISTCS 1992: 32-42 - 1991
- [j20]Martin Charles Golumbic, Moshe Markovich, Michael L. Tiomkin:
A knowledge representation language for university requirements. Decis. Support Syst. 7(1): 33-45 (1991) - 1990
- [j19]Ronen Feldman, Martin Charles Golumbic:
Ineractive Scheduling as a Constraint Satisfiability Problem. Ann. Math. Artif. Intell. 1: 49-73 (1990) - [j18]Ronen Feldman, Martin Charles Golumbic:
Optimization Algorithms for Student Scheduling via Constraint Satisfiability. Comput. J. 33(4): 356-364 (1990) - [j17]Martin Charles Golumbic, Vladimir Rainish:
Instruction Scheduling Beyond Basic Blocks. IBM J. Res. Dev. 34(1): 93-97 (1990) - [c3]Alexander Belfer, Martin Charles Golumbic:
A combinatorial approach to temporal reasoning. Jerusalem Conference on Information Technology 1990: 774-780
1980 – 1989
- 1989
- [c2]Ronen Feldman, Martin Charles Golumbic:
Constraint Satisfiability Algorithms for Interactive Student Scheduling. IJCAI 1989: 1010-1016 - [c1]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: 258-263 - 1988
- [j16]Ido Dagan, Martin Charles Golumbic, Ron Y. Pinter:
Trapezoid graphs and their coloring. Discret. Appl. Math. 21(1): 35-46 (1988) - [j15]Martin Charles Golumbic:
Algorithmic aspects of intersection graphs and representation hypergraphs. Graphs Comb. 4(1): 307-321 (1988) - [j14]Martin Charles Golumbic, Peter L. Hammer:
Stability in Circular Arc Graphs. J. Algorithms 9(3): 314-320 (1988) - 1987
- [j13]Martin Charles Golumbic:
A General Method for Avoiding Cycling in a Network. Inf. Process. Lett. 24(4): 251-253 (1987) - 1985
- [j12]Martin Charles Golumbic:
Interval graphs and related topics. Discret. Math. 55(2): 113-121 (1985) - [j11]Martin Charles Golumbic, Robert E. Jamison:
Edge and vertex intersection of paths in a tree. Discret. Math. 55(2): 151-159 (1985) - [j10]Martin Charles Golumbic, Robert E. Jamison:
The edge intersection graphs of paths in a tree. J. Comb. Theory B 38(1): 8-22 (1985) - 1984
- [j9]Martin Charles Golumbic, Clyde L. Monma, William T. Trotter:
Tolerance graphs. Discret. Appl. Math. 9(2): 157-170 (1984) - 1983
- [j8]Martin Charles Golumbic, Doron Rotem, Jorge Urrutia:
Comparability graphs and intersection graphs. Discret. Math. 43(1): 37-46 (1983) - [j7]Mark A. Buckingham, Martin Charles Golumbic:
Partitionable graphs, circle graphs, and the berge strong perfect graph conjecture. Discret. Math. 44(1): 45-54 (1983)
1970 – 1979
- 1979
- [j6]Martin Charles Golumbic, Yehoshua Perl:
Generalized fibonacci maximum path graphs. Discret. Math. 28(3): 237-245 (1979) - 1978
- [j5]Martin Charles Golumbic:
Trivially perfect graphs. Discret. Math. 24(1): 105-107 (1978) - [j4]Martin Charles Golumbic, Clinton F. Goss:
Perfect Elimination and Chordal Bipartite Graphs. J. Graph Theory 2(2): 155-163 (1978) - 1977
- [j3]Martin Charles Golumbic:
The complexity of comparability graph recognition and coloring. Computing 18(3): 199-208 (1977) - [j2]Martin Charles Golumbic:
Comparability graphs and a new matroid. J. Comb. Theory B 22(1): 68-90 (1977) - 1976
- [j1]Martin Charles Golumbic:
Combinatorial Merging. IEEE Trans. Computers 25(11): 1164-1167 (1976)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-26 23:51 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
