Rados Radoicic

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Rom Pinchasi

> Home > Persons > Rados Radoicic

Publications

2014
[j15]
- view
  authority control:
- export record
  dblp key:
  - journals/combinatorics/AckermanPPRT14
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/combinatorics/AckermanPPRT14
Eyal Ackerman, János Pach, Rom Pinchasi, Rados Radoicic, Géza Tóth:
A Note on Coloring Line Arrangements. Electron. J. Comb. 21(2): 2 (2014)
2006
[j7]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/jct/PinchasiRS06
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jct/PinchasiRS06
Rom Pinchasi, Rados Radoicic, Micha Sharir:
On empty convex polygons in a planar point set. J. Comb. Theory, Ser. A 113(3): 385-419 (2006)
2005
[j5]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/jct/AlonPPRS05
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jct/AlonPPRS05
Noga Alon, János Pach, Rom Pinchasi, Rados Radoicic, Micha Sharir:
Crossing patterns of semi-algebraic sets. J. Comb. Theory, Ser. A 111(2): 310-326 (2005)
2004
[c4]
- view
  authority control:
- export record
  dblp key:
  - conf/compgeom/PinchasiRS04
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/compgeom/PinchasiRS04
Rom Pinchasi, Rados Radoicic, Micha Sharir:
On empty convex polygons in a planar point set. SCG 2004: 391-400
2003
[c3]
- view
  authority control:
- export record
  dblp key:
  - conf/compgeom/PinchasiR03
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/compgeom/PinchasiR03
Rom Pinchasi, Rados Radoicic:
Topological graphs with no self-intersecting cycle of lenth 4. SCG 2003: 98-103

a service of

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.