Martin Charles Golumbic

	2012
74		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)
	2011
73		Martin Charles Golumbic: Graph sandwich problems. CTW 2011: 10
72		Martin Charles Golumbic: Forward. Ann. Math. Artif. Intell. 61(1): 1-2 (2011)
71		Simone Dantas, Celina M. Herrera de Figueiredo, Martin Charles Golumbic, Sulamita Klein, Frédéric Maffray: The chain graph sandwich problem. Annals OR 188(1): 133-139 (2011)
70		Martin Charles Golumbic, Frédéric Maffray, Grégory Morel: A characterization of chain probe graphs. Annals OR 188(1): 175-183 (2011)
69		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)
68		Andrei Asinowski, Elad Cohen, Martin Charles Golumbic, Vincent Limouzy, Marina Lipshteyn, Michal Stern: String graphs of k-bend paths on a grid. Electronic Notes in Discrete Mathematics 37: 141-146 (2011)
67		Andreas Brandstädt, Martin Charles Golumbic, Van Bang Le, Marina Lipshteyn: Path-Bicolorable Graphs. Graphs and Combinatorics 27(6): 799-819 (2011)
	2010
66		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)
	2009
65		Martin Charles Golumbic: Landmarks in Algorithmic Graph Theory: A Personal Retrospective. Graph Theory, Computational Intelligence and Thought 2009: 1-14
64		Andreas Brandstädt, Martin Charles Golumbic, Van Bang Le, Marina Lipshteyn: Path-Bicolorable Graphs. Graph Theory, Computational Intelligence and Thought 2009: 172-182
63		Shimon Shrem, Michal Stern, Martin Charles Golumbic: Smallest Odd Holes in Claw-Free Graphs (Extended Abstract). WG 2009: 329-340
62		Martin Charles Golumbic, Marina Lipshteyn, Michal Stern: Intersection models of weakly chordal graphs. Discrete Applied Mathematics 157(9): 2031-2047 (2009)
61		Martin Charles Golumbic, Marina Lipshteyn, Michal Stern: Edge intersection graphs of single bend paths on a grid. Networks 54(3): 130-138 (2009)
	2008
60		Elad Cohen, Martin Charles Golumbic, Marina Lipshteyn, Michal Stern: On the Bi-enhancement of Chordal-bipartite Probe Graphs. CTW 2008: 152-156
59		Elad Cohen, Martin Charles Golumbic, Marina Lipshteyn, Michal Stern: What Is between Chordal and Weakly Chordal Graphs?. WG 2008: 275-286
58		Martin Charles Golumbic, Aviad Mintz, Udi Rotics: An improvement on the complexity of factoring read-once Boolean functions. Discrete Applied Mathematics 156(10): 1633-1636 (2008)
57		Martin Charles Golumbic, Marina Lipshteyn, Michal Stern: Equivalences and the complete hierarchy of intersection graphs of paths in a tree. Discrete Applied Mathematics 156(17): 3203-3215 (2008)
56		Martin Charles Golumbic, Marina Lipshteyn, Michal Stern: The k-edge intersection graphs of paths in a tree. Discrete Applied Mathematics 156(4): 451-461 (2008)
55		Martin Charles Golumbic, Marina Lipshteyn, Michal Stern: Representing edge intersection graphs of paths on degree 4 trees. Discrete Mathematics 308(8): 1381-1387 (2008)
	2007
54		Martin Charles Golumbic, Marina Lipshteyn, Michal Stern: Edge intersection graphs of single bend paths on a grid. CTW 2007: 53-55
53		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)
52		Anne Berry, Martin Charles Golumbic, Marina Lipshteyn: Recognizing Chordal Probe Graphs and Cycle-Bicolorable Graphs. SIAM J. Discrete Math. 21(3): 573-591 (2007)
	2006
51		Martin Charles Golumbic, Marina Lipshteyn, Michal Stern: Finding Intersection Models of Weakly Chordal Graphs. WG 2006: 241-255
50		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. Discrete Applied Mathematics 154(10): 1465-1477 (2006)
49		Martin Charles Golumbic: Twenty Years of EPT Graphs: From Haifa to Rostock. Electronic Notes in Discrete Mathematics 27: 39-40 (2006)
48		Martin Charles Golumbic, Robert E. Jamison: Rank-tolerance graph classes. Journal of Graph Theory 52(4): 317-340 (2006)
	2005
47		Aviad Mintz, Martin Charles Golumbic: Factoring Boolean functions using graph partitioning. Discrete Applied Mathematics 149(1-3): 131-153 (2005)
46		Martin Charles Golumbic, Haim Kaplan, Elad Verbin: On the complexity of cell flipping in permutation diagrams and multiprocessor scheduling problems. Discrete Mathematics 296(1): 25-41 (2005)
45		Martin Charles Golumbic, Aviad Mintz, Udi Rotics: Read-Once Functions Revisited and the Readability Number of a Boolean Function. Electronic Notes in Discrete Mathematics 22: 357-361 (2005)
	2004
44		Martin Charles Golumbic: Graph Theoretic Models for Reasoning About Time. ASIAN 2004: 352-362
43		Anne Berry, Martin Charles Golumbic, Marina Lipshteyn: Two tricks to triangulate chordal probe graphs in polynomial time. SODA 2004: 962-969
42		Martin Charles Golumbic, Marina Lipshteyn: Chordal probe graphs. Discrete Applied Mathematics 143(1-3): 221-237 (2004)
	2003
41		Martin Charles Golumbic, Marina Lipshteyn: Chordal Probe Graphs. WG 2003: 249-260
	2002
40		Martin Charles Golumbic, Assaf Siani: Coloring Algorithms for Tolerance Graphs: Reasoning and Scheduling with Interval Constraints. AISC 2002: 196-207
39		Endre Boros, Martin Charles Golumbic, Vadim E. Levit: On the number of vertices belonging to all maximum stable sets of a graph. Discrete Applied Mathematics 124(1-3): 17-25 (2002)
38		Martin Charles Golumbic, Uri N. Peled: Block duplicate graphs and a hierarchy of chordal graphs. Discrete Applied Mathematics 124(1-3): 67-71 (2002)
	2001
37		Martin Charles Golumbic, Aviad Mintz, Udi Rotics: Factoring and Recognition of Read-Once Functions using Cographs and Normality. DAC 2001: 109-114
36		Martin Charles Golumbic, Tirza Hirst, Moshe Lewenstein: Uniquely Restricted Matchings. Algorithmica 31(2): 139-154 (2001)
	2000
35		Martin Charles Golumbic: 1999 Bar Illan Symposium on the Foundations of Artificial Intelligence. AI Magazine 21(1): 101 (2000)
34		Martin Charles Golumbic: Editor's remarks. Ann. Math. Artif. Intell. 28(1-4): 1-2 (2000)
33		Martin Charles Golumbic, Moshe Lewenstein: New results on induced matchings. Discrete Applied Mathematics 101(1-3): 157-165 (2000)
32		Martin Charles Golumbic, Udi Rotics: On the Clique-Width of Some Perfect Graph Classes. Int. J. Found. Comput. Sci. 11(3): 423-443 (2000)
	1999
31		Martin Charles Golumbic, Aviad Mintz: Factoring logic functions using graph partitioning. ICCAD 1999: 195-199
30		Martin Charles Golumbic, Udi Rotics: On the Clique-Width of Perfect Graph Classes. WG 1999: 135-147
	1998
29		Martin Charles Golumbic, Haim Kaplan: Cell Flipping in Permutation Diagrams. STACS 1998: 577-586
28		Martin Charles Golumbic, Amir Wassermann: Complexity and Algorithms for Graph and Hypergraph Sandwich Problems. Graphs and Combinatorics 14(3): 223-239 (1998)
	1995
27		Martin Charles Golumbic, Haim Kaplan, Ron Shamir: Graph Sandwich Problems. J. Algorithms 19(3): 449-473 (1995)
26		Paul W. Goldberg, Martin Charles Golumbic, Haim Kaplan, Ron Shamir: Four Strikes Against Physical Mapping of DNA. Journal of Computational Biology 2(1): 139-152 (1995)
	1993
25		Martin Charles Golumbic, Haim Kaplan, Ron Shamir: Algorithms and Complexity of Sandwich Problems in Graphs (Extended Abstract). WG 1993: 57-69
24		Martin Charles Golumbic, Renu Laskar: Introduction. Discrete Applied Mathematics 44(1-3): 1-3 (1993)
23		Martin Charles Golumbic, Renu Laskar: Irredundancy in Circular Arc Graphs. Discrete Applied Mathematics 44(1-3): 79-89 (1993)
22		Alexander Belfer, Martin Charles Golumbic: Counting endpoint sequences for interval orders and interval graphs. Discrete Mathematics 114(1-3): 23-39 (1993)
21		Martin Charles Golumbic, Ron Shamir: Complexity and Algorithms for Reasoning about Time: A Graph-Theoretic Approach. J. ACM 40(5): 1108-1133 (1993)
20		Martin Charles Golumbic, Vladimir Rainish: Instruction Scheduling Across Control Flow. Scientific Programming 2(3): 1-5 (1993)
	1992
19		Martin Charles Golumbic, Ron Shamir: Algorithms and Complexity for Reasoning about Time. AAAI 1992: 741-747
18		Martin Charles Golumbic: Reasoning About Time. AISMC 1992: 276
17		Martin Charles Golumbic, Ron Shamir: Interval Graphs, Interval Orders and the Consistency of Temporal Events. ISTCS 1992: 32-42
	1990
16		Ronen Feldman, Martin Charles Golumbic: Ineractive Scheduling as a Constraint Satisfiability Problem. Ann. Math. Artif. Intell. 1: 49-73 (1990)
15		Ronen Feldman, Martin Charles Golumbic: Optimization Algorithms for Student Scheduling via Constraint Satisfiability. Comput. J. 33(4): 356-364 (1990)
14		Martin Charles Golumbic, Vladimir Rainish: Instruction Scheduling Beyond Basic Blocks. IBM Journal of Research and Development 34(1): 93-97 (1990)
	1989
13		Ronen Feldman, Martin Charles Golumbic: Constraint Satisfiability Algorithms for Interactive Student Scheduling. IJCAI 1989: 1010-1016
12		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
11		Ido Dagan, Martin Charles Golumbic, Ron Y. Pinter: Trapezoid graphs and their coloring. Discrete Applied Mathematics 21(1): 35-46 (1988)
10		Martin Charles Golumbic: Algorithmic aspects of intersection graphs and representation hypergraphs. Graphs and Combinatorics 4(1): 307-321 (1988)
9		Martin Charles Golumbic, Peter L. Hammer: Stability in Circular Arc Graphs. J. Algorithms 9(3): 314-320 (1988)
	1987
8		Martin Charles Golumbic: A General Method for Avoiding Cycling in a Network. Inf. Process. Lett. 24(4): 251-253 (1987)
	1985
7		Martin Charles Golumbic: Interval graphs and related topics. Discrete Mathematics 55(2): 113-121 (1985)
6		Martin Charles Golumbic, Robert E. Jamison: Edge and vertex intersection of paths in a tree. Discrete Mathematics 55(2): 151-159 (1985)
5		Martin Charles Golumbic, Robert E. Jamison: The edge intersection graphs of paths in a tree. J. Comb. Theory, Ser. B 38(1): 8-22 (1985)
	1983
4		Martin Charles Golumbic, Doron Rotem, Jorge Urrutia: Comparability graphs and intersection graphs. Discrete Mathematics 43(1): 37-46 (1983)
3		Mark A. Buckingham, Martin Charles Golumbic: Partitionable graphs, circle graphs, and the berge strong perfect graph conjecture. Discrete Mathematics 44(1): 45-54 (1983)
	1977
2		Martin Charles Golumbic: Comparability graphs and a new matroid. J. Comb. Theory, Ser. B 22(1): 68-90 (1977)
	1976
1		Martin Charles Golumbic: Combinatorial Merging. IEEE Trans. Computers 25(11): 1164-1167 (1976)

Coauthor Index

1	Andrei Asinowski	[68] [74]
2	Alexander Belfer	[22]
3	David Bernstein	[12]
4	Anne Berry	[43] [52] [53]
5	Endre Boros	[39]
6	Andreas Brandstädt	[64] [67] [69]
7	Mark A. Buckingham	[3]
8	Elad Cohen	[59] [60] [66] [68] [74]
9	Ido Dagan	[11]
10	Simone Dantas	[71]
11	Ronen Feldman	[13] [15] [16]
12	Celina M. Herrera de Figueiredo	[71]
13	Paul W. Goldberg	[26]
14	Dina Q. Goldin	[12]
15	Peter L. Hammer (Peter Ladislaw Hammer)	[9]
16	Pinar Heggernes	[69]
17	Tirza Hirst	[36]
18	Robert E. Jamison	[5] [6] [48]
19	Haim Kaplan	[25] [26] [27] [29] [46]
20	Sulamita Klein	[71]
21	Hugo Krawczyk	[12]
22	Renu Laskar (Renu C. Laskar)	[23] [24]
23	Van Bang Le	[64] [67]
24	Vadim E. Levit	[39]
25	Moshe Lewenstein	[33] [36]
26	Vincent Limouzy	[68] [74]
27	Marina Lipshteyn	[41] [42] [43] [51] [52] [54] [55] [56] [57] [59] [60] [61] [62] [64] [66] [67] [68] [74]
28	Frédéric Maffray	[70] [71]
29	Yishay Mansour	[12]
30	Ross M. McConnell	[69]
31	Aviad Mintz	[31] [37] [45] [47] [50] [58]
32	Grégory Morel	[70]
33	Itai Nahshon	[12]
34	Uri N. Peled	[38]
35	Ron Y. Pinter	[11] [12]
36	Maurice Pouzet	[53]
37	Vladimir Rainish	[14] [20]
38	Doron Rotem	[4]
39	Udi Rotics	[30] [32] [37] [45] [50] [58]
40	Eric SanJuan	[53]
41	Ron Shamir	[17] [19] [21] [25] [26] [27]
42	Shimon Shrem	[63]
43	Assaf Siani	[40]
44	Michal Stern	[51] [54] [55] [56] [57] [59] [60] [61] [62] [63] [66] [68] [74]
45	Jorge Urrutia	[4]
46	Elad Verbin	[46]
47	Amir Wassermann	[28]

Colors in the list of coauthors

Last update Wed May 30 22:34:44 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page