-
Notifications
You must be signed in to change notification settings - Fork 2
/
Copy pathjeffe.bib
1250 lines (1125 loc) · 49.8 KB
/
jeffe.bib
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
%% This BibTeX bibliography file was created using BibDesk.
%% http://bibdesk.sourceforge.net/
%% Created for Jeff Erickson at 2024-07-30 15:08:09 -0500
%% Saved with string encoding Unicode (UTF-8)
@string{jeffe = {Jeff Erickson}}
@article{zbddehiklu-udmc-17,
author = {Abel, Zachary and Ballinger, Brad and Demaine, Erik D. and Demaine, Martin L. and Erickson, Jeff and Hesterberg, Adam and Ito, Hiro and Kostitsyna, Irina and Lynch, Jayson and Uehara, Ryuhei},
date-added = {2024-05-21 14:14:15 -0500},
date-modified = {2024-05-21 14:15:32 -0500},
doi = {10.2197/ipsjjip.25.610},
journal = {Journal of Information Processing},
pages = {610--615},
title = {Unfolding and dissection of multiple cubes},
volume = {25},
year = {2017},
bdsk-url-1 = {https://doi.org/10.2197/ipsjjip.25.610}}
@inproceedings{bcegkmv-rgct-23,
abstract = {We introduce a new model of indeterminacy in graphs: instead of specifying all the edges of the graph, the input contains all triples of vertices that form a connected subgraph. In general, different (labelled) graphs may have the same set of connected triples, making unique reconstruction of the original graph from the triples impossible. We identify some families of graphs (including triangle-free graphs) for which all graphs have a different set of connected triples. We also give algorithms that reconstruct a graph from a set of triples, and for testing if this reconstruction is unique. Finally, we study a possible extension of the model in which the subsets of size k that induce a connected graph are given for larger (fixed) values of k.},
arxiv = {2303.06609},
author = {Bastide, Paul and Cook, Linda and Erickson, Jeff and Groenland, Carla and Kreveld, Marc van and Mannens, Isja and Vermeulen, Jordi L.},
booktitle = {Proc. 49th Int. Workshop Graph-Theoretic Concepts Comput. Sci.},
date-added = {2024-05-19 11:22:51 -0500},
date-modified = {2024-05-19 11:26:54 -0500},
doi = {10.1007/978-3-031-43380-1_2},
number = {14093},
pages = {16--29},
publisher = {Springer},
series = {Lecture Notes Comput. Sci.},
title = {Reconstructing Graphs from Connected Triples},
year = {2023},
bdsk-url-1 = {https://doi.org/10.1007/978-3-031-43380-1_2}}
@inproceedings{cce-lbers-19,
annote = {Keywords: electrical transformation, Delta-Y-transformation, homotopy, tight, defect, SPQR-tree, smoothings, routing set, 2-flipping},
arxiv = {1707.04683},
author = {Chang, Hsien-Chih and Cossarini, Marcos and Erickson, Jeff},
booktitle = {Proc. 35th Int. Symp. Comput. Geom.},
date-added = {2024-05-19 11:08:02 -0500},
date-modified = {2024-05-19 11:15:55 -0500},
doi = {10.4230/LIPIcs.SoCG.2019.25},
pages = {25:1--25:16},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum f{\"u}r Informatik},
series = {Leibniz Int. Proc. Informatics},
title = {{Lower Bounds for Electrical Reduction on Surfaces}},
volume = {129},
year = {2019},
bdsk-url-1 = {https://doi.org/10.4230/LIPIcs.SoCG.2019.25}}
@article{aeklm-cpmbr-22,
arxiv = {2103.09811},
author = {Abrahamsen, Mikkel and Erickson, Jeff and Kostitsyna, Irina and L{\"{o}}ffler, Maarten and Miltzow, Tillmann and Urhausen, J{\'{e}}r{\^{o}}me and Vermeulen, Jordi L. and Viglietta, Giovanni},
date-added = {2024-05-19 11:04:00 -0500},
date-modified = {2024-05-19 11:05:39 -0500},
doi = {10.20382/jocg.v13i2a7},
journal = {J. Comput. Geom.},
number = {2},
pages = {115--150},
title = {Chasing Puppies: {Mobile} Beacon Routing on Closed Curves},
volume = {13},
year = {2022},
bdsk-url-1 = {https://doi.org/10.20382/jocg.v13i2a7}}
@article{el-ptmme-24,
arxiv = {2106.14086},
author = {Erickson, Jeff and Lin, Patrick},
date-added = {2024-05-19 10:54:08 -0500},
date-modified = {2024-05-19 10:54:48 -0500},
doi = {10.7155/jgaa.00616},
journal = {Journal of Graph Algorithms and Applications},
number = {2},
pages = {95--118},
title = {Planar and Toroidal Morphs Made Easier},
volume = {27},
year = {2024},
bdsk-url-1 = {https://doi.org/10.7155/jgaa.00616}}
@article{cefn-mcsg-23,
author = {Chambers, Erin W. and Erickson, Jeff and Fox, Kyle and Nayyeri, Amir},
date-added = {2024-05-19 10:51:10 -0500},
date-modified = {2024-05-19 10:51:35 -0500},
doi = {10.1137/19M1291820},
journal = {{SIAM} J. Comput.},
number = {1},
pages = {156--195},
title = {Minimum Cuts in Surface Graphs},
volume = {52},
year = {2023},
bdsk-url-1 = {https://doi.org/10.1137/19M1291820}}
@article{enx-fnpa-22,
arxiv = {2003.14342v9},
author = {Erickson, Jeff and Nivasch, Gabriel and Xu, Junyan},
date-added = {2024-05-19 10:44:42 -0500},
date-modified = {2024-05-19 10:48:37 -0500},
doi = {10.46298/lmcs-18(3:6)2022},
journal = {Logical Methods Comput. Sci.},
number = {3},
title = {Fusible numbers and {Peano} Arithmetic},
volume = {18},
year = {2022},
bdsk-url-1 = {https://doi.org/10.46298/lmcs-18(3:6)2022}}
@article{ehm-sgb-22,
abstract = { We study algorithmic problems that belong to the complexity class of the existential theory of the reals (\$\exists \mathbb{R}\$). A problem is \ensuremath\exists \mathbbR-complete if it is as hard as the problem existential theory of the reals (ETR) and if it can be written as an ETR formula. Traditionally, these problems are studied in the real random access machine (RAM), a model of computation that assumes that the storage and comparison of real-valued numbers can be done in constant space and time, with infinite precision. The complexity class \$\exists \mathbb{R}\$ is often called a real RAM analogue of NP, since the problem ETR can be viewed as the real-valued variant of SAT. The real RAM assumption that we can represent and in which we can compare arbitrary irrational values in constant space and time is not very realistic. Yet this assumption is vital, since some \$\exists \mathbb{R}\$-complete problems have an ``exponential bit phenomenon,'' where there exists an input for the problem, such that the witness of the solution requires geometric coordinates which need exponential word size when represented in binary. The problems that exhibit this phenomenon are NP-hard (since ETR is NP-hard) but it is unknown if they lie in NP. NP membership is often showed by using the famous Cook--Levin theorem, which states that the existence of a polynomial-time verification algorithm for the problem witness is equivalent to NP membership. The exponential bit phenomenon prohibits a straightforward application of the Cook--Levin theorem. In this paper we first present a result which we believe to be of independent interest: we prove a real RAM analogue to the Cook--Levin theorem which shows that \$\exists \mathbb{R}\$ membership is equivalent to having a verification algorithm that runs in polynomial-time on a real RAM. This gives an easy proof of \ensuremath\exists \mathbbR-membership, as verification algorithms on a real RAM are much more versatile than ETR formulas. We use this result to construct a framework to study \$\exists \mathbb{R}\$-complete problems under smoothed analysis. We show that for a wide class of \$\exists \mathbb{R}\$-complete problems, its witness can be represented with logarithmic input-precision by using smoothed analysis on its real RAM verification algorithm. This shows in a formal way that the boundary between NP and \$\exists \mathbb{R}\$ (formed by inputs whose solution witness needs high input-precision) consists of contrived input. We apply our framework to well-studied \$\exists \mathbb{R}\$-complete recognition problems which have the exponential bit phenomenon such as the recognition of realizable order types or the Steinitz problem in fixed dimension. Interestingly our techniques also generalize to problems with a natural notion of resource augmentation (geometric packing, the art gallery problem). },
arxiv = {1912.02278},
author = {Erickson, Jeff and van der Hoog, Ivor and Miltzow, Tillmann},
date-added = {2024-05-19 10:37:50 -0500},
date-modified = {2024-05-19 11:06:10 -0500},
doi = {10.1137/20M1385287},
journal = {{SIAM} J. Comput.},
pages = {FOCS20-102-FOCS20-138},
title = {Smoothing the Gap Between {NP} and {$\exists\mathbb{R}$}},
year = {2022},
bdsk-url-1 = {https://doi.org/10.1137/20M1385287}}
@article{el-tmc-22,
arxiv = {2003.10057},
author = {Erickson, Jeff and Lin, Patrick},
date-added = {2024-05-19 10:35:05 -0500},
date-modified = {2024-05-19 10:37:05 -0500},
doi = {10.20382/jocg.v12i2a4},
journal = {J. Comput. Geom.},
number = {2},
pages = {55--85},
title = {A Toroidal {Maxwell}--{Cremona}--{Delaunay} Correspondence},
volume = {12},
year = {2022},
bdsk-url-1 = {https://doi.org/10.20382/jocg.v12i2a4}}
@article{ew-ttcwd-20,
arxiv = {1812.01564},
author = {Erickson, Jeff and Wang, Yipu},
date-added = {2024-05-19 10:33:09 -0500},
date-modified = {2024-05-19 10:34:25 -0500},
doi = {10.1007/s00454-020-00255-3},
journal = {Discrete Comput. Geom.},
number = {4},
pages = {1253--1294},
title = {Topologically trivial closed walks in directed surface graphs},
volume = {64},
year = {2020},
bdsk-url-1 = {https://doi.org/10.1007/s00454-020-00255-3}}
@article{aaet-rwsp-17,
abstract = {We present an {\$}{\$}O(n{\backslash}log n){\$}{\$}O(nlogn)-time algorithm that determines whether a given n-gon in the plane is weakly simple. This improves upon an {\$}{\$}O(n^2{\backslash}log n){\$}{\$}O(n2logn)-time algorithm by Chang et al. (Proceedings of the 26th ACM-SIAM symposium on discrete algorithm, SIAM, 2015). Weakly simple polygons are required as input for several geometric algorithms. As such, recognizing simple or weakly simple polygons is a fundamental problem.},
author = {Akitaya, Hugo A. and Aloupis, Greg and Erickson, Jeff and T{\'o}th, Csaba D.},
date-added = {2024-05-15 18:39:49 -0500},
date-modified = {2024-05-15 18:39:49 -0500},
journal = {Discrete Comput. Geom.},
number = {4},
pages = {785--821},
title = {Recognizing Weakly Simple Polygons},
volume = {58},
year = {2017},
bdsk-url-1 = {https://doi.org/10.1007/s00454-017-9918-3}}
@article{ce-upc-17,
abstract = {Any generic closed curve in the plane can be transformed into a simple closed curve by a finite sequence of local transformations called homotopy moves. We prove that simplifying a planar closed curve with n self-crossings requires {\$}{\$}{$\backslash$}Theta (n\^{}{\{}3/2{\}}){\$}{\$}homotopy moves in the worst case. Our algorithm improves the best previous upper bound {\$}{\$}O(n\^{}2){\$}{\$}, which is already implicit in the classical work of Steinitz; the matching lower bound follows from the construction of closed curves with large defect, a topological invariant of generic closed curves introduced by Aicardi and Arnold. Our lower bound also implies that {\$}{\$}{$\backslash$}Omega (n\^{}{\{}3/2{\}}){\$}{\$}facial electrical transformations are required to reduce any plane graph with treewidth {\$}{\$}{$\backslash$}Omega ({$\backslash$}sqrt{\{}n{\}}){\$}{\$}to a single vertex, matching known upper bounds for rectangular and cylindrical grid graphs. More generally, we prove that transforming one immersion of k circles with at most n self-crossings into another requires {\$}{\$}{$\backslash$}Theta (n\^{}{\{}3/2{\}} + nk + k\^{}2){\$}{\$}homotopy moves in the worst case. Finally, we prove that transforming one non-contractible closed curve to another on any orientable surface requires {\$}{\$}{$\backslash$}Omega (n\^{}2){\$}{\$}homotopy moves in the worst case; this lower bound is tight if the curve is homotopic to a simple closed curve.},
author = {Chang, Hsien-Chih and Erickson, Jeff},
date-added = {2024-05-15 18:39:49 -0500},
date-modified = {2024-05-15 18:39:49 -0500},
doi = {10.1007/s00454-017-9907-6},
journal = {Discrete Comput. Geom.},
number = {4},
pages = {889--920},
title = {Untangling Planar Curves},
volume = {58},
year = {2017},
bdsk-url-1 = {https://doi.org/10.1007/s00454-017-9907-6}}
@inproceedings{el-tmcdc-20,
arxiv = {2003.10057},
author = {Erickson, Jeff and Lin, Patrick},
booktitle = {Proc. 36th Int. Symp. Comput. Geom.},
date-added = {2024-05-15 18:39:49 -0500},
date-modified = {2024-05-15 18:39:49 -0500},
doi = {10.4230/LIPIcs.SoCG.2020.40},
number = {164},
pages = {40:1--40:17},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum f{\"u}r Informatik},
series = {Leibniz Int. Proc. Informatics},
title = {A toroidal {Maxwell}-{Cremona}-{Delaunay} correspondence},
year = {2020},
bdsk-url-1 = {https://doi.org/10.4230/LIPIcs.SoCG.2020.40}}
@inproceedings{celp-hmgt-21,
arxiv = {2007.07927},
author = {Chambers, Erin Wolf and Erickson, Jeff and Lin, Patrick and Parsa, Salman},
booktitle = {Proc. 32nd Ann. ACM-SIAM Symp. Discrete Algorithms},
date-added = {2024-05-15 18:39:49 -0500},
date-modified = {2024-05-15 18:39:49 -0500},
doi = {10.1137/1.9781611976465.164},
pages = {2759--2778},
title = {How to Morph Graphs on the Torus},
year = {2021},
bdsk-url-1 = {https://doi.org/10.1137/1.9781611976465.164}}
@inproceedings{el-ptmme-21,
arxiv = {2106.14086v2},
author = {Erickson, Jeff and Lin, Patrick},
booktitle = {Proc. 29th Int. Symp. Graph Drawing Network Vis.},
date-added = {2024-05-15 18:39:49 -0500},
date-modified = {2024-05-15 18:39:49 -0500},
doi = {10.1007/978-3-030-92931-2_9},
number = {12868},
pages = {123--137},
series = {Lecture Notes Comput. Sci.},
title = {Planar and Toroidal Morphs Made Easier},
year = {2021},
bdsk-url-1 = {https://doi.org/10.1007/978-3-030-92931-2_9}}
@inproceedings{rre-btwaf-24,
author = {Robson, Eliot Wong and Ruggerio, Samuel and Erickson., Jeff},
booktitle = {Proceedings of the 29th Annual ACM Conference on Innovation and Technology in Computer Science Education},
date-added = {2024-05-15 16:37:26 -0500},
date-modified = {2024-05-15 16:38:57 -0500},
pages = {to appear},
title = {{FSM} {Builder}: {A} tool for writing autograded finite automata questions},
year = {2024}}
@inproceedings{pl4tcs,
author = {Erickson, Jeff and Xia, Jason and Robson, Eliot Wong and Do, Tue and Glickman, Aidan Tzur and Jia, Zhuofan and Jin, Eric and Lee, Jiwon and Lin, Patrick and Pan, Steven and Ruggerio, Samuel and Sakurayama, Tomoko and Yin, Andrew and Gertner, Yael and Solomon, Brad},
booktitle = {Proc. 2023 ASEE Annual Conference \& Exposition},
date-added = {2024-04-11 14:46:58 -0500},
date-modified = {2024-04-11 14:49:16 -0500},
doi = {10.18260/1-2--42347},
month = {June},
title = {Auto-graded Scaffolding Exercises For Theoretical Computer Science},
url = {https://peer.asee.org/42347},
year = {2023},
bdsk-url-1 = {https://doi.org/10.18260/1-2--42347}}
@book{e-a-19,
author = {Erickson, Jeff},
date-added = {2019-07-02 16:26:06 -0500},
date-modified = {2019-07-02 16:26:22 -0500},
edition = {1st},
isbn = {978-1-792-64483-2},
keywords = {textbook},
title = {Algorithms},
url = {http://algorithms.wtf},
year = {2019},
bdsk-url-1 = {http://algorithms.wtf}}
@inproceedings{ccwx,
arxiv = {1812.01564v2},
author = {Erickson, Jeff and Wang, Yipu},
booktitle = {Proc. 33rd Int. Symp. Comput. Geom.},
date-added = {2019-03-13 14:09:53 +0100},
date-modified = {2024-05-15 18:40:49 -0500},
pages = {34:1--34:17},
series = {Leibniz International Proceedings in Informatics},
title = {Topologically Trivial Closed Walks in Directed Surface Graphs},
volume = {129},
year = {2019}}
@inproceedings{holiest,
arxiv = {1804.01045},
author = {Erickson, Jeff and Fox, Kyle and Lkhamsuren, Luvsandondov},
booktitle = {Proc. 50th Ann. ACM Symp. Theory Comput.},
date-added = {2018-07-04 16:47:59 +0000},
date-modified = {2018-07-04 16:50:00 +0000},
doi = {10.1145/3188745.3188904},
pages = {1319--1332},
read = {1},
title = {Holiest minimum-cost paths and flows in surface graphs},
year = {2018},
bdsk-url-1 = {https://doi.org/10.1145/3188745.3188904}}
@inproceedings{celmsstt-tcslm-17,
author = {Chang, Hsien-Chih and Erickson, Jeff and Letscher, David and de Mesmay, Arnaud and Schleimer, Saul and Sedgwick, Eric and Thurston, Dylan and Tillmann, Stephan},
booktitle = {Proc. 29th Ann. ACM-SIAM Symp. Discrete Algorithms},
date-modified = {2024-05-19 11:19:49 -0500},
doi = {10.1137/1.9781611975031.8},
pages = {121--135},
title = {Tightening Curves on Surfaces via Local Moves},
year = {2017},
bdsk-url-1 = {https://doi.org/10.1137/1.9781611975031.8}}
@inproceedings{repcube,
author = {Abel, Zachary and Ballinger, Brad and Demaine, Erik D. and Demaine, Martin L. and Erickson, Jeff and Hesterberg, Adam and Ito, Hiro and Kostitsyna, Irina and Lynch, Jayson and Uehara, Ryuhei},
booktitle = {Abstracts 19th Japan Conf. Discrete Comput. Geom., Graphs, Games},
date-added = {2017-01-02 23:39:22 +0000},
date-modified = {2017-01-02 23:40:58 +0000},
note = {Journal version in submission},
pages = {42--43},
title = {Unfolding and dissection of multiple cubes},
year = {2016}}
@inproceedings{fastweak,
author = {Akitaya, Hugo and Aloupis, Greg and Erickson, Jeff and T{\'o}th, Csaba},
booktitle = {Proc. 32nd Int. Symp. Comput. Geom.},
date-added = {2017-01-02 23:37:08 +0000},
date-modified = {2017-01-02 23:41:12 +0000},
note = {Journal version in submission},
pages = {8:1--8:16},
title = {Recognizing weakly simple polygons},
year = {2016}}
@inproceedings{weak,
author = {Chang, Hsien-Chih and Erickson, Jeff and Xu, Chao},
booktitle = {Proc. 26th ACM-SIAM Symp. Discrete Algorithms},
date-added = {2017-01-02 23:35:38 +0000},
date-modified = {2019-03-22 13:13:28 +0100},
doi = {10.1137/1.9781611973730.110},
pages = {1655--1670},
title = {Detecting weakly simple polygons},
year = {2015},
bdsk-url-1 = {https://doi.org/10.1137/1.9781611973730.110}}
@inproceedings{tangle,
author = {Chang, Hsien-Chih and Erickson, Jeff},
booktitle = {Proc. 32nd Int. Symp. Comput. Geom.},
date-modified = {2017-01-02 23:41:38 +0000},
pages = {29:1--29:15},
series = {Leibniz International Proceedings in Informatics},
title = {Untangling Planar Curves},
url = {http://drops.dagstuhl.de/opus/volltexte/2016/5921},
volume = {51},
year = {2016},
bdsk-url-1 = {http://jeffe.cs.illinois.edu/pubs/pdf/tangle.pdf}}
@misc{defect,
arxiv = {1510.00571},
author = {Chang, Hsien-Chih and Erickson, Jeff},
date-added = {2015-11-27 23:40:42 +0000},
date-modified = {2015-11-27 23:43:23 +0000},
howpublished = {Preprint},
month = {October},
title = {Electrical reduction, homotopy moves, and defect},
year = {2015}}
@misc{comptop-notes,
author = {Erickson, Jeff},
date-added = {2013-11-08 19:32:30 +0000},
date-modified = {2013-11-08 19:35:07 +0000},
note = {Annotated bibliography and lecture notes},
title = {{CS} 598: {Computational} {Topology}},
url = {http://www.cs.uiuc.edu/~jeffe/teaching/comptop/2009/schedule.html},
year = {2009},
bdsk-url-1 = {http://www.cs.uiuc.edu/~jeffe/teaching/comptop/2009/schedule.html}}
@phdthesis{kyle-thesis,
author = {Fox, Kyle Jordan},
date-added = {2013-10-28 22:40:04 +0000},
date-modified = {2013-10-28 22:41:41 +0000},
month = {December},
school = {University of Illinois, Urbana-Champaign},
title = {Fast Algorithms for Surface Embedded Graphs via Homology},
year = {2013}}
@book{l-pa-06,
author = {LaValle, Steven M.},
date-added = {2013-05-06 15:39:01 +0000},
date-modified = {2013-05-06 15:39:47 +0000},
publisher = {Cambridge Univ. Press},
title = {Planning Algorithms},
year = {2006}}
@article{abg-cpgud-09,
author = {Alexander, Stephanie B. and Bishop, Richard and Ghrist, Robert},
date-added = {2013-05-06 15:31:11 +0000},
date-modified = {2013-05-06 15:33:19 +0000},
journal = {Ensiegn. Math.},
pages = {103--125},
title = {Capture Pursuit games on unbounded domains},
volume = {55},
year = {2009}}
@article{abg-tcspd-10,
author = {Alexander, Stephanie B. and Bishop, Richard and Ghrist, Robert},
date-added = {2013-05-06 15:27:44 +0000},
date-modified = {2013-05-06 15:28:59 +0000},
journal = {Geom. Dedicata},
pages = {275--290},
title = {Total curvature and simple pursuit on domains of curvature bounded from above},
volume = {149},
year = {2010}}
@inproceedings{cc-msspg-07,
author = {Cabello, Sergio and Chambers, Erin W.},
booktitle = {Proc. 18th Ann. ACM-SIAM Symp. Discrete Algorithms},
date-added = {2013-05-06 15:14:59 +0000},
date-modified = {2013-05-06 15:15:03 +0000},
keywords = {graphs},
pages = {89--97},
read = {1},
title = {Multiple source shortest paths in a genus $g$ graph},
year = {2007}}
@inproceedings{clbm-mwpdmr-06,
author = {Chitsaz, Hamid and LaValle, Steven M. and Balkcom, Devin J. and Mason, Matthew T.},
booktitle = {Proc. IEEE Int. Conf. Robotics and Automation},
date-added = {2013-05-06 15:04:47 +0000},
date-modified = {2013-05-06 15:39:23 +0000},
title = {Minimum wheel-rotation paths for differential-drive mobile robots},
year = {2006}}
@inproceedings{clbm-ecmwr-06,
author = {Chitsaz, Hamid and LaValle, Steven M. and Balkcom, Devin J. and Mason, Matthew T.},
booktitle = {Proc. 12th IEEE Int. Conf. Methods and Models in Automation and Robotics},
date-added = {2013-05-06 15:03:37 +0000},
date-modified = {2013-05-06 15:39:18 +0000},
title = {An explicit characterizaton of minimum wheel-rotation paths for differential drives},
year = {2006}}
@phdthesis{c-gpmr-08,
author = {Chitsaz, Hamid Reza},
date-added = {2013-05-06 15:02:40 +0000},
date-modified = {2013-05-06 15:03:18 +0000},
school = {University of Illinois, Urbana-Champaign},
title = {Geodesic problems for mobile robots},
year = {2008}}
@inproceedings{cl-mwpdd-07,
author = {Chitsaz, Hamid and LaValle, Steven M.},
booktitle = {Proc. IEEE Int. Conf. Robotics and Automation},
date-added = {2013-05-06 15:01:04 +0000},
date-modified = {2013-05-06 15:39:27 +0000},
title = {Minimum wheel-rotation paths for differential drive mobile robots among piecewise smooth obstacles},
year = {2007}}
@inproceedings{cl-tpda-07,
author = {Chitsaz, Hamid and LaValle, Steven M.},
booktitle = {Proc. IEEE Conf. Decision and Control},
date-added = {2013-05-06 15:00:23 +0000},
date-modified = {2013-05-06 15:39:32 +0000},
pages = {2379--2384},
title = {Time-optimal paths for a {Dubins} airplane},
year = {2007}}
@phdthesis{n-coec-12,
author = {Nayyeri, Amir},
date-added = {2013-05-06 14:58:59 +0000},
date-modified = {2013-05-06 14:59:22 +0000},
school = {University of Illinois, Urbana-Champaign},
title = {Combinatorial Optimization on Embedded Curves},
year = {2012}}
@phdthesis{c-citf-08,
author = {Chambers, Erin Wolf},
date-added = {2013-05-06 14:56:28 +0000},
date-modified = {2013-05-06 14:58:30 +0000},
school = {University of Illinois, Urbana-Champaign},
title = {Computing Interesting Topological Features},
year = {2008}}
@inproceedings{dehn,
author = {Erickson, Jeff and Whittlesey, Kim},
booktitle = {Proc. 24th Ann. ACM-SIAM Symp. Discrete Algorithms},
date-added = {2013-05-05 21:00:12 +0000},
date-modified = {2013-05-05 21:00:46 +0000},
pages = {1646--1655},
title = {Transforming Curves on Surfaces redux},
year = {2013}}
@incollection{optcycles,
author = {Erickson, Jeff},
booktitle = {Advances in Applied and Computational Topology},
comments = {Invited survey for an AMS Short Course on Computational Topology at the 2011 Joint Mathematics Meetings},
date-added = {2013-05-05 20:54:08 +0000},
date-modified = {2024-07-30 15:08:09 -0500},
editor = {Zomorodian, Afra},
number = {70},
pages = {195--228},
publisher = {American Mathematical Society},
series = {Proc. Symp. Appl. Math.},
title = {Combinatorial optimization of cycles and bases},
year = {2012}}
@inproceedings{hnss-wymwm-12,
author = {Har-Peled, Sariel and Nayyeri, Amir and Salvatipour, Mohammad R. and Sidiropoulos, Anastasios},
booktitle = {Proc. 28th Ann. Symp. Comput. Geom.},
date-added = {2013-05-05 20:24:04 +0000},
date-modified = {2013-05-05 20:25:04 +0000},
pages = {121--131},
title = {How to walk your dog in the mountains with no magic leash},
year = {2012}}
@article{tracing,
author = {Erickson, Jeff and Nayyeri, Amir},
comments = {Special issue of invited papers from SOCG 2012},
date-added = {2013-05-05 20:15:59 +0000},
date-modified = {2013-11-08 06:40:19 +0000},
journal = {Discrete Comput. Geom.},
number = {4},
pages = {823--863},
title = {Tracing Compressed Curves in Triangulated Surfaces},
volume = {49},
year = {2013},
bdsk-url-1 = {http://www.cs.uiuc.edu/~jeffe/pubs/tracing.html}}
@misc{atsp,
arxiv = {1304.1810},
author = {Erickson, Jeff and Sidiropoulos, Anastasios},
date-added = {2013-05-05 20:13:43 +0000},
date-modified = {2024-04-11 14:49:51 -0500},
howpublished = {Preprint},
title = {A near-optimal approximation algorithm for asymmetric {TSP} on embedded graphs},
url = {http://www.cs.uiuc.edu/~jeffe/atsp.html},
year = {2013},
bdsk-url-1 = {http://www.cs.uiuc.edu/~jeffe/atsp.html}}
@inproceedings{f-sncdu-13,
author = {Fox, Kyle},
booktitle = {Proc. 24th Ann. ACM-SIAM Symp. Discrete Algorithms},
date-added = {2013-05-05 20:10:17 +0000},
date-modified = {2013-05-05 20:11:27 +0000},
pages = {352--364},
title = {Shortest Non-trivial Cycles in Directed and Undirected Surface Graphs},
year = {2013}}
@inproceedings{cfn-cmcgg-13,
author = {Chambers, Erin W. and Fox, Kyle and Nayyeri, Amir},
booktitle = {Proc. 29th Ann. Symp. Comput. Geom.},
date-added = {2013-05-05 20:09:06 +0000},
date-modified = {2013-05-05 20:09:58 +0000},
pages = {to appear},
title = {Counting Minimum Cuts in Genus $g$ Graphs},
year = {2013}}
@mastersthesis{m-ausmf-11,
author = {Mont, Alexander},
date-added = {2013-05-03 21:03:29 +0000},
date-modified = {2013-05-03 21:04:12 +0000},
month = {August},
school = {University of Illinois, Urbana-Champaign},
title = {Adaptive Unstructured Spacetime Meshing for Four-Dimensional Spacetime Discontinuous {Galerkin} Finite Element Methods},
year = {2011}}
@article{e-ehmtt-14,
author = {Erickson, Jeff},
date-added = {2012-04-10 14:51:28 +0000},
date-modified = {2024-05-19 11:41:27 -0500},
doi = {10.1007/s00454-014-9624-3},
journal = {Discrete Comput. Geom.},
number = {3},
pages = {427--449},
title = {Efficiently Hex-Meshing Things with Topology},
volume = {52},
year = {2014},
bdsk-url-1 = {https://doi.org/10.1007/s00454-014-9624-3}}
@article{surflow,
author = {Chambers, Erin W. and Erickson, Jeff and Nayyeri, Amir},
comments = {Full version of \cite{surflowx}},
date-added = {2011-11-29 21:29:41 +0000},
date-modified = {2013-11-08 06:42:17 +0000},
journal = {SIAM J. Comput.},
number = {6},
pages = {1605--1634},
title = {Homology flows, cohomology cuts},
volume = {41},
year = {2012},
bdsk-url-1 = {http://www.cs.uiuc.edu/~jeffe/pubs/surflow.html}}
@inproceedings{global,
author = {Erickson, Jeff and Fox, Kyle and Nayyeri, Amir},
booktitle = {Proc. 23rd Ann. ACM-SIAM Symp. Discrete Algorithms},
date-added = {2011-08-05 12:32:26 -0500},
date-modified = {2013-05-07 15:15:16 +0000},
pages = {1309--1318},
title = {Global Minimum Cuts in Surface Embedded Graphs},
year = {2012},
bdsk-url-1 = {http://www.cs.uiuc.edu/~jeffe/pubs/global.html}}
@inproceedings{tracingx,
author = {Erickson, Jeff and Nayyeri, Amir},
booktitle = {Proc. 28th Ann. Symp. Comput. Geom.},
date-added = {2011-08-05 12:31:26 -0500},
date-modified = {2012-06-26 20:56:27 +0000},
pages = {131--140},
title = {Tracing Compressed Curves in Triangulated Surfaces},
year = {2012},
bdsk-url-1 = {http://www.cs.uiuc.edu/~jeffe/pubs/tracing.html}}
@inproceedings{noncrossing,
author = {Erickson, Jeff and Nayyeri, Amir},
booktitle = {Proc. 22nd Ann. ACM-SIAM Symp. Discrete Algorithms},
date-added = {2010-12-28 17:01:06 -0600},
date-modified = {2011-03-23 01:30:30 -0500},
pages = {297--308},
title = {Shortest noncrossing walks in the plane},
year = {2011},
bdsk-url-1 = {http://www.cs.uiuc.edu/~jeffe/repath.html}}
@inproceedings{wobble,
author = {Erickson, Jeff},
booktitle = {Proc. 27th Ann. Symp. Comput. Geom.},
date-added = {2010-12-28 15:22:52 -0600},
date-modified = {2019-03-22 13:09:19 +0100},
doi = {10.1145/1998196.1998231},
pages = {236--243},
title = {Shortest Non-trivial Cycles in Directed Surface Graphs},
year = {2011},
bdsk-url-1 = {http://www.cs.uiuc.edu/~jeffe/pubs/wobble.html}}
@inproceedings{homcover,
author = {Erickson, Jeff and Nayyeri, Amir},
booktitle = {Proc. 22nd Ann. ACM-SIAM Symp. Discrete Algorithms},
date-added = {2010-11-09 02:01:20 -0600},
date-modified = {2019-03-22 13:07:25 +0100},
doi = {10.1137/1.9781611973082.88},
pages = {1166--1176},
title = {Minimum cuts and shortest non-separating cycles via homology covers},
year = {2011},
bdsk-url-1 = {http://www.cs.uiuc.edu/~jeffe/homcover.html}}
@inproceedings{repath,
author = {Erickson, Jeff and Nayyeri, Amir},
booktitle = {Proc. 22nd Ann. ACM-SIAM Symp. Discrete Algorithms},
date-added = {2010-11-09 01:30:47 -0600},
date-modified = {2011-03-23 01:30:46 -0500},
pages = {1347--1354},
title = {Computing replacement paths in surface graphs},
year = {2011},
bdsk-url-1 = {http://www.cs.uiuc.edu/~jeffe/repath.html}}
@inproceedings{octagonsx,
author = {{Colin de Verdi{\`e}re}, {\'E}ric and Erickson, Jeff},
booktitle = {Proc. 17th Ann. ACM-SIAM Symp. Discrete Algorithms},
date-added = {2010-11-09 00:49:42 -0600},
date-modified = {2010-11-09 00:52:46 -0600},
keywords = {graphs},
pages = {192--201},
title = {Tightening non-simple paths and cycles on surfaces},
year = 2006}
@article{shadow,
author = {Chambers, Erin W. and de Silva, Vin and Erickson, Jeff and Ghrist, Robert},
date-added = {2010-05-20 16:01:14 -0500},
date-modified = {2013-05-06 15:19:34 +0000},
journal = {Discrete Comput. Geom.},
number = {1},
pages = {75--90},
title = {Vietoris--{Rips} Complexes of Planar Point Sets},
volume = {44},
year = {2010}}
@inproceedings{surfcut,
author = {Chambers, Erin W. and Erickson, Jeff and Nayyeri, Amir},
booktitle = {Proc. 25th Ann. Symp. Comput. Geom.},
date-added = {2010-05-20 15:54:38 -0500},
date-modified = {2019-03-22 13:08:35 +0100},
doi = {10.1145/1542362.1542426},
pages = {377--385},
title = {Minimum cuts and shortest homologous cycles},
year = {2009},
bdsk-url-1 = {https://doi.org/10.1145/1542362.1542426}}
@inproceedings{surflowx,
author = {Chambers, Erin W. and Erickson, Jeff and Nayyeri, Amir},
booktitle = {Proc. 42nd Ann. ACM Symp. Theory Comput.},
date-added = {2010-05-20 15:53:07 -0500},
date-modified = {2011-11-29 21:30:31 +0000},
pages = {273--282},
title = {Homology flows, cohomology cuts},
year = {2009},
bdsk-url-1 = {http://www.cs.uiuc.edu/~jeffe/pubs/surflow.html}}
@inproceedings{parshort,
author = {Erickson, Jeff},
booktitle = {Proc. 21st Ann. ACM-SIAM Symp. Discrete Algorithms},
date-added = {2010-04-25 22:32:33 -0500},
date-modified = {2010-04-25 22:34:09 -0500},
pages = {794--804},
title = {Parametric shortest paths and maximum flows in planar graphs},
year = {2010}}
@misc{notes,
author = {Erickson, Jeff},
date-added = {2008-12-12 04:49:03 -0600},
date-modified = {2018-06-27 22:05:44 +0000},
month = {January},
note = {Course materials, 1250 pages},
title = {Algorithms, Etc.},
url = {https://jeffe.cs.illinois.edu/teaching/algorithms},
year = {2015},
bdsk-url-1 = {http://www.cs.uiuc.edu/~jeffe/teaching/algorithms}}
@article{shri-adaptive,
author = {Thite, Shripad},
date-added = {2008-12-10 03:35:31 -0600},
date-modified = {2008-12-10 03:36:18 -0600},
journal = {Comput. Geom. Theory Appl.},
pages = {20--44},
title = {Adaptive Spacetime Meshing for Discontinuous {Galerkin} Methods},
volume = {42},
year = {2009}}
@article{multishort,
arxiv = {1202.0314},
author = {Cabello, Sergio and Chambers, Erin W. and Erickson, Jeff},
date-added = {2008-12-06 23:47:21 -0600},
date-modified = {2019-03-22 13:03:53 +0100},
doi = {10.1137/120864271},
journal = {SIAM J. Comput.},
number = {4},
pages = {1542--1571},
title = {Multiple-Source Shortest Paths in Embedded Graphs},
volume = {42},
year = {2013},
bdsk-url-1 = {https://doi.org/10.1137/120864271}}
@inproceedings{eellipse,
author = {Devillers, Olivier and Erickson, Jeff and Goaoc, Xavier},
booktitle = {Proc. 19th Ann. ACM-SIAM Symp. Discrete Algorithms},
date-added = {2008-12-06 23:18:00 -0600},
date-modified = {2008-12-06 23:18:00 -0600},
editor = {1249--1257},
title = {Empty-ellipse graphs},
year = {2008}}
@inproceedings{ripscon,
author = {Chambers, Erin W. and Erickson, Jeff and Worah, Pratik},
booktitle = {Proc. 24th Ann. Symp. Comput. Geom.},
date-added = {2008-12-06 23:11:47 -0600},
date-modified = {2008-12-06 23:12:30 -0600},
pages = {251--259},
title = {Testing contractibility in planar {Rips} complexes},
year = {2008}}
@article{frechet,
author = {Chambers, Erin W. and {Colin de Verdi{\`e}re}, {\'E}ric and Erickson, Jeff and Lazard, Sylvain and Lazarus, Francis and Thite, Shripad},
date-added = {2008-12-06 23:10:11 -0600},
date-modified = {2010-05-20 16:03:36 -0500},
journal = {Comput. Geom. Theory Appl.},
number = {3},
pages = {295--311},
title = {Homotopic {Fr{\'e}chet} distance between curves or, walking your dog in the woods in polynomial time},
volume = {43},
year = {2010}}
@inproceedings{necklace,
author = {Bremner, David and Chan, Timothy M. and Demaine, Erik D. and Erickson, Jeff and Hurtado, Ferran and Iacono, John and Langerman, Stefan and Streinu, Ileana and Taslakian, Perouz},
booktitle = {Proc. 14th Ann. Europ. Symp. Algorithms},
date-added = {2008-12-06 23:07:25 -0600},
date-modified = {2008-12-06 23:09:37 -0600},
number = {4168},
pages = {160--171},
publisher = {Springer-Verlag},
series = {Lecture Notes Comput. Sci.},
title = {Necklaces, convolutions, and {$X + Y$}},
year = {2006}}
@inproceedings{carrots,
author = {Alt, Helmut and Arkin, Esther M. and Br{\"o}nnimann, Herv{\'e} and Erickson, Jeff and Fekete, S{\'a}ndor P. and Knauer, Christian and Lenchner, Jonathan and Mitchell, Joseph S. B. and Whittlesey, Kim},
booktitle = {Proc. 22nd Ann. Symp. Comput. Geom.},
date-added = {2008-12-06 23:06:06 -0600},
date-modified = {2008-12-06 23:19:57 -0600},
pages = {449--458},
title = {Minimum-cost coverage of point sets by disks},
year = {2006}}
@article{wedgectr,
author = {Erickson, Jeff and Hurtado, Ferran and Morin, Pat},
date-added = {2008-12-06 23:04:17 -0600},
date-modified = {2008-12-08 17:31:36 -0600},
journal = {Discrete Math. Theor. Comput. Sci.},
title = {Centerpoint theorems for wedges},
volume = {To appear},
year = {2009}}
@article{linelast,
author = {Abedi, Reza and Haber, Robert B. and Thite, Shripad and Erickson, Jeff},
date-added = {2008-12-06 22:57:50 -0600},
date-modified = {2013-07-07 17:55:40 +0000},
journal = {Revue Europ\'eenne de M\'ecanique Num\'erique [European Journal of Computational Mechanics]},
number = {6},
pages = {619--642},
read = {1},
title = {An $h$-adaptive spacetime-discontinuous {Galerkin} method for linearized elastodynamics},
volume = {15},
year = {2006}}
@article{boundary,
author = {Bremner, David and Demaine, Erik D. and Erickson, Jeff and Iacono, John and Langerman, Stefan and Morin, Pat and Toussaint, Godfried},
date-added = {2008-12-06 22:56:34 -0600},
date-modified = {2008-12-06 22:57:28 -0600},
journal = {Discrete Comput. Geom.},
number = {4},
pages = {593--604},
title = {Output-sensitive algorithms for computing nearest-neighbor decision boundaries},
volume = {33},
year = {2005}}
@article{essential,
author = {Erickson, Jeff and Worah, Pratik},
date-added = {2008-12-06 22:53:44 -0600},
date-modified = {2011-03-23 01:26:33 -0500},
journal = {Discrete Comput. Geom.},
number = {4},
pages = {912--930},
title = {Computing the shortest essential cycle},
volume = {44},
year = {2010},
bdsk-url-1 = {http://www.cs.uiuc.edu/~jeffe/pubs/essential.html}}
@article{tight,
author = {Cabello, Sergio and DeVos, Matt and Erickson, Jeff and Mohar, Bojan},
date-added = {2008-12-06 22:53:30 -0600},
date-modified = {2019-03-22 13:04:41 +0100},
doi = {10.1145/1824777.1824781},
journal = {ACM Trans. Algorithms},
number = {4},
pages = {article 61},
title = {Finding one tight cycle},
volume = {6},
year = {2010},
bdsk-url-1 = {http://compgeom.cs.uiuc.edu/~jeffe/pubs/tight.html}}
@article{splitting,
author = {Chambers, Erin W. and {Colin de Verdi{\`e}re}, {\'E}ric and Erickson, Jeff and Lazarus, Francis and Whittlesey, Kim},
date-added = {2008-12-06 22:52:55 -0600},
date-modified = {2019-03-22 13:07:59 +0100},
doi = {10.1016/j.comgeo.2007.10.010},
journal = {Comput. Geom. Theory Appl.},
keywords = {graphs},
number = {1--2},
pages = {94--110},
title = {Splitting (complicated) surfaces is hard},
volume = {41},
year = {2008},
bdsk-url-1 = {https://doi.org/10.1016/j.comgeo.2007.10.010}}
@article{octagons,
author = {{Colin de Verdi{\`e}re}, {\'E}ric and Erickson, Jeff},
date-added = {2008-12-06 22:52:40 -0600},
date-modified = {2019-03-22 13:06:06 +0100},
doi = {10.1137/090761653},
journal = {SIAM J. Comput.},
number = {8},
pages = {3784--3813},
title = {Tightening non-simple paths and cycles on surfaces},
volume = {39},
year = {2010},
bdsk-url-1 = {https://doi.org/10.1137/090761653}}
@article{realizing,
author = {Demaine, Erik D. and Erickson, Jeff and Kri\c{z}anc, Danny and Meijer, Henk and Morin, Pat and Overmars, Mark and Whitesides, Sue},
date-added = {2008-12-06 22:50:55 -0600},
date-modified = {2008-12-08 16:57:17 -0600},
journal = {J. Discrete Algorithms},
pages = {51--58},
title = {Realizing partitions respecting full and partial order information},
volume = {6},
year = {2008}}
@phdthesis{thesis,
address = {Berkeley, CA},
author = {Erickson, Jeff},
date-modified = {2011-08-05 12:30:16 -0500},
month = {July},
school = {Comput. Sci. Div., Univ. of California},
title = {Lower Bounds for Fundamental Geometric Problems},
type = {{Ph.D.} thesis},
year = {1996}}
@article{kindex,
author = {Agarwal, Pankaj K. and Arge, Lars and Erickson, Jeff},
date-modified = {2008-12-06 23:45:09 -0600},
journal = {J. Comput. Syst. Sci.},
pages = {207--243},
title = {Indexing moving points},
volume = {66},
year = 2003}
@article{lincon,
author = {Agarwal, Pankaj K. and Arge, Lars and Erickson, Jeff and Franciosa, Paolo G. and Vitter, Jeffrey S.},
journal = {J. Comput. Syst. Sci.},
number = 2,
pages = {192--216},
title = {Efficient Searching with Linear Constraints},
volume = 61,
year = 2000}
@incollection{survey,
address = {Providence, RI},
author = {Agarwal, Pankaj K. and Erickson, Jeff},
booktitle = {Advances in Discrete and Computational Geometry},
editor = {Chazelle, B. and Goodman, J. E. and Pollack, R.},
pages = {1--56},
publisher = {American Mathematical Society},
series = {Contemporary Mathematics},
title = {Geometric range searching and its relatives},
volume = 223,
year = 1999}
@inproceedings{3dbsp,
author = {Agarwal, Pankaj K. and Erickson, Jeff and Guibas, Leonidas J.},
booktitle = {Proc. 9th Ann. ACM-SIAM Symp. Discrete Algorithms},
date-modified = {2008-12-06 23:43:57 -0600},
pages = {107--116},
title = {Kinetic Binary Space Partitions for Intersecting Segments and Disjoint Triangles},
year = 1998}
@article{small,
author = {Eppstein, David and Erickson, Jeff},
journal = {Discrete Comput. Geom.},
pages = {321--350},
title = {Iterated nearest neighbors and finding minimal polytopes},
volume = 11,
year = 1994}
@techreport{simplex,
address = {Irvine, CA},
author = {Eppstein, David and Erickson, Jeff},
institution = {Dept. Inform. Comput. Sci., Univ. California},
number = {92-55},
title = {New algorithms for minimum measure simplices and one-dimensional weighted {Voronoi} diagrams},
type = {Tech. Report},
year = 1992}
@misc{compgeom,
author = {Erickson, Jeff},
date-modified = {2024-05-19 11:33:50 -0500},
title = {Computational Geometry Pages},
url = {http://jeffe.cs.illinois.edu/compgeom/},
year = {1999},
bdsk-url-1 = {http://jeffe.cs.illinois.edu/compgeom/}}
@article{linsat,
author = {Erickson, Jeff},
journal = {Chicago J. Theor. Comput. Sci.},
number = 8,
title = {Lower Bounds for Linear Satisfiability Problems},
volume = 1999,
year = 1999}
@article{convex,
author = {Erickson, Jeff},
journal = {SIAM J. Comput.},
pages = {1198--1214},
title = {New Lower Bounds for Convex Hull Problems in Odd Dimensions},
volume = 28,
year = 1999}
@inproceedings{halfempty,
author = {Erickson, Jeff},
booktitle = {Proc. 37th Ann. IEEE Symp. Found. Comput. Sci.},
date-modified = {2008-12-06 23:40:10 -0600},
pages = {472--481},
title = {New Lower Bounds for Halfspace Emptiness},
year = 1996}
@article{hopcroft,
author = {Erickson, Jeff},
journal = {Discrete Comput. Geom.},
pages = {389--418},
title = {New Lower Bounds for {Hopcroft's} Problem},
update = {97.07 agarwal},
volume = 16,
year = 1996}
@inproceedings{relative,
author = {Erickson, Jeff},
booktitle = {Proc. 7th Canad. Conf. Comput. Geom.},
pages = {85--90},
title = {On the Relative Complexities of Some Geometric Problems},
url = {http://www.uiuc.edu/~jeffe/pubs/relative.html},
year = 1995,
bdsk-url-1 = {http://www.uiuc.edu/~jeffe/pubs/relative.html}}
@article{plucker,
author = {Erickson, Jeff},
date-modified = {2008-12-06 22:53:59 -0600},
journal = {Ray Tracing News},
month = dec,
number = 3,
title = {Pl{\"u}cker coordinates},
url = {http://www.acm.org/tog/resources/RTNews/html/rtnv10n3.html},
volume = 10,
year = 1997,
bdsk-url-1 = {http://www.acm.org/tog/resources/RTNews/html/rtnv10n3.html}}
@article{tradeoff,
author = {Erickson, Jeff},
journal = {SIAM J. Comput.},
number = 6,
pages = {1968--1996},
title = {Space-Time Tradeoffs for Emptiness Queries},
volume = 29,
year = 2000}
@article{degen,
author = {Erickson, Jeff and Seidel, Raimund},
journal = {Discrete Comput. Geom.},
note = {Erratum in \emph{Discrete Comput. Geom.} 13(1):41--57, 1997},
pages = {41--57},
title = {Better lower bounds on detecting affine and spherical degeneracies},
volume = 13,