Martin Charles Golumbic

Networks, 2013

On the Intersection Graphs of Orthogonal Line Segments in the Plane: Characterizations of Some Subclasses of Chordal Graphs.

[BibT_eX]

[DOI]

Bernard Ries

Graphs Comb., 2013

Micro Spitbol.

[BibT_eX]

[DOI]

Robert B. K. Dewar

Clinton F. Goss

CoRR, 2013

Approximation Algorithms for B 1-EPG Graphs.

[BibT_eX]

[DOI]

Dror Epstein

Gila Morgenstern

Proceedings of the Algorithms and Data Structures - 13th International Symposium, 2013

2012

Perspectives on Reasoning About Time.

[BibT_eX]

[DOI]

Proceedings of the Ubiquitous Display Environments, 2012

Vertex Intersection Graphs of Paths on a Grid.

[BibT_eX]

[DOI]

Andrei Asinowski

Vincent Limouzy

J. Graph Algorithms Appl., 2012

Student Poster Session.

[BibT_eX]

[DOI]

Avivit Levy

Gila Morgenstern

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2012

2011

Path-Bicolorable Graphs.

[BibT_eX]

[DOI]

Andreas Brandstädt

Van Bang Le

Graphs Comb., 2011

String graphs of k-bend paths on a grid.

[BibT_eX]

[DOI]

Andrei Asinowski

Vincent Limouzy

Electron. Notes Discret. Math., 2011

Exploiting graph structure to cope with hard problems (Dagstuhl Seminar 11182).

[BibT_eX]

[DOI]

Andreas Brandstädt

Pinar Heggernes

Ross M. McConnell

Dagstuhl Reports, 2011

A characterization of chain probe graphs.

[BibT_eX]

[DOI]

Celina M. H. de Figueiredo

Frédéric Maffray

Grégory Morel

Ann. Oper. Res., 2011

The chain graph sandwich problem.

[BibT_eX]

[DOI]

Simone Dantas

Sulamita Klein

Frédéric Maffray

Ann. Oper. Res., 2011

Forward.

[BibT_eX]

[DOI]

Ann. Math. Artif. Intell., 2011

Graph sandwich problems.

[BibT_eX]

[DOI]

Proceedings of the 10th Cologne-Twente Workshop on graphs and combinatorial optimization. Extended Abstracts, 2011

2010

On the bi-enhancement of chordal-bipartite probe graphs.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2010

2009

Edge intersection graphs of single bend paths on a grid.

[BibT_eX]

[DOI]

Networks, 2009

Intersection models of weakly chordal graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2009

Smallest Odd Holes in Claw-Free Graphs (Extended Abstract).

[BibT_eX]

[DOI]

Shimon Shrem

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2009

Landmarks in Algorithmic Graph Theory: A Personal Retrospective.

[BibT_eX]

[DOI]

Proceedings of the Graph Theory, 2009

2008

Representing edge intersection graphs of paths on degree 4 trees.

[BibT_eX]

[DOI]

Discret. Math., 2008

An improvement on the complexity of factoring read-once Boolean functions.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2008

Equivalences and the complete hierarchy of intersection graphs of paths in a tree.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2008

The k-edge intersection graphs of paths in a tree.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2008

What Is between Chordal and Weakly Chordal Graphs?.

[BibT_eX]

[DOI]

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2008

Fighting Terror Online - The Convergence of Security, Technology, and the Law.

[BibT_eX]

[DOI]

Springer, ISBN: 978-0-387-73577-1, 2008

2007

Recognizing Chordal Probe Graphs and Cycle-Bicolorable Graphs.

[BibT_eX]

[DOI]

Anne Berry

SIAM J. Discret. Math., 2007

Introduction to the special volume on knowledge discovery and discrete mathematics and a tribute to the memory of Peter L. Hammer.

[BibT_eX]

[DOI]

Anne Berry

Eric SanJuan

Maurice Pouzet

Ann. Math. Artif. Intell., 2007

2006

Rank-tolerance graph classes.

[BibT_eX]

[DOI]

J. Graph Theory, 2006

Twenty Years of EPT Graphs: From Haifa to Rostock.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2006

Factoring and recognition of read-once functions using cographs and normality and the readability of functions associated with partial k-trees.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2006

Finding Intersection Models of Weakly Chordal Graphs.

[BibT_eX]

[DOI]

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2006

2005

Read-Once Functions Revisited and the Readability Number of a Boolean Function.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2005

On the complexity of cell flipping in permutation diagrams and multiprocessor scheduling problems.

[BibT_eX]

[DOI]

Elad Verbin

Discret. Math., 2005

Factoring Boolean functions using graph partitioning.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2005

2004

Chordal probe graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2004

Two tricks to triangulate chordal probe graphs in polynomial time.

[BibT_eX]

[DOI]

Anne Berry

Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2004

Graph Theoretic Models for Reasoning About Time.

[BibT_eX]

[DOI]

Proceedings of the Advances in Computer Science, 2004

2002

Archimedean ϕ -tolerance graphs.

[BibT_eX]

[DOI]

Ann N. Trenk

J. Graph Theory, 2002

Block duplicate graphs and a hierarchy of chordal graphs.

[BibT_eX]

[DOI]

Uri N. Peled

Discret. Appl. Math., 2002

On the number of vertices belonging to all maximum stable sets of a graph.

[BibT_eX]

[DOI]

Endre Boros

Vadim E. Levit

Discret. Appl. Math., 2002

Coloring Algorithms for Tolerance Graphs: Reasoning and Scheduling with Interval Constraints.

[BibT_eX]

[DOI]

Assaf Siani

Proceedings of the Artificial Intelligence, 2002

2001

Uniquely Restricted Matchings.

[BibT_eX]

[DOI]

Tirza Hirst

Moshe Lewenstein

Algorithmica, 2001

Factoring and Recognition of Read-Once Functions using Cographs and Normality.

[BibT_eX]

[DOI]

Proceedings of the 38th Design Automation Conference, 2001

2000

On the Clique-Width of Some Perfect Graph Classes.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2000

New results on induced matchings.

[BibT_eX]

[DOI]

Moshe Lewenstein

Discret. Appl. Math., 2000

Editor's remarks.

[BibT_eX]

Ann. Math. Artif. Intell., 2000

1999 Bar Illan Symposium on the Foundations of Artificial Intelligence.

[BibT_eX]

[DOI]

AI Mag., 2000

1999

On the Clique-Width of Perfect Graph Classes.

[BibT_eX]

[DOI]

Proceedings of the Graph-Theoretic Concepts in Computer Science, 1999

Factoring logic functions using graph partitioning.

[BibT_eX]

[DOI]

Proceedings of the 1999 IEEE/ACM International Conference on Computer-Aided Design, 1999

1998

Complexity and Algorithms for Graph and Hypergraph Sandwich Problems.

[BibT_eX]

[DOI]

Amir Wassermann

Graphs Comb., 1998

Cell Flipping in Permutation Diagrams.

[BibT_eX]

[DOI]

Proceedings of the STACS 98, 1998

1995

Four Strikes Against Physical Mapping of DNA.

[BibT_eX]

[DOI]

Paul W. Goldberg

J. Comput. Biol., 1995

Graph Sandwich Problems.

[BibT_eX]

[DOI]

J. Algorithms, 1995

1993

Instruction Scheduling Across Control Flow.

[BibT_eX]

[DOI]

Vladimir Rainish

Sci. Program., 1993

Complexity and Algorithms for Reasoning about Time: A Graph-Theoretic Approach.

[BibT_eX]

[DOI]

J. ACM, 1993

Counting endpoint sequences for interval orders and interval graphs.

[BibT_eX]

[DOI]

Alexander Belfer

Discret. Math., 1993

Introduction.

[BibT_eX]

Renu C. Laskar

Discret. Appl. Math., 1993

Irredundancy in Circular Arc Graphs.

[BibT_eX]

[DOI]

Renu C. Laskar

Discret. Appl. Math., 1993

Algorithms and Complexity of Sandwich Problems in Graphs (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Graph-Theoretic Concepts in Computer Science, 1993

1992

Interval Graphs, Interval Orders and the Consistency of Temporal Events.

[BibT_eX]

[DOI]

Proceedings of the Theory of Computing and Systems, 1992

Reasoning About Time.

[BibT_eX]

[DOI]

Proceedings of the Artificial Intelligence and Symbolic Mathematical Computation, 1992

Algorithms and Complexity for Reasoning about Time.

[BibT_eX]

[DOI]

Proceedings of the 10th National Conference on Artificial Intelligence, 1992

1991

A knowledge representation language for university requirements.

[BibT_eX]

[DOI]

Moshe Markovich

Michael L. Tiomkin

Decis. Support Syst., 1991

1990

Instruction Scheduling Beyond Basic Blocks.

[BibT_eX]

[DOI]

Vladimir Rainish

IBM J. Res. Dev., 1990

Optimization Algorithms for Student Scheduling via Constraint Satisfiability.

[BibT_eX]

[DOI]

Ronen Feldman

Comput. J., 1990

Ineractive Scheduling as a Constraint Satisfiability Problem.

[BibT_eX]

[DOI]

Ronen Feldman

Ann. Math. Artif. Intell., 1990

A combinatorial approach to temporal reasoning.

[BibT_eX]

[DOI]

Alexander Belfer

Proceedings of the Next Decade in Information Technology: Proceedings of the 5th Jerusalem Conference on Information Technology 1990, 1990

1989

Spill Code Minimization Techniques for Optimizing Compilers.

[BibT_eX]

[DOI]

David Bernstein

Dina Q. Goldin

Proceedings of the ACM SIGPLAN'89 Conference on Programming Language Design and Implementation (PLDI), 1989

Constraint Satisfiability Algorithms for Interactive Student Scheduling.

[BibT_eX]

[DOI]

Ronen Feldman

Proceedings of the 11th International Joint Conference on Artificial Intelligence. Detroit, 1989

1988

Stability in Circular Arc Graphs.

[BibT_eX]

[DOI]

Peter L. Hammer

J. Algorithms, 1988

Algorithmic aspects of intersection graphs and representation hypergraphs.

[BibT_eX]

[DOI]

Graphs Comb., 1988

Trapezoid graphs and their coloring.

[BibT_eX]

[DOI]

Ido Dagan

Ron Y. Pinter

Discret. Appl. Math., 1988

1987

A General Method for Avoiding Cycling in a Network.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1987

1985

The edge intersection graphs of paths in a tree.

[BibT_eX]

[DOI]

J. Comb. Theory B, 1985

Edge and vertex intersection of paths in a tree.

[BibT_eX]

[DOI]

Discret. Math., 1985

Interval graphs and related topics.

[BibT_eX]

[DOI]

Discret. Math., 1985

1984

Tolerance graphs.

[BibT_eX]

[DOI]

Clyde L. Monma

William T. Trotter

Discret. Appl. Math., 1984

1983

Comparability graphs and intersection graphs.

[BibT_eX]

[DOI]

Doron Rotem

Jorge Urrutia

Discret. Math., 1983

Partitionable graphs, circle graphs, and the berge strong perfect graph conjecture.

[BibT_eX]

[DOI]

Mark A. Buckingham

Discret. Math., 1983

1979

Generalized fibonacci maximum path graphs.

[BibT_eX]

[DOI]

Yehoshua Perl

Discret. Math., 1979

1978

Perfect Elimination and Chordal Bipartite Graphs.

[BibT_eX]

[DOI]

Clinton F. Goss

J. Graph Theory, 1978

Trivially perfect graphs.

[BibT_eX]

[DOI]

Discret. Math., 1978

1977

Comparability graphs and a new matroid.

[BibT_eX]

[DOI]

J. Comb. Theory B, 1977

The complexity of comparability graph recognition and coloring.

[BibT_eX]

[DOI]

Computing, 1977

1976

Combinatorial Merging.

[BibT_eX]

[DOI]