The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Martin Charles Golumbic: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Ronen Feldman, Martin Charles Golumbic
    Ineractive Scheduling as a Constraint Satisfiability Problem. [Citation Graph (1, 0)][DBLP]
    Ann. Math. Artif. Intell., 1990, v:1, n:, pp:49-73 [Journal]
  2. Martin Charles Golumbic, Ron Shamir
    Algorithms and Complexity for Reasoning about Time. [Citation Graph (0, 0)][DBLP]
    AAAI, 1992, pp:741-747 [Conf]
  3. Martin Charles Golumbic
    Reasoning About Time. [Citation Graph (0, 0)][DBLP]
    AISMC, 1992, pp:276- [Conf]
  4. Martin Charles Golumbic, Assaf Siani
    Coloring Algorithms for Tolerance Graphs: Reasoning and Scheduling with Interval Constraints. [Citation Graph (0, 0)][DBLP]
    AISC, 2002, pp:196-207 [Conf]
  5. Martin Charles Golumbic
    Graph Theoretic Models for Reasoning About Time. [Citation Graph (0, 0)][DBLP]
    ASIAN, 2004, pp:352-362 [Conf]
  6. Martin Charles Golumbic, Aviad Mintz, Udi Rotics
    Factoring and Recognition of Read-Once Functions using Cographs and Normality. [Citation Graph (0, 0)][DBLP]
    DAC, 2001, pp:109-114 [Conf]
  7. Martin Charles Golumbic, Aviad Mintz
    Factoring logic functions using graph partitioning. [Citation Graph (0, 0)][DBLP]
    ICCAD, 1999, pp:195-199 [Conf]
  8. Ronen Feldman, Martin Charles Golumbic
    Constraint Satisfiability Algorithms for Interactive Student Scheduling. [Citation Graph (0, 0)][DBLP]
    IJCAI, 1989, pp:1010-1016 [Conf]
  9. Martin Charles Golumbic, Ron Shamir
    Interval Graphs, Interval Orders and the Consistency of Temporal Events. [Citation Graph (0, 0)][DBLP]
    ISTCS, 1992, pp:32-42 [Conf]
  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. [Citation Graph (0, 0)][DBLP]
    PLDI, 1989, pp:258-263 [Conf]
  11. Anne Berry, Martin Charles Golumbic, Marina Lipshteyn
    Two tricks to triangulate chordal probe graphs in polynomial time. [Citation Graph (0, 0)][DBLP]
    SODA, 2004, pp:962-969 [Conf]
  12. Martin Charles Golumbic, Haim Kaplan
    Cell Flipping in Permutation Diagrams. [Citation Graph (0, 0)][DBLP]
    STACS, 1998, pp:577-586 [Conf]
  13. Martin Charles Golumbic, Haim Kaplan, Ron Shamir
    Algorithms and Complexity of Sandwich Problems in Graphs (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    WG, 1993, pp:57-69 [Conf]
  14. Martin Charles Golumbic, Marina Lipshteyn
    Chordal Probe Graphs. [Citation Graph (0, 0)][DBLP]
    WG, 2003, pp:249-260 [Conf]
  15. Martin Charles Golumbic, Marina Lipshteyn, Michal Stern
    Finding Intersection Models of Weakly Chordal Graphs. [Citation Graph (0, 0)][DBLP]
    WG, 2006, pp:241-255 [Conf]
  16. Martin Charles Golumbic, Udi Rotics
    On the Clique-Width of Perfect Graph Classes. [Citation Graph (0, 0)][DBLP]
    WG, 1999, pp:135-147 [Conf]
  17. Martin Charles Golumbic
    1999 Bar Illan Symposium on the Foundations of Artificial Intelligence. [Citation Graph (0, 0)][DBLP]
    AI Magazine, 2000, v:21, n:1, pp:101- [Journal]
  18. Martin Charles Golumbic, Tirza Hirst, Moshe Lewenstein
    Uniquely Restricted Matchings. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2001, v:31, n:2, pp:139-154 [Journal]
  19. Martin Charles Golumbic
    Editor's remarks. [Citation Graph (0, 0)][DBLP]
    Ann. Math. Artif. Intell., 2000, v:28, n:1-4, pp:1-2 [Journal]
  20. Ronen Feldman, Martin Charles Golumbic
    Optimization Algorithms for Student Scheduling via Constraint Satisfiability. [Citation Graph (0, 0)][DBLP]
    Comput. J., 1990, v:33, n:4, pp:356-364 [Journal]
  21. Endre Boros, Martin Charles Golumbic, Vadim E. Levit
    On the number of vertices belonging to all maximum stable sets of a graph. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2002, v:124, n:1-3, pp:17-25 [Journal]
  22. Martin Charles Golumbic, Moshe Lewenstein
    New results on induced matchings. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2000, v:101, n:1-3, pp:157-165 [Journal]
  23. Martin Charles Golumbic, Marina Lipshteyn
    Chordal probe graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2004, v:143, n:1-3, pp:221-237 [Journal]
  24. Martin Charles Golumbic, Renu Laskar
    Irredundancy in Circular Arc Graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1993, v:44, n:1-3, pp:79-89 [Journal]
  25. Martin Charles Golumbic, Renu Laskar
    Introduction. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1993, v:44, n:1-3, pp:1-3 [Journal]
  26. Martin Charles Golumbic, Uri N. Peled
    Block duplicate graphs and a hierarchy of chordal graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2002, v:124, n:1-3, pp:67-71 [Journal]
  27. Aviad Mintz, Martin Charles Golumbic
    Factoring Boolean functions using graph partitioning. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2005, v:149, n:1-3, pp:131-153 [Journal]
  28. 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. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2006, v:154, n:10, pp:1465-1477 [Journal]
  29. Martin Charles Golumbic, Haim Kaplan, Elad Verbin
    On the complexity of cell flipping in permutation diagrams and multiprocessor scheduling problems. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2005, v:296, n:1, pp:25-41 [Journal]
  30. Martin Charles Golumbic, Vladimir Rainish
    Instruction Scheduling Beyond Basic Blocks. [Citation Graph (0, 0)][DBLP]
    IBM Journal of Research and Development, 1990, v:34, n:1, pp:93-97 [Journal]
  31. Martin Charles Golumbic, Udi Rotics
    On the Clique-Width of Some Perfect Graph Classes. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 2000, v:11, n:3, pp:423-443 [Journal]
  32. Martin Charles Golumbic
    A General Method for Avoiding Cycling in a Network. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1987, v:24, n:4, pp:251-253 [Journal]
  33. Martin Charles Golumbic, Ron Shamir
    Complexity and Algorithms for Reasoning about Time: A Graph-Theoretic Approach. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1993, v:40, n:5, pp:1108-1133 [Journal]
  34. Martin Charles Golumbic, Peter L. Hammer
    Stability in Circular Arc Graphs. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1988, v:9, n:3, pp:314-320 [Journal]
  35. Martin Charles Golumbic, Haim Kaplan, Ron Shamir
    Graph Sandwich Problems. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1995, v:19, n:3, pp:449-473 [Journal]
  36. Paul W. Goldberg, Martin Charles Golumbic, Haim Kaplan, Ron Shamir
    Four Strikes Against Physical Mapping of DNA. [Citation Graph (0, 0)][DBLP]
    Journal of Computational Biology, 1995, v:2, n:1, pp:139-152 [Journal]
  37. Martin Charles Golumbic, Robert E. Jamison
    The edge intersection graphs of paths in a tree. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1985, v:38, n:1, pp:8-22 [Journal]
  38. Martin Charles Golumbic
    Comparability graphs and a new matroid. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1977, v:22, n:1, pp:68-90 [Journal]
  39. Martin Charles Golumbic
    Combinatorial Merging. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 1976, v:25, n:11, pp:1164-1167 [Journal]
  40. Martin Charles Golumbic, Robert E. Jamison
    Rank-tolerance graph classes. [Citation Graph (0, 0)][DBLP]
    Journal of Graph Theory, 2006, v:52, n:4, pp:317-340 [Journal]
  41. 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. [Citation Graph (0, 0)][DBLP]
    Ann. Math. Artif. Intell., 2007, v:49, n:1-4, pp:1-4 [Journal]
  42. Martin Charles Golumbic, Doron Rotem, Jorge Urrutia
    Comparability graphs and intersection graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1983, v:43, n:1, pp:37-46 [Journal]
  43. Mark A. Buckingham, Martin Charles Golumbic
    Partitionable graphs, circle graphs, and the berge strong perfect graph conjecture. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1983, v:44, n:1, pp:45-54 [Journal]
  44. Martin Charles Golumbic, Robert E. Jamison
    Edge and vertex intersection of paths in a tree. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1985, v:55, n:2, pp:151-159 [Journal]
  45. Martin Charles Golumbic
    Interval graphs and related topics. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1985, v:55, n:2, pp:113-121 [Journal]
  46. Alexander Belfer, Martin Charles Golumbic
    Counting endpoint sequences for interval orders and interval graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1993, v:114, n:1-3, pp:23-39 [Journal]

  47. Landmarks in Algorithmic Graph Theory: A Personal Retrospective. [Citation Graph (, )][DBLP]


  48. Path-Bicolorable Graphs. [Citation Graph (, )][DBLP]


  49. What Is between Chordal and Weakly Chordal Graphs?. [Citation Graph (, )][DBLP]


  50. Smallest Odd Holes in Claw-Free Graphs (Extended Abstract). [Citation Graph (, )][DBLP]


  51. Edge intersection graphs of single bend paths on a grid. [Citation Graph (, )][DBLP]


  52. On the Bi-enhancement of Chordal-bipartite Probe Graphs. [Citation Graph (, )][DBLP]


  53. The k-edge intersection graphs of paths in a tree. [Citation Graph (, )][DBLP]


  54. An improvement on the complexity of factoring read-once Boolean functions. [Citation Graph (, )][DBLP]


  55. Equivalences and the complete hierarchy of intersection graphs of paths in a tree. [Citation Graph (, )][DBLP]


  56. Trapezoid graphs and their coloring. [Citation Graph (, )][DBLP]


  57. Intersection models of weakly chordal graphs. [Citation Graph (, )][DBLP]


  58. Representing edge intersection graphs of paths on degree 4 trees. [Citation Graph (, )][DBLP]


Search in 0.045secs, Finished in 0.048secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002