On two-directional orthogonal ray graphs

No abstract is available for this paper.

• Publication year

  2010

• Venue

  Proceedings of 2010 IEEE International Symposium on Circuits and Systems

• Publication date

  2010-08-03

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1109/ISCAS.2010.5537709
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Chordal Bipartite Graphs with High Boxicity

  2009cited by this paper
• Logic Mapping in Crossbar-Based Nanoarchitectures

  2009cited by this paper
• Orthogonal ray graphs and nano-PLA design

  2008cited by this paper
• Relationships between the class of unit grid intersection graphs and other classes of bipartite graphs

  2007cited by this paper
• Graph isomorphism completeness for chordal bipartite graphs and strongly chordal graphs

  2005cited by this paper
• A mapping algorithm for defect-tolerance of reconfigurable nano-architectures

  2005cited by this paper
• New regular embeddings of n-cubes Q n

  2004cited by this paper
• Linear-Time Recognition of Circular-Arc Graphs

  2001cited by this paper
• List Homomorphisms and Circular Arc Graphs

  1999influential reference
• Coloring Relatives of Intervals on the Plane, I: Chromatic Number Versus Girth

  1998cited by this paper
• Colouring Relatives of Intervals on the Plane, II

  1998cited by this paper
• Recognizing Interval Digraphs and Interval Bigraphs in Polynomial Time

  1997cited by this paper
• Permuting Matrices to Avoid Forbidden Submatrices

  1995influential reference
• O(M*N) Algorithms for the Recognition and Isomorphism Problems on Circular-Arc Graphs

  1995cited by this paper
• A Special Planar Satisfiability Problem and a Consequence of Its NP-completeness

  1994cited by this paper
• Efficient parallel algorithms for bipartite permutation graphs

  1993cited by this paper
• On grid intersection graphs

  1991cited by this paper
• Bipartite permutation graphs

  1987cited by this paper
• Circular-arc graphs with clique cover number two

  1987cited by this paper
• Doubly lexical orderings of matrices

  1985cited by this paper

• A characterization of uniquely representable two-directional orthogonal ray graphs

  2024cites this paper
• Strong Cocomparability Graphs and Slash-Free Orderings of Matrices

  2022cites this paper
• Min-Orderable Digraphs

  2020influential citation
• Interval-Like Graphs and Digraphs

  2018influential citation
• Independent Sets and Hitting Sets of Bicolored Rectangular Families

  2014cites this paper
• Integer Programming and Combinatorial Optimization

  2013cites this paper
• Algorithms and hardness results for the jump number problem, the joint replenishment problem, and the optimal clustering of frequency-constrained maintenance jobs

  2012influential citation
• List homomorphisms and bipartite co-circular arc graphs

  2012cites this paper
• Contributions on secretary problems, independent sets of rectangles and related problems

  2011cites this paper
• Jump Number of Two-Directional Orthogonal Ray Graphs

  2011influential citation