| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | 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.  |
2012 |
DBLP BibTeX RDF |
|
| 1 | 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 |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Andreas Brandstädt, Martin Charles Golumbic, Van Bang Le, Marina Lipshteyn |
Path-Bicolorable Graphs. |
Graphs and Combinatorics |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Charles Golumbic, Frédéric Maffray, Grégory Morel |
A characterization of chain probe graphs. |
Annals OR |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Simone Dantas, Celina M. Herrera de Figueiredo, Martin Charles Golumbic, Sulamita Klein, Frédéric Maffray |
The chain graph sandwich problem. |
Annals OR |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Andreas Brandstädt, Martin Charles Golumbic, Pinar Heggernes, Ross M. McConnell |
Exploiting graph structure to cope with hard problems (Dagstuhl Seminar 11182). |
Dagstuhl Reports |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Charles Golumbic |
Forward. |
Ann. Math. Artif. Intell. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Charles Golumbic |
Graph sandwich problems. |
CTW |
2011 |
DBLP BibTeX RDF |
|
| 1 | Elad Cohen, Martin Charles Golumbic, Marina Lipshteyn, Michal Stern |
On the bi-enhancement of chordal-bipartite probe graphs. |
Inf. Process. Lett. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Charles Golumbic, Marina Lipshteyn, Michal Stern |
Edge intersection graphs of single bend paths on a grid. |
Networks |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Charles Golumbic, Marina Lipshteyn, Michal Stern |
Intersection models of weakly chordal graphs. |
Discrete Applied Mathematics |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Shimon Shrem, Michal Stern, Martin Charles Golumbic |
Smallest Odd Holes in Claw-Free Graphs (Extended Abstract). |
WG |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Charles Golumbic |
Landmarks in Algorithmic Graph Theory: A Personal Retrospective. |
Graph Theory, Computational Intelligence and Thought |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Andreas Brandstädt, Martin Charles Golumbic, Van Bang Le, Marina Lipshteyn |
Path-Bicolorable Graphs. |
Graph Theory, Computational Intelligence and Thought |
2009 |
DBLP DOI BibTeX RDF |
P 3-bicolorable graphs, P 4-bicolorable graphs, linear time recognition, bipartite graphs |
| 1 | Martin Charles Golumbic, Marina Lipshteyn, Michal Stern |
Representing edge intersection graphs of paths on degree 4 trees. |
Discrete Mathematics |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Charles Golumbic, Aviad Mintz, Udi Rotics |
An improvement on the complexity of factoring read-once Boolean functions. |
Discrete Applied Mathematics |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Charles Golumbic, Marina Lipshteyn, Michal Stern |
The k-edge intersection graphs of paths in a tree. |
Discrete Applied Mathematics |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Charles Golumbic, Marina Lipshteyn, Michal Stern |
Equivalences and the complete hierarchy of intersection graphs of paths in a tree. |
Discrete Applied Mathematics |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Elad Cohen, Martin Charles Golumbic, Marina Lipshteyn, Michal Stern |
What Is between Chordal and Weakly Chordal Graphs?. |
WG |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Elad Cohen, Martin Charles Golumbic, Marina Lipshteyn, Michal Stern |
On the Bi-enhancement of Chordal-bipartite Probe Graphs. |
CTW |
2008 |
DBLP BibTeX RDF |
|
| 1 | Anne Berry, Martin Charles Golumbic, Marina Lipshteyn |
Recognizing Chordal Probe Graphs and Cycle-Bicolorable Graphs. |
SIAM J. Discrete Math. |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | 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. |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Charles Golumbic, Marina Lipshteyn, Michal Stern |
Edge intersection graphs of single bend paths on a grid. |
CTW |
2007 |
DBLP BibTeX RDF |
|
| 1 | Martin Charles Golumbic |
Twenty Years of EPT Graphs: From Haifa to Rostock. |
Electronic Notes in Discrete Mathematics |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Charles Golumbic, Robert E. Jamison |
Rank-tolerance graph classes. |
Journal of Graph Theory |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Charles Golumbic, Marina Lipshteyn, Michal Stern |
Finding Intersection Models of Weakly Chordal Graphs. |
WG |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Charles Golumbic, Aviad Mintz, Udi Rotics |
Read-Once Functions Revisited and the Readability Number of a Boolean Function. |
Electronic Notes in Discrete Mathematics |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Charles Golumbic, Haim Kaplan, Elad Verbin |
On the complexity of cell flipping in permutation diagrams and multiprocessor scheduling problems. |
Discrete Mathematics |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Aviad Mintz, Martin Charles Golumbic |
Factoring Boolean functions using graph partitioning. |
Discrete Applied Mathematics |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Charles Golumbic, Marina Lipshteyn |
Chordal probe graphs. |
Discrete Applied Mathematics |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Anne Berry, Martin Charles Golumbic, Marina Lipshteyn |
Two tricks to triangulate chordal probe graphs in polynomial time. |
SODA |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Charles Golumbic |
Graph Theoretic Models for Reasoning About Time. |
ASIAN |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Charles Golumbic, Marina Lipshteyn |
Chordal Probe Graphs. |
WG |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Charles Golumbic, Uri N. Peled |
Block duplicate graphs and a hierarchy of chordal graphs. |
Discrete Applied Mathematics |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Charles Golumbic, Assaf Siani |
Coloring Algorithms for Tolerance Graphs: Reasoning and Scheduling with Interval Constraints. |
AISC |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Charles Golumbic, Tirza Hirst, Moshe Lewenstein |
Uniquely Restricted Matchings. |
Algorithmica |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Charles Golumbic, Aviad Mintz, Udi Rotics |
Factoring and Recognition of Read-Once Functions using Cographs and Normality. |
DAC |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Charles Golumbic, Udi Rotics |
On the Clique-Width of Some Perfect Graph Classes. |
Int. J. Found. Comput. Sci. |
2000 |
DBLP BibTeX RDF |
|
| 1 | Martin Charles Golumbic, Moshe Lewenstein |
New results on induced matchings. |
Discrete Applied Mathematics |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Charles Golumbic |
1999 Bar Illan Symposium on the Foundations of Artificial Intelligence. |
AI Magazine |
2000 |
DBLP BibTeX RDF |
|
| 1 | Martin Charles Golumbic |
Editor's remarks. |
Ann. Math. Artif. Intell. |
2000 |
DBLP BibTeX RDF |
|
| 1 | Martin Charles Golumbic, Udi Rotics |
On the Clique-Width of Perfect Graph Classes. |
WG |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Charles Golumbic, Aviad Mintz |
Factoring logic functions using graph partitioning. |
ICCAD |
1999 |
DBLP BibTeX RDF |
|
| 1 | Martin Charles Golumbic, Amir Wassermann |
Complexity and Algorithms for Graph and Hypergraph Sandwich Problems. |
Graphs and Combinatorics |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Charles Golumbic, Haim Kaplan |
Cell Flipping in Permutation Diagrams. |
STACS |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Paul W. Goldberg, Martin Charles Golumbic, Haim Kaplan, Ron Shamir |
Four Strikes Against Physical Mapping of DNA. |
Journal of Computational Biology |
1995 |
DBLP BibTeX RDF |
|
| 1 | Martin Charles Golumbic, Haim Kaplan, Ron Shamir |
Graph Sandwich Problems. |
J. Algorithms |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Charles Golumbic, Vladimir Rainish |
Instruction Scheduling Across Control Flow. |
Scientific Programming |
1993 |
DBLP BibTeX RDF |
|
| 1 | Alexander Belfer, Martin Charles Golumbic |
Counting endpoint sequences for interval orders and interval graphs. |
Discrete Mathematics |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Charles Golumbic, Ron Shamir |
Complexity and Algorithms for Reasoning about Time: A Graph-Theoretic Approach. |
J. ACM |
1993 |
DBLP DOI BibTeX RDF |
DNA mapping, sandwich problems, complexity, satisfiability, temporal reasoning, interval graphs, algorithmic analysis, interval orders |
| 1 | Martin Charles Golumbic, Renu Laskar |
Introduction. |
Discrete Applied Mathematics |
1993 |
DBLP BibTeX RDF |
|
| 1 | Martin Charles Golumbic, Renu Laskar |
Irredundancy in Circular Arc Graphs. |
Discrete Applied Mathematics |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Charles Golumbic, Haim Kaplan, Ron Shamir |
Algorithms and Complexity of Sandwich Problems in Graphs (Extended Abstract). |
WG |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Charles Golumbic, Ron Shamir |
Interval Graphs, Interval Orders and the Consistency of Temporal Events. |
ISTCS |
1992 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Charles Golumbic |
Reasoning About Time. |
AISMC |
1992 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Charles Golumbic, Ron Shamir |
Algorithms and Complexity for Reasoning about Time. |
AAAI |
1992 |
DBLP BibTeX RDF |
|
| 1 | Ronen Feldman, Martin Charles Golumbic |
Optimization Algorithms for Student Scheduling via Constraint Satisfiability. |
Comput. J. |
1990 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Charles Golumbic, Vladimir Rainish |
Instruction Scheduling Beyond Basic Blocks. |
IBM Journal of Research and Development |
1990 |
DBLP BibTeX RDF |
|
| 1 | Ronen Feldman, Martin Charles Golumbic |
Ineractive Scheduling as a Constraint Satisfiability Problem. |
Ann. Math. Artif. Intell. |
1990 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
DBLP DOI BibTeX RDF |
|
| 1 | Ronen Feldman, Martin Charles Golumbic |
Constraint Satisfiability Algorithms for Interactive Student Scheduling. |
IJCAI |
1989 |
DBLP BibTeX RDF |
|
| 1 | Martin Charles Golumbic |
Algorithmic aspects of intersection graphs and representation hypergraphs. |
Graphs and Combinatorics |
1988 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Charles Golumbic, Peter L. Hammer |
Stability in Circular Arc Graphs. |
J. Algorithms |
1988 |
DBLP DOI BibTeX RDF |
|
| 1 | Ido Dagan, Martin Charles Golumbic, Ron Y. Pinter |
Trapezoid graphs and their coloring. |
Discrete Applied Mathematics |
1988 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Charles Golumbic |
A General Method for Avoiding Cycling in a Network. |
Inf. Process. Lett. |
1987 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Charles Golumbic, Robert E. Jamison |
The edge intersection graphs of paths in a tree. |
J. Comb. Theory, Ser. B |
1985 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Charles Golumbic, Robert E. Jamison |
Edge and vertex intersection of paths in a tree. |
Discrete Mathematics |
1985 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Charles Golumbic |
Interval graphs and related topics. |
Discrete Mathematics |
1985 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Charles Golumbic, Doron Rotem, Jorge Urrutia |
Comparability graphs and intersection graphs. |
Discrete Mathematics |
1983 |
DBLP DOI BibTeX RDF |
|
| 1 | Mark A. Buckingham, Martin Charles Golumbic |
Partitionable graphs, circle graphs, and the berge strong perfect graph conjecture. |
Discrete Mathematics |
1983 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Charles Golumbic |
Comparability graphs and a new matroid. |
J. Comb. Theory, Ser. B |
1977 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Charles Golumbic |
Combinatorial Merging. |
IEEE Trans. Computers |
1976 |
DBLP DOI BibTeX RDF |
integer weighted nodes, number of internal nodes, r-ary tree, switching circuit theory, weight of the root of the tree, parallel processing, Fan-in |
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")