| | |
- CSB - MetaPress - Google - Bing - Yahoo
 | 2011 | |
|---|---|---|
| 7 |      | Jonathan Backer: Separator orders in interval, cocomparability, and AT-free graphs. Discrete Applied Mathematics 159(8): 717-726 (2011) |
| 2010 | ||
| 6 | | Jonathan Backer, J. Mark Keil: The Mono- and Bichromatic Empty Rectangle and Square Problems in All Dimensions. LATIN 2010: 14-25 |
| 5 | | Jonathan Backer, J. Mark Keil: Constant factor approximation algorithms for the densest k-subgraph problem on proper interval graphs and bipartite permutation graphs. Inf. Process. Lett. 110(16): 635-638 (2010) |
| 2009 | ||
| 4 | | Jonathan Backer, J. Mark Keil: The Bichromatic Rectangle Problem in High Dimensions. CCCG 2009: 157-160 |
| 2008 | ||
| 3 | | Jonathan Backer, David G. Kirkpatrick: A Complete Approximation Algorithm for Shortest Bounded-Curvature Paths. ISAAC 2008: 628-643 |
| 2007 | ||
| 2 | | Jonathan Backer, David G. Kirkpatrick: Finding curvature-constrained paths that avoid polygonal obstacles. Symposium on Computational Geometry 2007: 66-73 |
| 2006 | ||
| 1 | | Jonathan Backer, David G. Kirkpatrick: Bounded-Curvature Path Normalization. CCCG 2006 |
| 1 | J. Mark Keil | [4] [5] [6] |
| 2 | David G. Kirkpatrick | [1] [2] [3] |
Data released under the ODC-BY 1.0 license — See also our legal information page