dblp.uni-trier.dewww.uni-trier.de

Martin Charles Golumbic Vis

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo
Home Page - Biographical Citations

*2009
61EEMartin Charles Golumbic: Landmarks in Algorithmic Graph Theory: A Personal Retrospective. Graph Theory, Computational Intelligence and Thought 2009: 1-14
60EEAndreas Brandstädt, Martin Charles Golumbic, Van Bang Le, Marina Lipshteyn: Path-Bicolorable Graphs. Graph Theory, Computational Intelligence and Thought 2009: 172-182
59EEMartin Charles Golumbic, Marina Lipshteyn, Michal Stern: Intersection models of weakly chordal graphs. Discrete Applied Mathematics 157(9): 2031-2047 (2009)
2008
58 Elad Cohen, Martin Charles Golumbic, Marina Lipshteyn, Michal Stern: On the Bi-enhancement of Chordal-bipartite Probe Graphs. CTW 2008: 152-156
57EEElad Cohen, Martin Charles Golumbic, Marina Lipshteyn, Michal Stern: What Is between Chordal and Weakly Chordal Graphs?. WG 2008: 275-286
56EEMartin 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)
55EEMartin 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)
54EEMartin Charles Golumbic, Marina Lipshteyn, Michal Stern: The k-edge intersection graphs of paths in a tree. Discrete Applied Mathematics 156(4): 451-461 (2008)
53EEMartin Charles Golumbic, Marina Lipshteyn, Michal Stern: Representing edge intersection graphs of paths on degree 4 trees. Discrete Mathematics 308(8): 1381-1387 (2008)
2007
52 Martin Charles Golumbic, Marina Lipshteyn, Michal Stern: Edge intersection graphs of single bend paths on a grid. CTW 2007: 53-55
51EEAnne 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)
50EEAnne Berry, Martin Charles Golumbic, Marina Lipshteyn: Recognizing Chordal Probe Graphs and Cycle-Bicolorable Graphs. SIAM J. Discrete Math. 21(3): 573-591 (2007)
2006
49EEMartin Charles Golumbic, Marina Lipshteyn, Michal Stern: Finding Intersection Models of Weakly Chordal Graphs. WG 2006: 241-255
48EEMartin 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)
47EEMartin Charles Golumbic: Twenty Years of EPT Graphs: From Haifa to Rostock. Electronic Notes in Discrete Mathematics 27: 39-40 (2006)
46EEMartin Charles Golumbic, Robert E. Jamison: Rank-tolerance graph classes. Journal of Graph Theory 52(4): 317-340 (2006)
2005
45EEAviad Mintz, Martin Charles Golumbic: Factoring Boolean functions using graph partitioning. Discrete Applied Mathematics 149(1-3): 131-153 (2005)
44EEMartin 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)
43EEMartin 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
42EEMartin Charles Golumbic: Graph Theoretic Models for Reasoning About Time. ASIAN 2004: 352-362
41EEAnne Berry, Martin Charles Golumbic, Marina Lipshteyn: Two tricks to triangulate chordal probe graphs in polynomial time. SODA 2004: 962-969
40EEMartin Charles Golumbic, Marina Lipshteyn: Chordal probe graphs. Discrete Applied Mathematics 143(1-3): 221-237 (2004)
2003
39EEMartin Charles Golumbic, Marina Lipshteyn: Chordal Probe Graphs. WG 2003: 249-260
2002
38EEMartin Charles Golumbic, Assaf Siani: Coloring Algorithms for Tolerance Graphs: Reasoning and Scheduling with Interval Constraints. AISC 2002: 196-207
37 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)
36 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
35EEMartin Charles Golumbic, Aviad Mintz, Udi Rotics: Factoring and Recognition of Read-Once Functions using Cographs and Normality. DAC 2001: 109-114
34EEMartin Charles Golumbic, Tirza Hirst, Moshe Lewenstein: Uniquely Restricted Matchings. Algorithmica 31(2): 139-154 (2001)
2000
33 Martin Charles Golumbic: 1999 Bar Illan Symposium on the Foundations of Artificial Intelligence. AI Magazine 21(1): 101 (2000)
32 Martin Charles Golumbic: Editor's remarks. Ann. Math. Artif. Intell. 28(1-4): 1-2 (2000)
31 Martin Charles Golumbic, Moshe Lewenstein: New results on induced matchings. Discrete Applied Mathematics 101(1-3): 157-165 (2000)
30 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
29EEMartin Charles Golumbic, Aviad Mintz: Factoring logic functions using graph partitioning. ICCAD 1999: 195-199
28EEMartin Charles Golumbic, Udi Rotics: On the Clique-Width of Perfect Graph Classes. WG 1999: 135-147
1998
27EEMartin Charles Golumbic, Haim Kaplan: Cell Flipping in Permutation Diagrams. STACS 1998: 577-586
1995
26 Martin Charles Golumbic, Haim Kaplan, Ron Shamir: Graph Sandwich Problems. J. Algorithms 19(3): 449-473 (1995)
25 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
24EEMartin Charles Golumbic, Haim Kaplan, Ron Shamir: Algorithms and Complexity of Sandwich Problems in Graphs (Extended Abstract). WG 1993: 57-69
23 Martin Charles Golumbic, Renu Laskar: Introduction. Discrete Applied Mathematics 44(1-3): 1-3 (1993)
22EEMartin Charles Golumbic, Renu Laskar: Irredundancy in Circular Arc Graphs. Discrete Applied Mathematics 44(1-3): 79-89 (1993)
21EEAlexander Belfer, Martin Charles Golumbic: Counting endpoint sequences for interval orders and interval graphs. Discrete Mathematics 114(1-3): 23-39 (1993)
20EEMartin Charles Golumbic, Ron Shamir: Complexity and Algorithms for Reasoning about Time: A Graph-Theoretic Approach. J. ACM 40(5): 1108-1133 (1993)
19EEMartin Charles Golumbic, Vladimir Rainish: Instruction Scheduling Across Control Flow. Scientific Programming 2(3): 1-5 (1993)
1992
18 Martin Charles Golumbic, Ron Shamir: Algorithms and Complexity for Reasoning about Time. AAAI 1992: 741-747
17 Martin Charles Golumbic: Reasoning About Time. AISMC 1992: 276
16EEMartin Charles Golumbic, Ron Shamir: Interval Graphs, Interval Orders and the Consistency of Temporal Events. ISTCS 1992: 32-42
1990
15 Ronen Feldman, Martin Charles Golumbic: Ineractive Scheduling as a Constraint Satisfiability Problem. Ann. Math. Artif. Intell. 1: 49-73 (1990)
14 Ronen Feldman, Martin Charles Golumbic: Optimization Algorithms for Student Scheduling via Constraint Satisfiability. Comput. J. 33(4): 356-364 (1990)
13 Martin Charles Golumbic, Vladimir Rainish: Instruction Scheduling Beyond Basic Blocks. IBM Journal of Research and Development 34(1): 93-97 (1990)
1989
12 Ronen Feldman, Martin Charles Golumbic: Constraint Satisfiability Algorithms for Interactive Student Scheduling. IJCAI 1989: 1010-1016
11 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
10EEIdo Dagan, Martin Charles Golumbic, Ron Y. Pinter: Trapezoid graphs and their coloring. Discrete Applied Mathematics 21(1): 35-46 (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
7EEMartin Charles Golumbic: Interval graphs and related topics. Discrete Mathematics 55(2): 113-121 (1985)
6EEMartin Charles Golumbic, Robert E. Jamison: Edge and vertex intersection of paths in a tree. Discrete Mathematics 55(2): 151-159 (1985)
5EEMartin 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
4EEMartin Charles Golumbic, Doron Rotem, Jorge Urrutia: Comparability graphs and intersection graphs. Discrete Mathematics 43(1): 37-46 (1983)
3EEMark A. Buckingham, Martin Charles Golumbic: Partitionable graphs, circle graphs, and the berge strong perfect graph conjecture. Discrete Mathematics 44(1): 45-54 (1983)
1977
2EEMartin 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

1Alexander Belfer [21]
2David Bernstein [11]
3Anne Berry [41] [50] [51]
4Endre Boros [37]
5Andreas Brandstädt [60]
6Mark A. Buckingham [3]
7Elad Cohen [57] [58]
8Ido Dagan [10]
9Ronen Feldman [12] [14] [15]
10Paul W. Goldberg [25]
11Dina Q. Goldin [11]
12Peter L. Hammer [9]
13Tirza Hirst [34]
14Robert E. Jamison [5] [6] [46]
15Haim Kaplan [24] [25] [26] [27] [44]
16Hugo Krawczyk [11]
17Renu Laskar (Renu C. Laskar) [22] [23]
18Van Bang Le [60]
19Vadim E. Levit [37]
20Moshe Lewenstein [31] [34]
21Marina Lipshteyn [39] [40] [41] [49] [50] [52] [53] [54] [55] [57] [58] [59] [60]
22Yishay Mansour [11]
23Aviad Mintz [29] [35] [43] [45] [48] [56]
24Itai Nahshon [11]
25Uri N. Peled [36]
26Ron Y. Pinter [10] [11]
27Maurice Pouzet [51]
28Vladimir Rainish [13] [19]
29Doron Rotem [4]
30Udi Rotics [28] [30] [35] [43] [48] [56]
31Eric SanJuan [51]
32Ron Shamir [16] [18] [20] [24] [25] [26]
33Assaf Siani [38]
34Michal Stern [49] [52] [53] [54] [55] [57] [58] [59]
35Jorge Urrutia [4]
36Elad Verbin [44]

Colors in the list of coauthors

Copyright © Tue Nov 3 08:52:44 2009 by Michael Ley (ley@uni-trier.de)