Stefan Langerman's Publications As of July 5, 2016

journal | conference | other

This list is also available as a BibTeX file.

Papers Accepted in Refereed Journals

1
S. Bereg, J.M. Díaz-Báñez, D. Flores-Peñaloza, S. Langerman, P. Pérez-Lantero and J. Urrutia.
Optimizing some constructions with bars: new geometric knapsack problems.
Journal of Combinatorial Optimization, 31(3):1160-1173, 2016.

2
L. Barba, M. Korman, S. Langerman, K. Sadakane and R.I. Silveira.
Space-time trade-offs for stack-based algorithms.
Algorithmica, 72(4):1097-1129, August 2015.

3
M. Korman, S. Langerman, W. Mulzer, A. Pilz and B. Vogtenhuber.
Minimum dual diameter triangulations.
Computational Geometry: Theory and Applications, to appear.

4
J. Cardinal, S. Collette, H. Ito, M. Korman, S. Langerman, H. Sakaidani and P. Taslakian.
Cannibal animal games: a new variant of tic-tac-toe.
Journal of Information Processing, 23(3):265-271, 2015.

5
G. Aloupis, L. Barba, J.-L. De Carufel, S. Langerman, and D. Souvaine.
Isoperimetric enclosures.
Graphs and Combinatorics, 31(2):361-392, March 2015.

6
H. Ito, S. Langerman and Y. Yoshida.
Generalized river crossing problems.
Theory of Computing Systems, 56(2):418-435, February 2015.

7
G. Aloupis, L. Barba, S. Langerman, and D. Souvaine.
Bichromatic compatible matchings.
Computational Geometry: Theory and Applications, 48(8):622-633, September 2015.
Special issue of selected papers from the 2013 Symposium on Computational Geometry (SoCG'13).

8
S. Cabello, J. Cardinal and S. Langerman.
The clique problem in ray intersection graphs.
Discrete & Computational Geometry, 50(3):771-783, October 2013.

9
P. Bose, J. Cardinal, S. Collette, F. Hurtado, S. Langerman, M. Korman and P. Taslakian.
Coloring and guarding arrangements.
Discrete Mathematics & Theoretical Computer Science, 15(3):139-154, 2013.

10
S. Collette, E.D. Demaine, M.L. Demaine and S. Langerman.
Narrow misère dots-and-boxes.
In Richard J. Nowakowski, editor, Games of No Chance 4, volume 63 of MSRI Publications, pages 57-64. Cambridge University Press, April 2015.

11
L. Barba, M. Korman, S. Langerman and R.I. Silveira.
Computing the visibility polygon using few variables.
Computational Geometry: Theory and Applications, 47(9):918-926, October 2014.

12
Y. Higashikawa, N. Katoh, S. Langerman and S. Tanigawa.
Online graph exploration algorithms for cycles and trees by multiple searchers.
Journal of Combinatorial Optimization, 28(2):480-495, 2014.

13
D. Bremner, T.M. Chan, E.D. Demaine, J. Erickson, F. Hurtado, J. Iacono, S. Langerman, M. Patraşcu and P. Taslakian.
Necklaces, convolutions, and X + Y .
Algorithmica, 69(2):294-314, June 2014.

14
P. Bose, V. Dujmovic, F. Hurtado, J. Iacono, S. Langerman, H. Meijer, V. Sacristán, M. Saumell and D.R. Wood.
Proximity graphs: E , δ , Δ , χ and ω .
International Journal of Computational Geometry and Applications, 22(5):439-469, October 2012.

15
V. Dujmovic and S. Langerman.
A center transversal theorem for hyperplanes and applications to graph drawing.
Discrete & Computational Geometry, 49(1):74-88, January 2013.
Special issue of selected papers from the 2011 Symposium on Computational Geometry (SoCG'11).

16
S.-W. Cheng, C. Knauer, S. Langerman and M. Smid.
Approximating the average stretch factor of geometric graphs.
Journal of Computational Geometry, 3(1):132-153, 2012.

17
P. Bose, S. Collette, F. Hurtado, M. Korman, S. Langerman, V. Sacristán and M. Saumell.
Some properties of k -delaunay and k -gabriel graphs.
Computational Geometry: Theory and Applications, 46(2):131-139, February 2013.
Special issue of selected papers from the 22nd Canadian Conference on Computational Geometry (CCCG'10).

18
S. Collette, V. Dujmovic, J. Iacono, P. Morin and S. Langerman.
Entropy, triangulation, and point location in planar subdivisions.
ACM Transactions on Algorithms, 8(3):29:1-29:18, July 2012.

19
G. Aloupis, P. Bose, V. Dujmovic, C. Gray, S. Langerman and B. Speckmann.
Triangulating and guarding realistic polygons.
Computational Geometry: Theory and Applications, 47(2):296-306, February 2014.
Special issue of selected papers from the 20th Canadian Conference on Computational Geometry (CCCG'08).

20
G. Aloupis, J. Cardinal, S. Collette, E.D. Demaine, M.L. Demaine, M. Dulieu, R. Fabila-Monroy, V. Hart, F. Hurtado, S. Langerman, M. Saumell, C. Seara and P. Taslakian.
Non-crossing matchings of points with geometric objects.
Computational Geometry: Theory and Applications, 46(1):78-92, 2013.

21
J. Cardinal, E.D. Demaine, S. Fiorini, G. Joret, S. Langerman, I. Newman and O. Weimann.
The stackelberg minimum spanning tree game.
Algorithmica, 59(2):129-144, February 2011.

22
Z. Abel, B. Ballinger, P. Bose, S. Collette, V. Dujmovic, F. Hurtado, S.D.Kominers, S. Langerman, A. Pór and D.R. Wood.
Every large point set contains many collinear points or an empty pentagon.
Graphs and Combinatorics, 27(1):47-60, 2011.

23
G. Aloupis, S. Collette, M. Damian, E.D. Demaine, D. El-Khechen, R. Flatland, S. Langerman, J. O'Rourke, V. Pinciu, S. Ramaswami, V. Sacristán and S. Wuhrer.
Efficient constant-velocity reconfiguration of crystalline robots.
Robotica, 29(1):59-71, January 2011.

24
E.D. Demaine, M.L. Demaine, V. Hart, J. Iacono, S. Langerman and J. O'Rourke.
Continuous blooming of convex polyhedra.
Graphs and Combinatorics, 27(3):363-376, 2011.
Special issue on The Japan Conference on Computational Geometry and Graphs (JCCGG2009).

25
G. Aloupis, J. Cardinal, S. Collette, S. Imahori, M. Korman, S. Langerman, O. Schwartz, S. Smorodinsky and P. Taslakian.
Colorful strips.
Graphs and Combinatorics, 27(3):327-339, 2011.
Special issue on The Japan Conference on Computational Geometry and Graphs (JCCGG2009).

26
J. Cardinal, E.D. Demaine, M.L. Demaine, S. Imahori, S. Langerman and R. Uehara.
Algorithmic folding complexity.
Graphs and Combinatorics, 27(3):341-351, 2011.
Special issue on The Japan Conference on Computational Geometry and Graphs (JCCGG2009).

27
G. Aloupis, P. Bose, E.D. Demaine, S. Langerman, H. Meijer, M. Overmars and G.T. Toussaint.
Computing signed permutations of polygons.
International Journal of Computational Geometry and Applications, 21(1):87-100, February 2011.

28
G. Aloupis, J. Cardinal, S. Collette, S. Langerman, D. Orden and P.A. Ramos.
Decomposition of multiple coverings into more parts.
Discrete & Computational Geometry, 44(3):706-723, October 2010.

29
R. Connelly, E.D. Demaine, M.L. Demaine, S.P. Fekete, S. Langerman, J.S.B. Mitchell, A. Ribó and G. Rote.
Locked and unlocked chains of planar shapes.
Discrete & Computational Geometry, 44(2):439-462, September 2010.

30
J. Cardinal, S. Langerman and E. Levy.
Improved approximation bounds for edge dominating set in dense graphs.
Theoretical Computer Science, 410(8-10):949-957, March 2009.

31
T. Abbott, M.A. Burr, T.M. Chan, E.D. Demaine, M.L. Demaine, J. Hugg, D. Kane, S. Langerman, J. Nelson, E. Rafalin, C. Seyboth and V. Yeung.
Dynamic ham-sandwich cuts in the plane.
Computational Geometry: Theory and Applications, 42(5):419-428, July 2009.

32
J. Cardinal, M. Labbé, S. Langerman and B. Palop.
Pricing of geometric transportation networks.
International Journal of Computational Geometry and Applications, 19(6):507-520, December 2009.

33
G. Aloupis, J. Cardinal, S. Collette, F. Hurtado, S. Langerman and J. O'Rourke.
Draining a polygon - or - rolling a ball out of a polygon.
Computational Geometry: Theory and Applications, 47(2C):316-328, February 2014.
Special issue of selected papers from the 20th Canadian Conference on Computational Geometry (CCCG'08).

34
G. Aloupis, J. Cardinal, S. Collette, F. Hurtado, S. Langerman, J. O'Rourke and B. Palop.
Highway hull revisited.
Computational Geometry: Theory and Applications, 43(2):115-130, 2010.

35
G. Aloupis, S. Collette, M. Damian, E.D. Demaine, R. Flatland, S. Langerman, J. O'Rourke, S. Ramaswami, V. Sacristán and S. Wuhrer.
Linear reconfiguration of cube-style modular robots.
Computational Geometry: Theory and Applications, 42(6-7):652-663, August 2009.

36
E.D. Demaine, S. Langerman and E. Price.
Confluently persistent tries for efficient version control.
Algorithmica, 57(3):462-483, July 2010.
Special issue of selected papers from 11th Scandinavian Workshop on Algorithm Theory, 2008.

37
E.D. Demaine, M.L. Demaine, J. Iacono and S. Langerman.
Wrapping spheres with flat paper.
Computational Geometry: Theory and Applications, 42(8):748-757, October 2009.
Special issue of selected papers from 23rd European Workshop on Computational Geometry (EuroCG'07).

38
P. Bose, S. Collette, S. Langerman, A. Maheshwari, P. Morin and M. Smid.
Sigma-local graphs.
Journal of Discrete Algorithms, 8(1):15-23, March 2010.

39
G. Aloupis, J. Cardinal, S. Collette, S. Langerman and S. Smorodinsky.
Coloring geometric range spaces.
Discrete & Computational Geometry, 41(2):348-362, March 2009.

40
J. Cardinal, S. Collette and S. Langerman.
Empty region graphs.
Computational Geometry: Theory and Applications, 42(3):183-195, April 2009.

41
P. Bose, V. Dujmovic, F. Hurtado, S. Langerman, P. Morin and D.R. Wood.
A polynomial bound for untangling geometric planar graphs.
Discrete & Computational Geometry, 42(4):570-585, December 2009.

42
K. Douïeb and S. Langerman.
Near-entropy hotlink assignments.
Algorithmica, 58(2):221-244, October 2010.

43
P.K. Agarwal, R. Klein, C. Knauer, S. Langerman, P. Morin, M. Sharir and M. Soss.
Computing the detour and spanning ratio of paths, trees, and cycles in 2D and 3D.
Discrete & Computational Geometry, 39(1):17-37, 2008.
Special issue: Discrete and Computational Geometry -- Twenty Years Later.

44
J. Cardinal, S. Collette, F. Hurtado, S. Langerman and B. Palop.
Optimal location of transportation devices.
Computational Geometry: Theory and Applications, 41(3):219-229, November 2008.

45
D. Bremner, D. Chen, J. Iacono, S. Langerman, and P. Morin.
Output-sensitive algorithms for Tukey depth and related problems.
Statistics and Computing, 18(3):259-266, September 2008.

46
P. Bose, V. Dujmovic, D. Krizanc, S. Langerman, P. Morin, D.R. Wood and S. Wuhrer.
A characterization of the degree sequences of 2-trees.
Journal of Graph Theory, 58(3):191-209, July 2008.

47
S. Cabello, J.M. Díaz-Báñez, S. Langerman, C. Seara, and I. Ventura.
Reverse facility location problems.
European Journal of Operational Research, 102(1):99-106, April 2010.

48
B. Aronov, F. Aurenhammer, F. Hurtado, S. Langerman, D. Rappaport, C. Seara and S. Smorodinsky.
Small weak epsilon nets.
Computational Geometry: Theory and Applications, 42(5):455-462, July 2009.
Special issue of selected papers from the 17th Canadian Conference on Computational Geometry (CCCG'05).

49
E.D. Demaine, J. Iacono and S. Langerman.
Retroactive data structures.
ACM Transactions on Algorithms, 3(2):13.1-13.20, May 2007.

50
J. Colannino, M. Damian, F. Hurtado, S. Langerman, H. Meijer, S. Ramaswami, D. Souvaine and G.T. Toussaint.
Efficient many-to-many point matching in one dimension.
Graphs and Combinatorics, 23(Supplement):169-178, 2007.
Special issue on Computational Geometry and Graph Theory: The Akiyama-Chvatal Festschrift.

51
E.D. Demaine, J. Iacono and S. Langerman.
Grid vertex-unfolding orthostacks.
International Journal of Computational Geometry and Applications, 20(3):245-254, June 2010.

52
K. Douïeb and S. Langerman.
Dynamic hotlinks.
Algorithmica, 50(2):208-222, February 2008.
Special issue of selected papers from the 9th Workshop on Algorithms and Data Structures (WADS 2005).

53
E.D. Demaine J. Iacono and S. Langerman.
Worst-case optimal tree layout in external memory.
Algorithmica, 72(2):369-378, June 2015.

54
P. Bose, E.D. Demaine, F. Hurtado, J. Iacono, S. Langerman and P. Morin.
Geodesic ham-sandwich cuts.
Discrete & Computational Geometry, 37(3):325-339, March 2007.

55
G. Aloupis, E.D. Demaine, S. Langerman, P. Morin, J. O'Rourke, I. Streinu, and G.T. Toussaint.
Unfolding polyhedral bands.
Computational Geometry: Theory and Applications, 39:30-42, 2008.
Special issue of selected papers from the 16th Canadian Conference on Computational Geometry (CCCG'04).

56
J. Cardinal, S. Collette, and S. Langerman.
Local properties of geometric graphs.
Computational Geometry: Theory and Applications, 39:55-64, 2008.
Special issue of selected papers from the 16th Canadian Conference on Computational Geometry (CCCG'04).

57
G. Aloupis, T. Fevens, S. Langerman, T. Matsui, A. Mesa, Y. Nuñez, D. Rappaport and G.T. Toussaint.
Algorithms for computing geometric measures of melodic similarity.
Computer Music Journal, 30(3):67-76, Fall 2006.

58
J. Cardinal, S. Kremer, and S. Langerman.
Juggling with pattern matching.
Theory of Computing Systems, 39(3):425-437, 2006.
Special issue of selected papers from the 3rd International Conference on Fun with Algorithms (FUN 2004).

59
E.D. Demaine, M.L. Demaine, A. Langerman, and S. Langerman.
Morpion solitaire.
Theory of Computing Systems, 39(3):439-453, 2006.
Special issue of selected papers from the 3rd International Conference on Fun with Algorithms (FUN 2004). Translated into Portuguese: ``Cinco-em-linha solitário'', Boletim da Sociedade Portuguesa de Matemática 54:125-142, May 2006.

60
E.D. Demaine, J. Erickson, F. Hurtado, J. Iacono, S. Langerman, H. Meijer, M. Overmars and S. Whitesides.
Separating point sets in polygonal environments.
International Journal of Computational Geometry and Applications, 15(4):403-419, August 2005.
Special issue of selected papers from the 20th Annual ACM Symposium on Computational Geometry (SoCG 2004).

61
E.D. Demaine, S. Langerman and J. O'Rourke.
Geometric restrictions on polygonal protein chain production.
Algorithmica, 44(2):167-181, February 2006.
Special issue of selected papers from the 14th Annual International Symposium on Algorithms and Computation (ISAAC 2003).

62
D. Bremner, E.D. Demaine, J. Erickson, J. Iacono, S. Langerman, P. Morin and G.T. Toussaint.
Output-sensitive algorithms for computing nearest-neighbour decision boundaries.
Discrete & Computational Geometry, 33(4):593-604, April 2005.

63
S. Langerman and P. Morin.
Covering things with things.
Discrete & Computational Geometry, 33(4):717-729, April 2005.

64
J. Iacono and S. Langerman.
Queaps.
Algorithmica, 42(1):49-56, March 2005.
Special issue of selected papers from the 13th Annual International Symposium on Algorithms and Computation (ISAAC 2002).

65
J. Cardinal and S. Langerman.
Designing small keyboards is hard.
Theoretical Computer Science, 332:405-415, 2005.

66
E.D. Demaine, J. Iacono and S. Langerman.
Proximate point searching.
Computational Geometry: Theory and Applications, 28(1):29-40, May 2004.
Special issue of selected papers from the 14th Canadian Conference on Computational Geometry (CCCG'02).

67
P. Bose, D. Krizanc, S. Langerman and P. Morin.
Asymmetric communication protocols via hotlink assignments.
Theory of Computing Systems, 36(6):655-661, 2003.
Special issue of selected papers from the IX International Colloquium on Structural Information and Communication Complexity (SIROCCO 2002).

68
E.D. Demaine, S. Langerman, J. O'Rourke and J. Snoeyink.
Interlocked open and closed linkages with few joints.
Computational Geometry: Theory and Applications, 26(1):37-45, 2003.
Special issue of selected papers from the 13th Canadian Conference on Computational Geometry (CCCG'01).

69
G. Aloupis, S. Langerman, M. Soss and G.T. Toussaint.
Algorithms for bivariate medians and a fermat-torricelli problem for lines.
Computational Geometry: Theory and Applications, 26(1):69-79, 2003.
Special issue of selected papers from the 13th Canadian Conference on Computational Geometry (CCCG'01).

70
S. Langerman.
On the complexity of halfspace area queries.
Discrete & Computational Geometry, 30(4):639-648, October 2003.
[ps.gz].

71
S. Langerman and W. Steiger.
The complexity of hyperplane depth in the plane.
Discrete & Computational Geometry, 30(2):299-309, August 2003.

Papers Accepted at Refereed Conferences

1
S. Allen, L. Barba, J. Iacono and S. Langerman.
Incremental Voronoi diagrams.
In Sándor Fekete and Anna Lubiw, editors, 32nd International Symposium on Computational Geometry (SoCG 2016), volume 51 of Leibniz International Proceedings in Informatics (LIPIcs), pages 15:1-15:16, Dagstuhl, Germany, 2016. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik.

2
S. Langermanand A. Winslow.
A Quasilinear-Time Algorithm for Tiling the Plane Isohedrally with a Polyomino.
In Sándor Fekete and Anna Lubiw, editors, 32nd International Symposium on Computational Geometry (SoCG 2016), volume 51 of Leibniz International Proceedings in Informatics (LIPIcs), pages 50:1-50:15, Dagstuhl, Germany, 2016. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik.

3
S. Langerman and Y. Uno.
Threes!, Fives, 1024!, and 2048 are Hard.
In Erik D. Demaine and Fabrizio Grandoni, editors, 8th International Conference on Fun with Algorithms (FUN 2016), volume 49 of Leibniz International Proceedings in Informatics (LIPIcs), pages 22:1-22:14, Dagstuhl, Germany, 2016. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik.

4
L. Barba and S. Langerman.
Optimal detection of intersections between convex polyhedra.
In Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'15), pages 1641-1654, 2015.

5
P. Bose, K. Douïeb, J. Iacono and S. Langerman.
The power and limitations of static binary search trees with lazy finger.
In Proceedings of the International Symposium on Algorithms and Computation (ISAAC 2014), volume 8889 of LNCS, pages 181-192, 2014.

6
O. Aichholzer, J. Cardinal, V. Kusters, S. Langerman, and P. Valtr.
Reconstructing point set order types from radial orderings.
In Proceedings of the International Symposium on Algorithms and Computation (ISAAC 2014), volume 8889 of LNCS, pages 15-26, 2014.

7
P. Cheilaris, E. Khramtcova, S. Langerman and E. Papadopoulou.
A randomized incremental approach for the hausdorff voronoi diagram of non-crossing clusters.
In Proceedings of the Latin American Theoretical Informatics Symposium (LATIN 2014), volume 8392 of LNCS, pages 96-107, 2014.

8
L. Barba, P. Bose, and S. Langerman.
Optimal algorithms for constrained 1-center problems.
In Proceedings of the Latin American Theoretical Informatics Symposium (LATIN 2014), volume 8392 of LNCS, pages 84-95, 2014.

9
G. Aloupis, J. Iacono, S. Langerman, Ö. Özkan and S. Wuhrer.
The complexity of order type isomorphism.
In Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'14), pages 405-415, 2014.

10
A Asinowski, J. Cardinal, N. Cohen, S. Collette, T. Hackl, M. Hoffmann, K. Knauer, S. Langerman, M. Lason, P. Micek, G. Rote and T. Ueckerdt.
Coloring hypergraphs induced by dynamic point sets and bottomless rectangles.
In Proceedings of the Algorithms and Data Structures Symposium (WADS 2013), volume 8037 of LNCS, pages 73-84, 2013.

11
E.D. Demaine, J. Iacono, S. Langerman, and Ö. Özkan.
Combining binary search trees.
In Proceedings of the 40th International Colloquium on Automata, Languages and Programming (ICALP 2013), volume 7965 of LNCS, pages 388-399, 2013.

12
G. Aloupis, L. Barba, S. Langerman, and D. Souvaine.
Bichromatic compatible matchings.
In Proceedings of the 29th ACM Symposium on Computational Geometry (SoCG 2013), pages 267-276, 2013.

13
L. Barba, M. Korman, S. Langerman, R.I. Silveira, and K. Sadakane.
Space-time trade-offs for stack-based algorithms.
In Proceedings of the 30th Symposium on Theoretical Aspects of Computer Science (STACS 2013), Leibniz International Proceedings in Informatics (LIPIcs), pages 281-292, Dagstuhl, Germany, 2013. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik.

14
S. Cabello, J. Cardinal and S. Langerman.
The clique problem in ray intersection graphs.
In Proceedings of the European Symposium on Algorithms (ESA2012), volume 7501 of LNCS, pages 241-252, 2012.

15
P. Bose, S. Collette, R. Fagerberg and S. Langerman.
Deamortizing binary search trees.
In Proceedings of the 39th International Colloquium on Automata, Languages and Programming (ICALP 2012), volume 7391 of LNCS, pages 121-132, 2012.

16
H. Ito, S. Langerman and Y. Yoshida.
Algorithms and complexity of generalized river crossing problems.
In Proceedings of the sixth International Conference on Fun with Algorithms (FUN 2012), volume 7288 of LNCS, pages 235-244, 2012.

17
S. Collette, J. Iacono and S. Langerman.
Confluent persistence revisited.
In Proceedings of the ACM-SIAM Symposium on Discrete Algorithms (SODA'12), pages 593-601, 2012.

18
G. Aloupis, P. Bose, S. Collette, E.D. Demaine, M.L. Demaine, K. Douïeb, V. Dujmovic, J. Iacono, S. Langerman and P. Morin.
Common unfoldings of polyominoes and polycube.
In Revised Papers from the China-Japan Joint Conference on Computational Geometry, Graphs and Applications (CGGA 2010), volume 7033 of LNCS, pages 44-54, Dalian, China, November 3-6 2010.

19
L. Barba, M. Korman, S. Langerman and R.I. Silveira.
Computing the visibility polygon using few variables.
In Proceedings of the International Symposium on Algorithms and Computation (ISAAC 2011), volume 7074 of LNCS, pages 70-79. Springer-Verlag, 2011.

20
V. Dujmovic and S. Langerman.
A center transversal theorem for hyperplanes and applications to graph drawing.
In Proceedings of the 2011 ACM Symposium on Computational Geometry (SoCG 2011), pages 117-124, 2011.

21
S.-W. Cheng, C. Knauer, S. Langerman and M. Smid.
Approximating the average stretch factor of geometric graphs.
In Proceedings of the International Symposium on Algorithms and Computation (ISAAC 2010), volume 5606 of LNCS, pages 37-48. Springer-Verlag, 2010.

22
G. Aloupis, J. Cardinal, S. Collette, E.D. Demaine, M.L. Demaine, M. Dulieu, R. Fabila-Monroy, V. Hart, F. Hurtado, M. Saumell, C. Seara and P. Taslakian.
Matching points with things.
In Proceedings of the 9th Latin American Theoretical Informatics Symposium (LATIN 2010), volume 6034 of LNCS, pages 456-467. Springer-Verlag, 2010.

23
G. Aloupis, J. Cardinal, S. Collette, S. Imahori, M. Korman, S. Langerman, O. Schwartz, S. Smorodinsky and P. Taslakian.
Colorful strips.
In Proceedings of the 9th Latin American Theoretical Informatics Symposium (LATIN 2010), volume 6034 of LNCS, pages 2-13. Springer-Verlag, 2010.

24
F. Pluquet, S. Langerman and R. Wuyts.
Executing code in the past: Efficient in-memory object graph versioning.
In Proceedings of the 2009 ACM SIGPLAN Conference on Object-Oriented Programming Systems, Languages, and Applications (OOPSLA'09), 2009.

25
G. Aloupis, S. Collette, M. Damian, E.D. Demaine, D. El-Khechen, R. Flatland, S. Langerman, J. O'Rourke, V. Pinciu, S. Ramaswami, V. Sacristán and S. Wuhrer.
Realistic reconfiguration of crystalline (and telecube) robots.
In Proceedings of the Workshop on the Algorithmic Foundations of Robotics (WAFR'08), 2008.

26
G. Aloupis, J. Cardinal, S. Collette, S. Langerman, D. Orden and P.A. Ramos.
Decomposition of multiple coverings into more parts.
In Proceedings of the ACM-SIAM Symposium on Discrete Algorithms (SODA'09), pages 302-310, 2009.

27
G. Aloupis, S. Collette, E.D. Demaine, S. Langerman, V. Sacristán and S. Wuhrer.
Reconfiguration of cube-style modular robots using O(log n) parallel moves.
In Proceedings of the 19th Annual International Symposium on Algorithms and Computation (ISAAC 2008), pages 342-353, 2008.

28
E.D. Demaine, S. Langerman and E. Price.
Confluently persistent tries for efficient version control.
In Proceedings of the 11th Scandinavian Workshop on Algorithm Theory, volume 5124 of LNCS, pages 160-172. Springer-Verlag, 2008.

29
P. Bose, V. Dujmovic, F. Hurtado, S. Langerman, P. Morin and D.R. Wood.
A polynomial bound for untangling geometric planar graphs.
In Proceedings of the International Conference on Topological & Geometric Graph Theory (TGGT'08), volume 31 of Electronic Notes in Discrete Mathematics, pages 213-218, 2008.

30
G. Aloupis, J. Cardinal, S. Collette, S. Langerman and S. Smorodinsky.
Coloring geometric range spaces.
In Proceedings of the 8th Latin American Theoretical Informatics (LATIN'08), volume 4957 of LNCS, pages 146-157. Springer-Verlag, 2008.

31
F. Pluquet, S. Langerman, A. Marot and R. Wuyts.
Implementing partial persistence in object-oriented languages.
In Proceedings of the Workshop on Algorithm Engineering and Experiments (ALENEX08), pages 37-48, 2008.

32
P. Bose, K. Douïeb and S. Langerman.
Dynamic optimality for skip lists and B-trees.
In Proceedings of the ACM-SIAM Symposium On Discrete Algorithms (SODA2008), pages 1106-1114, 2008.

33
S. Collette, V. Dujmovic, J. Iacono, S. Langerman and P. Morin.
Distribution-sensitive point location in convex subdivisions.
In Proceedings of the ACM-SIAM Symposium On Discrete Algorithms (SODA2008), pages 912-921, 2008.

34
G. Aloupis, S. Collette, M. Damian, E.D. Demaine, R. Flatland, S. Langerman, J. O'Rourke, S. Ramaswami, V. Sacristán and S. Wuhrer.
Linear reconfiguration of cube-style modular robots.
In Proceedings of the 18th Annual International Symposium on Algorithms and Computation (ISAAC 2007), volume 4835 of LNCS, pages 208-219. Springer-Verlag, 2007.

35
J. Cardinal, S. Langerman and G. Louchard.
Randomized optimization: a probabilistic analysis.
In Proceedings of the International Conference on Analysis of Algorithms (AofA 2007), DMTCS, pages 53-72, 2007.

36
J. Cardinal, E.D. Demaine, S. Fiorini, G. Joret, S. Langerman, I. Newman and O. Weimann.
The stackelberg minimum spanning tree game.
In Proceedings of the 10th Workshop on Algorithms and Data Structures (WADS 2007), volume 4619 of LNCS, pages 64-76. Springer-Verlag, 2007.

37
P. Bose, V. Dujmovic, D. Krizanc, S. Langerman, P. Morin, D.R. Wood and S. Wuhrer.
A characterization of the degree sequences of 2-trees.
In Workshop on Analytic Algorithms and Combinatorics (ANALCO07), 2007.

38
J. Cardinal, S. Langerman and E. Levy.
Improved approximation bounds for edge dominating set in dense graphs.
In 4th Workshop on Approximation and Online Algorithms (WAOA 2006), volume 4368 of LNCS, pages 108-120, Zürich, Switzerland, 2007. Springer Berlin / Heidelberg.

39
K. Douïeb and S. Langerman.
Near-entropy hotlink assignments.
In Proceedings of the 14th Annual European Symposium on Algorithms (ESA 2006), volume 4168 of LNCS, pages 292-303, Zürich, Switzerland, 2006. Springer Berlin / Heidelberg.
[pdf].

40
D. Bremner, T.M. Chan, E.D. Demaine, J. Erickson, F. Hurtado, J. Iacono, S. Langerman and P. Taslakian.
Necklaces, convolutions, and X + Y .
In Proceedings of the 14th Annual European Symposium on Algorithms (ESA 2006), volume 4168 of LNCS, pages 160-171, Zürich, Switzerland, 2006. Springer Berlin / Heidelberg.

41
G. Aloupis, J. Cardinal, S. Collette, and S. Langerman.
Lumines strategies.
In Proceedings of the 5th International Conference on Computer and Games (CG 2006), LNCS, pages 190-199. Springer Berlin / Heidelberg, 2007.

42
R. Connelly, E.D. Demaine, M.L. Demaine, S.P. Fekete, S. Langerman, J.S.B. Mitchell, A. Ribó and G. Rote.
Locked and unlocked chains of planar shapes.
In Proceedings of the 2006 ACM Symposium on Computational Geometry (SoCG 2006), pages 61-70, 2006.

43
B. Aronov, P. Bose, E.D. Demaine, J. Gudmundsson, J. Iacono, S. Langerman and M. Smid.
Data structures for halfplane proximity queries and incremental voronoi diagrams.
In Proceedings of Latin American Theoretical INformatics (LATIN 2006), volume 3887 of LNCS, pages 80-92. Springer-Verlag, 2006.

44
E.D. Demaine and S. Langerman.
Optimizing a 2D function satisfying unimodality properties.
In Proceedings of the 13th European Symposium on Algorithms (ESA 2005), volume 3669 of LNCS, pages 887-898. Springer-Verlag, 2005.

45
K. Douïeb and S. Langerman.
Dynamic hotlinks.
In Proceedings of the 9th Workshop on Algorithms and Data Structures (WADS 2005), volume 3608 of LNCS, pages 182-194. Springer-Verlag, 2005.

46
J. Cardinal, M. Labbé, S. Langerman, E. Levy and H. Mélot.
A tight analysis of the maximal matching heuristic.
In Proceedings of the Eleventh International Computing and Combinatorics Conference (COCOON 2005), volume 3595 of LNCS, pages 701-709. Springer-Verlag, 2005.

47
P. Bose and S. Langerman.
Weighted ham-sandwich cuts.
In Proceedings of the Japan Conference on Discrete and Computational Geometry (JCDCG 2004), volume 3742 of LNCS, pages 48-53. Springer-Verlag, 2005.

48
E.D. Demaine, J. Iacono and S. Langerman.
Grid vertex-unfolding orthostacks.
In Proceedings of the Japan Conference on Discrete and Computational Geometry (JCDCG 2004), volume 3742 of LNCS, pages 76-82. Springer-Verlag, 2005.

49
J. Cardinal, S. Kremer, and S. Langerman.
Juggling with pattern matching.
In Proceedings of the 3rd International Conference on Fun with Algorithms (FUN 2004), pages 147-158, 2004.

50
E.D. Demaine, M.L. Demaine, A. Langerman, and S. Langerman.
Morpion solitaire.
In Proceedings of the 3rd International Conference on Fun with Algorithms (FUN 2004), pages 53-64, 2004.

51
P. Bose, E.D. Demaine, F. Hurtado, J. Iacono, S. Langerman and P. Morin.
Geodesic ham-sandwich cuts.
In Proceedings of the 2004 ACM Symposium on Computational Geometry (SoCG 2004), pages 1-9, 2004.

52
E.D. Demaine, J. Erickson, F. Hurtado, J. Iacono, S. Langerman, H. Meijer, M. Overmars and S. Whitesides.
Separating point sets in polygonal environments.
In Proceedings of the 2004 ACM Symposium on Computational Geometry (SoCG 2004), pages 10-16, 2004.

53
J. Cardinal and S. Langerman.
Designing small keyboards is hard.
In Proceedings of Latin American Theoretical INformatics (LATIN 2004), volume 2976 of LNCS, pages 391-400. Springer-Verlag, 2004.

54
E.D. Demaine, J. Iacono and S. Langerman.
Retroactive data structures.
In Proceedings of the ACM-SIAM Symposium On Discrete Algorithms (SODA2004), pages 281-290, 2004.

55
E.D. Demaine, S. Langerman and J. O'Rourke.
Geometric restrictions on polygonal protein chain production.
In Proceedings of the 14th Annual International Symposium on Algorithms and Computation (ISAAC 2003), volume 2906 of LNCS, pages 395-404. Springer-Verlag, 2003.

56
D. Bremner, E.D. Demaine, J. Erickson, J. Iacono, S. Langerman, P. Morin and G.T. Toussaint.
Output-sensitive algorithms for computing nearest-neighbour decision boundaries.
In Proceedings of the Workshop on Algorithms and Data Structures (WADS 2003), volume 2748 of LNCS, pages 451-461. Springer-Verlag, 2003.

57
J. Iacono and S. Langerman.
Proximate point location.
In Proceedings of the 2003 ACM Symposium on Computational Geometry (SoCG 2003), pages 220-226, 2003.

58
S. Langerman and W. Steiger.
Optimization in arrangements.
In Proceedings of the 20th International Symposium on Theoretical Aspects of Computer Science (STACS 2003), volume 2607 of LNCS, pages 50-61. Springer-Verlag, 2003.
[ps.gz].

59
J. Iacono and S. Langerman.
Queaps.
In Proceedings of the 13th Annual International Symposium on Algorithms and Computation (ISAAC 2002), volume 2518 of LNCS, pages 211-218. Springer-Verlag, 2002.
[ps.gz].

60
G. Aloupis, E.D. Demaine, V. Dujmovic, J. Erickson, S. Langerman, H. Meijer, J. O'Rourke, M. Overmars, M. Soss, I. Streinu and G.T. Toussaint.
Flat-state connectivity of linkages under dihedral motions.
In Proceedings of the 13th Annual International Symposium on Algorithms and Computation (ISAAC 2002), volume 2518 of LNCS, pages 369-380. Springer-Verlag, 2002.
[ps.gz].

61
P. Bose, D. Krizanc, S. Langerman and P. Morin.
Asymmetric communication protocols via hotlink assignments.
In Proceedings of the IX International Colloquium on Structural Information and Communication Complexity (SIROCCO 2002), pages 33-40, 2002.
[ps.gz].

62
S. Langerman and P. Morin.
Covering things with things.
In Proceedings of the 10th European Symposium on Algorithms (ESA 2002), volume 2461 of LNCS, pages 662-673. Springer-Verlag, 2002.

63
E.D. Demaine, S. Langerman, J. O'Rourke and J. Snoeyink.
Interlocked open linkages with few joints.
In Proceedings of the 2002 ACM Symposium on Computational Geometry (SoCG 2002), pages 189-198, 2002.
[ps.gz].

64
S. Langerman, P. Morin and M. Soss.
Computing the maximum detour and spanning ratio of planar chains, trees and cycles.
In Proceedings of the 19th International Symposium on Theoretical Aspects of Computer Science (STACS 2002), volume 2285 of LNCS, pages 250-261. Springer-Verlag, 2002.
Extended abstract appears at 11th Fall Workshop on Computational Geometry, 2001.

65
S. Langerman, S. Lodha and R. Shah.
Algorithms for efficient filtering in content-based multicast.
In Proceedings of the 9th Annual European Symposium on Algorithms (ESA 2001), volume 2161 of LNCS, pages 428-439. Springer-Verlag, 2001.
[ps.gz].

66
S. Langerman and W. Steiger.
Computing a high depth point in the plane.
In Developments in Robust Statistics. International Conference on Robust Statistics 2001, pages 228-234. Physica-Verlag, 2001.
[ps.gz].

67
S. Langerman.
On the complexity of halfspace area queries.
In Proceedings of the 2001 ACM Symposium on Computational Geometry (SoCG 2001), pages 207-211, 2001.
Abstract presented at Euro-CG 2001.

68
J. Iacono and S. Langerman.
Volume queries in polyhedra.
In Proceedings of the Japan Conference on Discrete and Computational Geometry (JCDCG 2000), volume 2098 of LNCS, pages 156-159. Springer-Verlag, 2000.
[ps.gz].

69
S. Langerman and W. Steiger.
An optimal algorithm for hyperplane depth in the plane.
In Proceedings of the ACM-SIAM Symposium On Discrete Algorithms (SODA 2000), pages 54-59, 2000.

70
S. Langerman, G. Seront and H. Bersini.
Step: The easiest way to optimize a function.
In Proceedings of the IEEE World Conference on Computational Intelligence 1994, 1994.

Other Contributions

1
S. Langermanand A. Winslow.
Some results on tilemakers.
In Abstracts of the Japan Conference on Discrete and Computational Geometry and Graphs (JCDCGG 2015), to appear.

2
E.D. Demaineand S. Langerman.
Bust-a-Move/Puzzle Bobble is NP-complete.
In Abstracts of the Japan Conference on Discrete and Computational Geometry and Graphs (JCDCGG 2015), to appear.

3
M. Korman, S. Langerman, W. Mulzer, A. Pilz and B. Vogtenhuber.
Minimum dual diameter triangulations.
In Abstracts of the 30th European Workshop on Computational Geometry (EuroCG14), 2014.

4
G. Aloupis, L. Barba, J.-L. De Carufel, S. Langerman, and D. Souvaine.
Isoperimetric enclosures.
In Abstracts of the Mexican Conference on Discrete Mathematics and Computational Geometry (MCCG 2013), 2013.

5
S. Langerman, M. Shabbir and W. Steiger.
Computing small hitting sets for convex ranges.
In Abstracts of the Japan Conference on Discrete and Computational Geometry and Graphs (JCDCGG 2013), pages 116-117, 2013.

6
O. Aichholzer, S. Allen, G. Aloupis, L. Barba, P. Bose, J.-L. De Carufel, J. Iacono, S. Langerman, D. Souvaine, P. Taslakian and M. Yagnatinsky.
Sum of squared edges for mst of a point set in a unit square.
In Abstracts of the Japan Conference on Discrete and Computational Geometry and Graphs (JCDCGG 2013), pages 70-71, 2013.

7
G. Aloupis, L. Barba, and S. Langerman.
Circle separability queries in logarithmic time.
In Proceedings of the 24th Canadian Conference on Computational Geometry (CCCG 2012), pages 121-125, 2012.

8
P. Bose, J. Cardinal, S. Collette, F. Hurtado, S. Langerman, M. Korman and P. Taslakian.
Coloring and guarding arrangements.
In Abstracts of the 28th European Workshop on Computational Geometry (EuroCG12), pages 89-92, 2012.

9
G. Aloupis, M. Dulieu, J. Iacono, S. Langerman, Ö. Özkan, S. Ramaswami and S. Wuhrer.
Order type invariant labeling and comparison of point sets.
In Abstracts of the 28th European Workshop on Computational Geometry (EuroCG12), pages 213-216, 2012.

10
J. Cardinal, N. Cohen, S. Collette, M. Hoffmann, S. Langerman and G. Rote.
Coloring dynamic point sets on a line.
In Abstracts of the 28th European Workshop on Computational Geometry (EuroCG12), pages 209-212, 2012.

11
P. Bose, V. Dujmovic, F. Hurtado, J. Iacono, S. Langerman, H. Meijer, V. Sacristán, M. Saumell and D.R. Wood.
Proximity graphs: E , δ , Δ , χ and ω .
In Abstracts of the 28th European Workshop on Computational Geometry (EuroCG12), pages 217-220, 2012.

12
M. Korman and S. Langerman.
On recognizing circle-freeness.
In Abstracts of the Japan Conference on Discrete and Computational Geometry (JCDCG11), pages 46-47, 2011.

13
S. Langerman and Y. Okamoto.
Planar convex hulls against lies.
In Abstracts of the 4th Annual Meeting of the AAAC (AAAC11), 2011.

14
J. Cardinal, H. Ito, M. Korman, and S. Langerman.
Helly numbers of polyominoes.
In Proceedings of the 23rd Canadian Conference on Computational Geometry (CCCG 2011), pages 443-448, 2011.

15
J. Cardinal, S. Collette, H. Ito, M. Korman, S. Langerman, H. Sakaidani and P. Taslakian.
Cannibal animal games: a new variant of tic-tac-toe.
In Proceedings of the 27th European Workshop on Computational Geometry (EuroCG11), pages 131-134, 2011.

16
Y. Higashikawa, N. Katoh, S. Langerman and S. Tanigawa.
Online graph exploration algorithms for cycles and trees by multiple searchers.
In Abstracts of the China-Japan Joint Conference on Computational Geometry, Graphs and Applications (CGGA 2010), pages 54-55, 2010.

17
G. Aloupis, P. Bose, S. Collette, E.D. Demaine, M.L. Demaine, K. Douïeb, V. Dujmovic, J. Iacono, S. Langerman and P. Morin.
Common unfoldings of polyominoes and polycubes.
In Abstracts of the China-Japan Joint Conference on Computational Geometry, Graphs and Applications (CGGA 2010), pages 17-18, 2010.

18
P. Bose, S. Collette, F. Hurtado, M. Korman, S. Langerman, V. Sacristán, and M. Saumell.
Some properties of higher order delaunay and gabriel graphs.
In Proceedings of the 22nd Canadian Conference on Computational Geometry (CCCG 2010), pages 13-16, 2010.

19
Y. Higashikawa, N. Katoh, S. Langerman and S. Tanigawa.
Online graph exploration algorithms for cycles and trees by multiple searchers.
In Abstracts of the 3rd Annual Meeting of the Asian Association for Algorithms and Computation (AAAC 2010), 2010.

20
J. Cardinal, E.D. Demaine, M.L. Demaine, S. Imahori, S. Langerman and R. Uehara.
Algorithmic folding complexity.
In Abstracts from the 7th Japan Conference on Computational Geometry and Graphs (JCCGG 2009), 2009.

21
G. Aloupis, J. Cardinal, S. Collette, E.D. Demaine, M.L. Demaine, M. Dulieu, R. Fabila-Monroy, V. Hart, F. Hurtado, M. Saumell, C. Seara and P. Taslakian.
Matching points with things.
In Abstracts from the 7th Japan Conference on Computational Geometry and Graphs (JCCGG 2009), pages 7-8, 2009.

22
G. Aloupis, J. Cardinal, S. Collette, S. Imahori, M. Korman, S. Langerman, O. Schwartz, S. Smorodinsky and P. Taslakian.
Colorful strips.
In Abstracts from the 7th Japan Conference on Computational Geometry and Graphs (JCCGG 2009), 2009.

23
E.D. Demaine, M.L. Demaine, V. Hart, J. Iacono, S. Langerman and J. O'Rourke.
Continuous blooming of convex polyhedra.
In Abstracts from the 7th Japan Conference on Computational Geometry and Graphs (JCCGG 2009), pages 123-124, 2009.

24
Z. Abel, B. Ballinger, P. Bose, S. Collette, V. Dujmovic, F. Hurtado, S.D.Kominers, S. Langerman, A. Pór and D.R. Wood.
Every large point set contains many collinear points or an empty pentagon.
In Proceedings of the 21st Canadian Conference on Computational Geometry (CCCG 2009), pages 99-102, 2009.

25
E.D. Demaine, M.L. Demaine, S. Langerman and J. Vervier.
Locked thick chains.
In Abstracts from the 25th European Workshop on Computational Geometry (EuroCG 2009), pages 65-68, 2009.

26
P. Bose, S. Langerman and S. Roy.
Smallest enclosing circle centered on a query line segment.
In Proceedings of the 20th Canadian Conference on Computational Geometry (CCCG 2008), pages 167-170, 2008.

27
G. Aloupis, J. Cardinal, S. Collette, F. Hurtado, S. Langerman and J. O'Rourke.
Draining a polygon -or- rolling a ball out of a polygon.
In Proceedings of the 20th Canadian Conference on Computational Geometry (CCCG 2008), pages 79-82, 2008.

28
G. Aloupis, P. Bose, V. Dujmovic, C. Gray, S. Langerman and B. Speckmann.
Triangulating and guarding realistic polygons.
In Proceedings of the 20th Canadian Conference on Computational Geometry (CCCG 2008), pages 107-110, 2008.

29
G. Aloupis, J. Cardinal, S. Collette, S. Langerman and S. Smorodinsky.
Coloring geometric range spaces.
In Abstracts from the 24th European Workshop on Computational Geometry (EuroCG 2008), pages 111-114, 2008.

30
G. Aloupis, B. Ballinger, P. Bose, M. Damian, E.D. Demaine, M.L. Demaine, R. Flatland, F. Hurtado, S. Langerman, J. O'Rourke, P. Taslakian and G.T. Toussaint.
Vertex pops and popturns.
In Proceedings of the 19th Canadian Conference on Computational Geometry (CCCG 2007), pages 137-140, 2007.

31
G. Aloupis, S. Collette, M. Damian, E.D. Demaine, R. Flatland, S. Langerman, J. O'Rourke, S. Ramaswami, V. Sacristán and S. Wuhrer.
Linear reconfiguration of cube-style modular robots.
In Abstracts from the XII Encuentros de Geometría Computacional (EGC 2007), pages 19-34, 2007.

32
J. Cardinal, S. Collette, F. Hurtado, S. Langerman and B. Palop.
Moving walkways, escalators, and elevators.
In Proceedings of the Kyoto International Conference on Computational Geometry and Graph Theory (KyotoCGGT2007), 2007.

33
E.D. Demaine, M.L. Demaine, J. Iacono and S. Langerman.
Wrapping the mozartkugel.
In Abstracts from the 23rd European Workshop on Computational Geometry (EuroCG 2007), pages 14-17, 2007.

34
M. Damian, E.D. Demaine, M.L. Demaine, V. Dujmovic, D. El-Khechen, R. Flatland, J. Iacono, S. Langerman, H. Meijer, S. Ramaswami, D. Souvaine, P. Taslakian and G.T. Toussaint.
Curves in the sand: Algorithmic drawing.
In Proceedings of the 18th Canadian Conference on Computational Geometry (CCCG 2006), pages 11-14, Kingston, Ontario, Canada, 2006.

35
J. Cardinal and S. Langerman.
Min-max-min geometric facility location problems.
In 22nd European Workshop on Computational Geometry (EuroCG 2006), pages 149-152, 2006.

36
G. Aloupis, J. Cardinal, S. Collette, J. Iacono and S. Langerman.
Where to build a temple, and where to dig to find one.
In 22nd European Workshop on Computational Geometry (EuroCG 2006), pages 1-4, 2006.

37
J. Cardinal, M. Labbé, S. Langerman and B. Palop.
Pricing of geometric transportation networks.
In Proceedings of the 17th Canadian Conference on Computational Geometry (CCCG 2005), pages 92-96, Windsor, Ontario, Canada, August 10-12 2005.

38
T. Abbott, E.D. Demaine, M.L. Demaine, D. Kane, S. Langerman, J. Nelson, and V. Yeung.
Dynamic ham-sandwich cuts of convex polygons in the plane.
In Proceedings of the 17th Canadian Conference on Computational Geometry (CCCG 2005), pages 61-64, Windsor, Ontario, Canada, August 10-12 2005.

39
S. Cabello, J.M. Díaz-Báñez, S. Langerman, C. Seara, and I. Ventura.
Reverse facility location problems.
In Proceedings of the 17th Canadian Conference on Computational Geometry (CCCG 2005), pages 68-71, Windsor, Ontario, Canada, August 10-12 2005.

40
B. Aronov, F. Aurenhammer, F. Hurtado, S. Langerman, D. Rappaport, C. Seara and S. Smorodinsky.
Small weak epsilon nets.
In Proceedings of the 17th Canadian Conference on Computational Geometry (CCCG 2005), pages 52-56, Windsor, Ontario, Canada, August 10-12 2005.

41
J. Cardinal, S. Collette, and S. Langerman.
Region counting circles.
In Proceedings of the 17th Canadian Conference on Computational Geometry (CCCG 2005), pages 278-281, Windsor, Ontario, Canada, August 10-12 2005.

42
J. Cardinal, S. Collette and S. Langerman.
Region counting graphs.
In 21st European Workshop on Computational Geometry (EuroCG 2005), 2005.

43
J. Glass, S. Langerman, J. O'Rourke, J. Snoeyink and J.K. Zhong.
A 2-chain can interlock with a k-chain.
In 14th Annual Fall Workshop on Computational Geometry, pages 18-19, 2004.

44
G. Aloupis, E.D. Demaine, S. Langerman, P. Morin, J. O'Rourke, I. Streinu, and G.T. Toussaint.
Unfolding polyhedral bands.
In Proceedings of the 16th Canadian Conference on Computational Geometry (CCCG 2004), pages 60-63, 2004.

45
J. Cardinal, S. Collette, and S. Langerman.
Local properties of geometric graphs.
In Proceedings of the 16th Canadian Conference on Computational Geometry (CCCG 2004), pages 145-148, 2004.

46
G. Aloupis, T. Fevens, S. Langerman, T. Matsui, A. Mesa, Y. Nuñez, D. Rappaport and G.T. Toussaint.
Computing a geometric measure of the similarity between two melodies.
In Proceedings of the 15th Canadian Conference on Computational Geometry (CCCG 2003), pages 81-84, 2003.

47
E.D. Demaine, J. Erickson and S. Langerman.
On the complexity of halfspace volume queries.
In Proceedings of the 15th Canadian Conference on Computational Geometry (CCCG 2003), pages 159-160, 2003.

48
P. Bose, E.D. Demaine, J. Iacono and S. Langerman.
Quartering a square optimally.
In Proceedings of the Japan Conference on Discrete and Computational Geometry (JCDCG 2002), pages 5-6, 2002.

49
M. Golin, S. Langerman and W. Steiger.
The convex hull for random lines in the plane.
In Proceedings of the Japan Conference on Discrete and Computational Geometry (JCDCG 2002), pages 14-15, 2002.

50
G. Aloupis, P. Bose, E.D. Demaine, S. Langerman, H. Meijer, M. Overmars and G.T. Toussaint.
Computing signed permutations of polygons.
In Proceedings of the 14th Canadian Conference on Computational Geometry (CCCG 2002), pages 68-71, 2002.
[ps.gz].

51
E.D. Demaine, J. Iacono and S. Langerman.
Proximate point searching.
In Proceedings of the 14th Canadian Conference on Computational Geometry (CCCG 2002), pages 1-4, 2002.
[ps.gz].

52
E.D. Demaine, S. Langerman and J. O'Rourke.
Short interlocked linkages.
In Proceedings of the 13th Canadian Conference on Computational Geometry (CCCG 2001), pages 69-72, 2001.
[ps.gz].

53
G. Aloupis, S. Langerman, M. Soss and G.T. Toussaint.
Algorithms for bivariate medians and a fermat-torricelli problem for lines.
In Proceedings of the 13th Canadian Conference on Computational Geometry (CCCG 2001), pages 21-24.
2001.
[ps.gz].

54
S. Langerman and W. Steiger.
Computing a maximal depth point in the plane.
In Proceedings of the Japan Conference on Discrete and Computational Geometry (JCDCG 2000), pages 46-47, 2000.
[ps.gz].

55
S. Langerman.
On the shooter location problem: Maintaining dynamic circular-arc graphs.
In Proceedings of the 12th Canadian Conference on Computational Geometry (CCCG 2000), pages 29-36, 2000.
[ps.gz].

56
J. Iacono and S. Langerman.
Dynamic point location in fat hyperrectangles with integer coordinates.
In Proceedings of the 12th Canadian Conference on Computational Geometry (CCCG 2000), pages 181-186, 2000.
[ps.gz].

57
S. Langerman and W. Steiger.
Ham-sandwich cuts and other tasks in arrangements.
Technical report, 2001.

58
S. Langerman and P. Morin.
Covering points with lines (abstract).
In 11th Fall Workshop on Computational Geometry, 2001.

59
S. Langerman.
Algorithms and Data Structures in Computational Geometry.
PhD thesis, Rutgers University, May 2001.

60
S. Langerman.
Enclosings.
Master's thesis, Rutgers University, May 1998.



Stefan Langerman 2016-07-05