Jonathan Backer

According to our database, Jonathan Backer authored at least 7 papers between 2006 and 2011.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2011

Separator orders in interval, cocomparability, and AT-free graphs.

Jonathan Backer

Discret. Appl. Math., 2011

2010

Constant factor approximation algorithms for the densest k-subgraph problem on proper interval graphs and bipartite permutation graphs.

Jonathan Backer, J. Mark Keil

Inf. Process. Lett., 2010

The Mono- and Bichromatic Empty Rectangle and Square Problems in All Dimensions.

Jonathan Backer, J. Mark Keil

Proceedings of the LATIN 2010: Theoretical Informatics, 2010

2009

The Bichromatic Rectangle Problem in High Dimensions.

Jonathan Backer, J. Mark Keil

Proceedings of the 21st Annual Canadian Conference on Computational Geometry, 2009

2008

A Complete Approximation Algorithm for Shortest Bounded-Curvature Paths.

Jonathan Backer, David G. Kirkpatrick

Proceedings of the Algorithms and Computation, 19th International Symposium, 2008

2007

Finding curvature-constrained paths that avoid polygonal obstacles.

Jonathan Backer, David G. Kirkpatrick

Proceedings of the 23rd ACM Symposium on Computational Geometry, 2007

2006

Bounded-Curvature Path Normalization.

Jonathan Backer, David G. Kirkpatrick

Proceedings of the 18th Annual Canadian Conference on Computational Geometry, 2006