Martin Charles Golumbic
#12,700
Most Influential Person Now
American mathematician and computer scientist
Martin Charles Golumbic's AcademicInfluence.com Rankings
Martin Charles Golumbiccomputer-science Degrees
Computer Science
#861
World Rank
#892
Historical Rank
#468
USA Rank
Theoretical Computer Science
#59
World Rank
#59
Historical Rank
#18
USA Rank
Martin Charles Golumbicmathematics Degrees
Mathematics
#1597
World Rank
#2589
Historical Rank
#652
USA Rank
Graph Theory
#26
World Rank
#33
Historical Rank
#6
USA Rank
Applied Mathematics
#196
World Rank
#216
Historical Rank
#66
USA Rank
Measure Theory
#1151
World Rank
#1471
Historical Rank
#418
USA Rank
Download Badge
Computer Science Mathematics
Why Is Martin Charles Golumbic Influential?
(Suggest an Edit or Addition)According to Wikipedia, Martin Charles Golumbic is a mathematician and computer scientist known for his research on perfect graphs, graph sandwich problems, compiler optimization, and spatial-temporal reasoning. He is a professor emeritus of computer science at the University of Haifa, and was the founder of the journal Annals of Mathematics and Artificial Intelligence.
Martin Charles Golumbic's Published Works
Published Works
- Algorithmic graph theory and perfect graphs (1980) (2523)
- Algorithmic Graph Theory and Perfect Graphs (Annals of Discrete Mathematics, Vol 57) (2004) (738)
- Complexity and algorithms for reasoning about time: a graph-theoretic approach (1993) (244)
- On the Clique-Width of Some Perfect Graph Classes (2000) (221)
- Four Strikes Against Physical Mapping of DNA (1995) (190)
- Graph sandwich problems (1995) (188)
- Perfect Elimination and Chordal Bipartite Graphs (1978) (165)
- Tolerance graphs (1984) (159)
- Trapezoid graphs and their coloring (1988) (155)
- Trivially perfect graphs (1978) (149)
- The edge intersection graphs of paths in a tree (1985) (139)
- Comparability graphs and intersection graphs (1983) (132)
- On the Complexity of DNA Physical Mapping (1994) (129)
- Spill code minimization techniques for optimizing compliers (1989) (127)
- New results on induced matchings (2000) (121)
- CHAPTER 3 – Perfect Graphs (1980) (118)
- Irredundancy in Circular Arc Graphs (1993) (100)
- Chapter 3 - Perfect graphs (2004) (83)
- Edge and vertex intersection of paths in a tree (1985) (81)
- Uniquely Restricted Matchings (2001) (81)
- Stability in Circular Arc Graphs (1988) (77)
- Edge intersection graphs of single bend paths on a grid (2009) (69)
- Interval graphs and related topics (1985) (67)
- Vertex Intersection Graphs of Paths on a Grid (2012) (66)
- The complexity of comparability graph recognition and coloring (1977) (66)
- The inducibility of graphs (1975) (64)
- Not So Perfect Graphs (2004) (59)
- Instruction Scheduling Across Control Flow (1993) (58)
- Combinatorial Merging (1976) (53)
- On the Clique-Width of Perfect Graph Classes (1999) (48)
- Spill Code Minimization Techniques for Optimizing Compilers (1989) (48)
- On the number of vertices belonging to all maximum stable sets of a graph (2002) (46)
- Graph Theory, Combinatorics and Algorithms (2005) (40)
- Chordal probe graphs (2003) (40)
- An improvement on the complexity of factoring read-once Boolean functions (2008) (39)
- Factoring Boolean functions using graph partitioning (2005) (38)
- Instruction Scheduling Beyond Basic Blocks (1990) (37)
- Graph Theory, Combinatorics and Algorithms: Interdisciplinary Applications (2011) (35)
- Factoring and recognition of read-once functions using cographs and normality and the readability of functions associated with partial k-trees (2006) (35)
- Optimization Algorithms for Student Scheduling via Constraint Satisfiability (1990) (32)
- Factoring and recognition of read-once functions using cographs and normality (2001) (31)
- Complexity and Algorithms for Graph and Hypergraph Sandwich Problems (1998) (30)
- Representing edge intersection graphs of paths on degree 4 trees (2008) (28)
- Constraint Satisfiability Algorithms for Interactive Student Scheduling (1989) (27)
- Approximation Algorithms for B 1-EPG Graphs (2013) (26)
- Generalized fibonacci maximum path graphs (1979) (26)
- A Knowledge-Based Expert System for Student Advising (1986) (25)
- Characterizations of cographs as intersection graphs of paths on a grid (2014) (23)
- Algorithms and Complexity for Reasoning about Time (1992) (22)
- Recognizing Chordal Probe Graphs and Cycle-Bicolorable Graphs (2007) (22)
- Matrix sandwich problems (1998) (22)
- Factoring logic functions using graph partitioning (1999) (22)
- Algorithmic Aspects of Perfect Graphs (1984) (22)
- Two tricks to triangulate chordal probe graphs in polynomial time (2004) (21)
- Reasoning About Time (1998) (21)
- Equivalences and the complete hierarchy of intersection graphs of paths in a tree (2008) (19)
- Posets and VPG Graphs (2016) (17)
- Algorithmic aspects of intersection graphs and representation hypergraphs (1988) (17)
- Boolean Functions: Read-once functions (2011) (17)
- The k-edge intersection graphs of paths in a tree (2008) (17)
- Annals of Mathematics and Artificial Intelligence (2002) (16)
- Coloring Algorithms for Tolerance Graphs: Reasoning and Scheduling with Interval Constraints (2002) (15)
- Directed tolerance graphs (2004) (15)
- On the Intersection Graphs of Orthogonal Line Segments in the Plane: Characterizations of Some Subclasses of Chordal Graphs (2013) (14)
- Tolerance Graphs: Frontmatter (2004) (14)
- Block duplicate graphs and a hierarchy of chordal graphs (2002) (13)
- CHAPTER 8 – Interval Graphs (1980) (13)
- Containment Graphs, Posets, and Related Classes of Graphs (1989) (12)
- Graph Theory, Combinatorics and Algorithms: Interdisciplinary Applications (Operations Research/Computer Science Interfaces Series) (2005) (12)
- String graphs of k-bend paths on a grid (2011) (11)
- A combinatorial approach to temporal reasoning (1990) (11)
- Representations of Edge Intersection Graphs of Paths in a Tree (2006) (11)
- The ( weighted ) metric dimension of graphs : hard and easy cases (2012) (10)
- 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” (2013) (10)
- Finding Intersection Models of Weakly Chordal Graphs (2006) (10)
- Intersection models of weakly chordal graphs (2009) (10)
- A characterization of chain probe graphs (2011) (9)
- Partitionable graphs, circle graphs, and the berge strong perfect graph conjecture (1983) (9)
- The chain graph sandwich problem (2011) (9)
- Smallest Odd Holes in Claw-Free Graphs (Extended Abstract) (2009) (9)
- Boxicity and Separation Dimension (2014) (9)
- Fighting Terror Online - The Convergence of Security, Technology, and the Law (2007) (8)
- Co-TT graphs and a characterization of split co-TT graphs (2014) (8)
- A note on perfect Gaussian elimination (1978) (8)
- Editorial welcome (2005) (8)
- Chapter 8 - Interval graphs (2004) (8)
- Rank‐tolerance graph classes (2006) (7)
- Total coloring of rooted path graphs (2018) (7)
- Research Issues and Trends in Spatial and Temporal Granularities (2002) (7)
- Algorithmic Graph Theory and Its Applications (2005) (7)
- Separation Dimension of Graphs and Hypergraphs (2016) (7)
- A GENERALIZATION OF DIRACS THEOREM* ON TRIANGULATED GRAPHS (1979) (6)
- Chordal Probe Graphs (Extended Abstract) (2003) (5)
- What Is between Chordal and Weakly Chordal Graphs? (2008) (5)
- Counting endpoint sequences for interval orders and interval graphs (1993) (5)
- Bar-Ilan Symposium on the Foundations of Artificial Intelligence (1990) (5)
- Interval Graphs, Interval Orders and the Consistency of Temporal Events (1992) (5)
- Archimedean ϕ ‐tolerance graphs (2002) (5)
- The recognition of k-EPT graphs (2008) (5)
- Recognizing and triangulating chordal probe graphs (2003) (5)
- Read-Once Functions Revisited and the Readability Number of a Boolean Function (2005) (5)
- Graph Theoretic Foundations (2004) (4)
- A knowledge representation language for university requirements (1991) (4)
- CHAPTER 5 – Comparability Graphs (1980) (4)
- A General Method for Avoiding Cycling in a Network (1987) (4)
- Rank-tolerance graph classes (2006) (4)
- On the bi-enhancement of chordal-bipartite probe graphs (2010) (3)
- CHAPTER 4 – Triangulated Graphs (1980) (3)
- Graph-Theoretic Concepts in Computer Science : 38th International Workshop, WG 2012, Jerusalem, Israel, June 26-28, 2012, Revised Selcted Papers (2012) (3)
- Recent Results on The Strong Perfect Graph Conjecture (1984) (3)
- Chapter 7 – Permutation graphs (1980) (3)
- Edge-intersection graphs of boundary-generated paths in a grid (2018) (3)
- The Complexity of Helly-B1 EPG Graph Recognition (2019) (3)
- CHAIN GRAPHS HAVE UNBOUNDED READABILITY (2006) (3)
- The Induced Separation Dimension of a Graph (2018) (2)
- Containment Graphs and Posets of Paths in a Tree: Wheels and Partial Wheels (2020) (2)
- Tolerance Graphs: φ-tolerance graphs (2004) (2)
- Tolerance Graphs: Chapter Dependencies (2004) (2)
- Archimedean φ -tolerance graphs (2002) (2)
- Twenty Years of EPT Graphs: From Haifa to Rostock (2006) (2)
- Recognizing Chordal-Bipartite Probe Graphs (2007) (2)
- Introduction to the special volume on knowledge discovery and discrete mathematics and a tribute to the memory of Peter L. Hammer (2007) (2)
- CHAPTER 1 – Graph Theoretic Foundations (1980) (2)
- Editor's remarks (2004) (2)
- Algorithms and Complexity of Sandwich Problems in Graphs (Extended Abstract) (1993) (2)
- Perspectives on Reasoning About Time (2012) (2)
- Induced Separation Dimension (2016) (2)
- Foreword 2004: The annals edition (2004) (2)
- Chapter 5 - Comparability graphs (2004) (2)
- Chapter 4 - Triangulated graphs (2004) (2)
- k-Neighborhood Covering and Independence Problems (1993) (1)
- On the Intersection Graphs of Orthogonal Line Segments in the Plane: Characterizations of Some Subclasses of Chordal Graphs (2012) (1)
- Landmarks in Algorithmic Graph Theory: A Personal Retrospective (2009) (1)
- Graph-Theoretic Concepts in Computer Science (2012) (1)
- The Design of Efficient Algorithms (2004) (1)
- Hardness and approximation for L-EPG and B1-EPG graphs (2020) (1)
- Interactive scheduling as a constraint satisfiability problem (1990) (1)
- The Zeroth Book of Graph Theory (2021) (1)
- The edge inducibility of graphs (1980) (1)
- The Balance Between Security and Civil Rights (2008) (1)
- Combinatorics, graph theory, and computing (2022) (1)
- Graph Theoretic Models for Reasoning About Time (2004) (1)
- From data to knowledge bases (1990) (1)
- Cell Flipping in Permutation Diagrams (1998) (1)
- Chapter 6 - Split graphs (2004) (1)
- A note from the Editor-in-Chief (2016) (1)
- On the complexity of cell flipping in permutation diagrams and multiprocessor scheduling problems (2005) (1)
- Advances in Artificial Intelligence: Natural Language and Knowledge-based Systems (2011) (1)
- Chapter 9 - Superperfect graphs (2004) (0)
- Unit and 50% tolerance orders (2004) (0)
- Early work on tolerance graphs (2004) (0)
- Perfect Gaussian Elimination (2004) (0)
- dimension is a comparability invariant. (2022) (0)
- Tolerance Graphs: Trees, cotrees and bipartite graphs (2004) (0)
- Learning from experience in board games (1990) (0)
- Open questions and further directions of research (2004) (0)
- Posets and VPG Graphs (2015) (0)
- Volume Contents (2004) (0)
- Advances in Artificial Intelligence (1990) (0)
- On dually-CPT and strong-CPT posets (2022) (0)
- Recognition of bounded bitolerance orders and trapezoid graphs (2004) (0)
- Exploiting graph structure to cope with hard problems (Dagstuhl Seminar 11182) (2011) (0)
- Tolerance Graphs: Preface (2004) (0)
- Volume Index (2004) (0)
- I Introduction and definitions (2021) (0)
- Proceedings of the 38th international conference on Graph-Theoretic Concepts in Computer Science (2012) (0)
- Containment Graphs and Posets of Paths in a Tree: Wheels and Partial Wheels (2020) (0)
- Annals of Mathematics and Artificial Intelligence (2004) (0)
- Volume Contents (2004) (0)
- The Induced Separation Dimension of a Graph (2017) (0)
- Volume Contents (2004) (0)
- The Legal Framework in Israel (2008) (0)
- The Legal Situation: Prevention and Enforcement in the Information Age (2008) (0)
- Path-Bicolorable Graphs (2009) (0)
- Tolerance intersection graphs of degree bounded subtrees of a tree with constant tolerance 2 (2017) (0)
- VIII Chessboard problems (2021) (0)
- Tolerance Graphs: Index of Symbols (2004) (0)
- Tolerance Graphs: Bitolerance and the ordered sets perspective (2004) (0)
- CHAPTER 12 – Perfect Gaussian Elimination (1980) (0)
- III Chains and cycles (2021) (0)
- Tolerance Graphs: Interval probe graphs and sandwich problems (2004) (0)
- Annals of Mathematics and Artificial Intelligence (2004) (0)
- CHAPTER 10 – Threshold Graphs (1980) (0)
- Student Poster Session (2012) (0)
- Chordal graphs (2021) (0)
- Recommendations: Is There a Need for New Regulations? (2008) (0)
- IV Regular graphs (2021) (0)
- V Cubic graphs (2021) (0)
- Dually and strongly chordal graphs (2021) (0)
- CHAPTER 2 – The Design of Efficient Algorithms (1980) (0)
- A note from the Editor-in-Chief (2016) (0)
- CHAPTER 11 – Not So Perfect Graphs (1980) (0)
- The Mathematician and the Social Computer: A Look into the Future (2014) (0)
- II Trees (2021) (0)
- Introduction (1990) (0)
- CHAPTER 9 – Superperfect Graphs (1980) (0)
- Volume Index (2004) (0)
- Volume Contents (2004) (0)
- Annals of Mathematics and Artificial Intelligence (2002) (0)
- 1999 Bar Illan Symposium on the Foundations of Artificial Intelligence (2000) (0)
- An Effective Upperbound on Treewidth Using Partial Fill-in of Separators (2019) (0)
- CHAPTER 6 – Split Graphs (1980) (0)
- Separation Dimension of Graphs and Hypergraphs (2015) (0)
- Volume Contents (2004) (0)
- Tolerance models of paths and subtrees of a tree (2004) (0)
- Chapter 10 - Threshold graphs (2004) (0)
- Tolerance Graphs: Algorithms on tolerance graphs (2004) (0)
- X Conclusion (2021) (0)
- Volume Index (2004) (0)
- Tolerance Graphs: Comparability invariance results (2004) (0)
- Publisher's Note (2004) (0)
- VII Hamiltonian graphs (2021) (0)
This paper list is powered by the following services:
Other Resources About Martin Charles Golumbic
What Schools Are Affiliated With Martin Charles Golumbic?
Martin Charles Golumbic is affiliated with the following schools: