Martin Charles Golumbic

2008
48	EE	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)
47	EE	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
46	EE	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)
2006
45	EE	Martin Charles Golumbic, Marina Lipshteyn, Michal Stern: Finding Intersection Models of Weakly Chordal Graphs. WG 2006: 241-255
44	EE	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)
43	EE	Martin Charles Golumbic, Robert E. Jamison: Rank-tolerance graph classes. Journal of Graph Theory 52(4): 317-340 (2006)
2005
42	EE	Aviad Mintz, Martin Charles Golumbic: Factoring Boolean functions using graph partitioning. Discrete Applied Mathematics 149(1-3): 131-153 (2005)
41	EE	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)
2004
40	EE	Martin Charles Golumbic: Graph Theoretic Models for Reasoning About Time. ASIAN 2004: 352-362
39	EE	Anne Berry, Martin Charles Golumbic, Marina Lipshteyn: Two tricks to triangulate chordal probe graphs in polynomial time. SODA 2004: 962-969
38	EE	Martin Charles Golumbic, Marina Lipshteyn: Chordal probe graphs. Discrete Applied Mathematics 143(1-3): 221-237 (2004)
2003
37	EE	Martin Charles Golumbic, Marina Lipshteyn: Chordal Probe Graphs. WG 2003: 249-260
2002
36	EE	Martin Charles Golumbic, Assaf Siani: Coloring Algorithms for Tolerance Graphs: Reasoning and Scheduling with Interval Constraints. AISC 2002: 196-207
35		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)
34		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
33	EE	Martin Charles Golumbic, Aviad Mintz, Udi Rotics: Factoring and Recognition of Read-Once Functions using Cographs and Normality. DAC 2001: 109-114
32	EE	Martin Charles Golumbic, Tirza Hirst, Moshe Lewenstein: Uniquely Restricted Matchings. Algorithmica 31(2): 139-154 (2001)
2000
31		Martin Charles Golumbic: 1999 Bar Illan Symposium on the Foundations of Artificial Intelligence. AI Magazine 21(1): 101 (2000)
30		Martin Charles Golumbic: Editor's remarks. Ann. Math. Artif. Intell. 28(1-4): 1-2 (2000)
29		Martin Charles Golumbic, Moshe Lewenstein: New results on induced matchings. Discrete Applied Mathematics 101(1-3): 157-165 (2000)
28		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
27	EE	Martin Charles Golumbic, Aviad Mintz: Factoring logic functions using graph partitioning. ICCAD 1999: 195-199
26	EE	Martin Charles Golumbic, Udi Rotics: On the Clique-Width of Perfect Graph Classes. WG 1999: 135-147
1998
25		Martin Charles Golumbic, Haim Kaplan: Cell Flipping in Permutation Diagrams. STACS 1998: 577-586
1995
24		Martin Charles Golumbic, Haim Kaplan, Ron Shamir: Graph Sandwich Problems. J. Algorithms 19(3): 449-473 (1995)
23		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
22		Martin Charles Golumbic, Haim Kaplan, Ron Shamir: Algorithms and Complexity of Sandwich Problems in Graphs (Extended Abstract). WG 1993: 57-69
21		Martin Charles Golumbic, Renu Laskar: Introduction. Discrete Applied Mathematics 44(1-3): 1-3 (1993)
20	EE	Martin Charles Golumbic, Renu Laskar: Irredundancy in Circular Arc Graphs. Discrete Applied Mathematics 44(1-3): 79-89 (1993)
19	EE	Alexander Belfer, Martin Charles Golumbic: Counting endpoint sequences for interval orders and interval graphs. Discrete Mathematics 114(1-3): 23-39 (1993)
18	EE	Martin Charles Golumbic, Ron Shamir: Complexity and Algorithms for Reasoning about Time: A Graph-Theoretic Approach. J. ACM 40(5): 1108-1133 (1993)
1992
17		Martin Charles Golumbic, Ron Shamir: Algorithms and Complexity for Reasoning about Time. AAAI 1992: 741-747
16		Martin Charles Golumbic: Reasoning About Time. AISMC 1992: 276
15		Martin Charles Golumbic, Ron Shamir: Interval Graphs, Interval Orders and the Consistency of Temporal Events. ISTCS 1992: 32-42
1990
14		Ronen Feldman, Martin Charles Golumbic: Ineractive Scheduling as a Constraint Satisfiability Problem. Ann. Math. Artif. Intell. 1: 49-73 (1990)
13		Ronen Feldman, Martin Charles Golumbic: Optimization Algorithms for Student Scheduling via Constraint Satisfiability. Comput. J. 33(4): 356-364 (1990)
12		Martin Charles Golumbic, Vladimir Rainish: Instruction Scheduling Beyond Basic Blocks. IBM Journal of Research and Development 34(1): 93-97 (1990)
1989
11		Ronen Feldman, Martin Charles Golumbic: Constraint Satisfiability Algorithms for Interactive Student Scheduling. IJCAI 1989: 1010-1016
10		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
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	EE	Martin Charles Golumbic: Interval graphs and related topics. Discrete Mathematics 55(2): 113-121 (1985)
6	EE	Martin Charles Golumbic, Robert E. Jamison: Edge and vertex intersection of paths in a tree. Discrete Mathematics 55(2): 151-159 (1985)
5	EE	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	EE	Martin Charles Golumbic, Doron Rotem, Jorge Urrutia: Comparability graphs and intersection graphs. Discrete Mathematics 43(1): 37-46 (1983)
3	EE	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	EE	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	Alexander Belfer	[19]
2	David Bernstein	[10]
3	Anne Berry	[39] [46]
4	Endre Boros	[35]
5	Mark A. Buckingham	[3]
6	Ronen Feldman	[11] [13] [14]
7	Paul W. Goldberg	[23]
8	Dina Q. Goldin	[10]
9	Peter L. Hammer	[9]
10	Tirza Hirst	[32]
11	Robert E. Jamison	[5] [6] [43]
12	Haim Kaplan	[22] [23] [24] [25] [41]
13	Hugo Krawczyk	[10]
14	Renu Laskar (Renu C. Laskar)	[20] [21]
15	Vadim E. Levit	[35]
16	Moshe Lewenstein	[29] [32]
17	Marina Lipshteyn	[37] [38] [39] [45] [47] [48]
18	Yishay Mansour	[10]
19	Aviad Mintz	[27] [33] [42] [44]
20	Itai Nahshon	[10]
21	Uri N. Peled	[34]
22	Ron Y. Pinter	[10]
23	Maurice Pouzet	[46]
24	Vladimir Rainish	[12]
25	Doron Rotem	[4]
26	Udi Rotics	[26] [28] [33] [44]
27	Eric SanJuan	[46]
28	Ron Shamir	[15] [17] [18] [22] [23] [24]
29	Assaf Siani	[36]
30	Michal Stern	[45] [47] [48]
31	Jorge Urrutia	[4]
32	Elad Verbin	[41]

Colors in the list of coauthors