The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Meir Katchalski: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. H. L. Abbott, Meir Katchalski
    Covering Squares with Squares. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2000, v:24, n:2-3, pp:151-170 [Journal]
  2. Andrei Asinowski, Meir Katchalski
    Forbidden Families of Geometric Permutations in Rd. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2005, v:34, n:1, pp:1-10 [Journal]
  3. Andrei Asinowski, Meir Katchalski
    The Maximal Number of Geometric Permutations for n Disjoint Translates of a Convex Set in R Is Omega(n). [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2006, v:35, n:3, pp:473-480 [Journal]
  4. Noga Alon, Meir Katchalski, William R. Pulleyblank
    Cutting Disjoint Disks by Straight Lines. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1989, v:4, n:, pp:239-243 [Journal]
  5. Noga Alon, Meir Katchalski, William R. Pulleyblank
    The Maximum Size of a Convex Polygon in a Restricted Set in the Plane. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1989, v:4, n:, pp:245-251 [Journal]
  6. Andreas Holmsen, Meir Katchalski, Ted Lewis
    A Helly-Type Theorem for Line Transversals to Disjoint Unit Balls. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2003, v:29, n:4, pp:595-602 [Journal]
  7. Meir Katchalski, H. Last
    On Geometric Graphs with No Two Edges in Convex Position. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1998, v:19, n:3, pp:399-404 [Journal]
  8. Meir Katchalski, Ted Lewis, A. Liu
    The Different Ways of Stabbling Disjoint Convex Sets. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1992, v:7, n:, pp:197-206 [Journal]
  9. Meir Katchalski, D. Nashtir
    A Helly Type Conjecture. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1999, v:21, n:1, pp:37-43 [Journal]
  10. Meir Katchalski, Subhash Suri, Yunhong Zhou
    A Constant Bound for Geometric Permutations of Disjoint Unit Balls. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2003, v:29, n:2, pp:161-173 [Journal]
  11. Andrei Asinowski, Andreas Holmsen, Meir Katchalski
    The triples of geometric permutations for families of disjoint translates. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:241, n:1-3, pp:23-32 [Journal]
  12. Wayne Goddard, Meir Katchalski, Daniel J. Kleitman
    Forcing Disjoint Segments in the Plane. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 1996, v:17, n:4, pp:391-395 [Journal]
  13. Meir Katchalski, Roy Meshulam
    An Extremal Problem for Families of Pairs of Subspaces. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 1994, v:15, n:3, pp:253-257 [Journal]
  14. H. L. Abbott, Meir Katchalski
    On the snake in the box problem. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1988, v:45, n:1, pp:13-24 [Journal]
  15. Meir Katchalski, Ted Lewis
    Cutting rectangles in the plane. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1982, v:42, n:1, pp:67-71 [Journal]
  16. Meir Katchalski, Ted Lewis, Joseph Zaks
    Geometric permutations for convex sets. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1985, v:54, n:3, pp:271-284 [Journal]
  17. Meir Katchalski, Ted Lewis, A. Liu
    Geometric permutations of disjoint translates of convex sets. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1987, v:65, n:3, pp:249-259 [Journal]
  18. H. L. Abbott, Meir Katchalski
    Snakes and pseudo-snakes in powers of complete graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1988, v:68, n:1, pp:1-8 [Journal]
  19. H. L. Abbott, Meir Katchalski
    Further results on snakes in powers of complete graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1991, v:91, n:2, pp:111-120 [Journal]
  20. Meir Katchalski, William McCuaig, Suzanne Seager
    Ordered colourings. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1995, v:142, n:1-3, pp:141-154 [Journal]
  21. H. L. Abbott, Meir Katchalski, Bing Zhou
    Proof of a conjecture of Dirac concerning 4-critical planar graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1994, v:132, n:1-3, pp:367-371 [Journal]

Search in 0.004secs, Finished in 0.004secs
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