Matthew J. Katz

Matya Katz

2008
71		Karim Abu Affash, Matthew J. Katz: Improved Bounds on the Average Distance to the Fermat-Weber Center of a Convex Object. CCCG 2008
70	EE	Paz Carmi, Matthew J. Katz, Nissan Lev-Tov: Polynomial-time approximation schemes for piercing and covering with applications in wireless networks. Comput. Geom. 39(3): 209-218 (2008)
69	EE	Matthew J. Katz, Gabriel S. Roisman: On guarding the vertices of rectilinear domains. Comput. Geom. 39(3): 219-228 (2008)
68	EE	Boaz Ben-Moshe, Paz Carmi, Matthew J. Katz: Approximating the Visible Region of a Point on a Terrain. GeoInformatica 12(1): 21-36 (2008)
2007
67		Boaz Ben-Moshe, Matthew J. Katz, Igor Zaslavsky: Distance Preserving Terrain Simplification - An Experimental Study. CCCG 2007: 129-132
66		Matthew J. Katz, Nissan Lev-Tov, Gila Morgenstern: Conflict-Free Coloring of Points on a Line with respect to a Set of Intervals. CCCG 2007: 93-96
65	EE	Paz Carmi, Matthew J. Katz, Nissan Lev-Tov: Covering Points by Unit Disks of Fixed Location. ISAAC 2007: 644-655
64		Paz Carmi, Matthew J. Katz, Michael Segal, Hanan Shpungin: Fault-Tolerant Power Assignment and Backbone in Wireless Networks. Ad Hoc & Sensor Wireless Networks 4(4): 355-366 (2007)
63	EE	Paz Carmi, Matthew J. Katz: Power Assignment in Radio Networks with Two Power Levels. Algorithmica 47(2): 183-201 (2007)
62	EE	Boaz Ben-Moshe, Matthew J. Katz, Joseph S. B. Mitchell: A Constant-Factor Approximation Algorithm for Optimal 1.5D Terrain Guarding. SIAM J. Comput. 36(6): 1631-1647 (2007)
2006
61	EE	Paz Carmi, Matthew J. Katz: Power Assignment in Radio Networks with Two Power Levels. Geometric Networks and Metric Space Embeddings 2006
60	EE	Paz Carmi, Michael Segal, Matthew J. Katz, Hanan Shpungin: Fault-Tolerant Power Assignment and Backbone in Wireless Networks. PerCom Workshops 2006: 80-84
59	EE	Olaf Hall-Holt, Matthew J. Katz, Piyush Kumar, Joseph S. B. Mitchell, Arik Sityon: Finding large sticks and potatoes in polygons. SODA 2006: 474-483
58	EE	Matthew J. Katz, Gabriel S. Roisman: On Guarding Rectilinear Domains. SWAT 2006: 220-231
57	EE	Boris Aronov, Paz Carmi, Matthew J. Katz: Minimum-cost load-balancing partitions. Symposium on Computational Geometry 2006: 301-308
56	EE	Paz Carmi, Matthew J. Katz, Joseph S. B. Mitchell: The minimum-area spanning tree problem. Comput. Geom. 35(3): 218-225 (2006)
2005
55	EE	Paz Carmi, Matthew J. Katz: Minimum-Cost Load-Balancing Partitions. CCCG 2005: 65-67
54	EE	Boaz Ben-Moshe, Matthew J. Katz, Joseph S. B. Mitchell: A constant-factor approximation algorithm for optimal terrain guarding. SODA 2005: 515-524
53	EE	Paz Carmi, Matthew J. Katz, Joseph S. B. Mitchell: The Minimum-Area Spanning Tree Problem. WADS 2005: 195-204
52	EE	Paz Carmi, Shlomi Dolev, Sariel Har-Peled, Matthew J. Katz, Michael Segal: Geographic Quorum System Approximations. Algorithmica 41(4): 233-244 (2005)
51	EE	Matthew J. Katz, Joseph S. B. Mitchell, Yuval Nir: Orthogonal segment stabbing. Comput. Geom. 30(2): 197-205 (2005)
50	EE	Paz Carmi, Sariel Har-Peled, Matthew J. Katz: On the Fermat-Weber center of a convex object. Comput. Geom. 32(3): 188-195 (2005)
49	EE	Mark de Berg, Joachim Gudmundsson, Matthew J. Katz, Christos Levcopoulos, Mark H. Overmars, A. Frank van der Stappen: TSP with neighborhoods of varying size. J. Algorithms 57(1): 22-36 (2005)
2004
48		Boaz Ben-Moshe, Paz Carmi, Matthew J. Katz: Approximating the Visible Region of a Point on a Terrain. ALENEX/ANALC 2004: 120-128
47	EE	Paz Carmi, Matthew J. Katz: Power Assignment in Radio Networks with Two Power Levels. SWAT 2004: 431-441
46	EE	Boaz Ben-Moshe, Olaf Hall-Holt, Matthew J. Katz, Joseph S. B. Mitchell: Computing the visibility graph of points within a polygon. Symposium on Computational Geometry 2004: 27-35
45	EE	Boaz Ben-Moshe, Matthew J. Katz, Joseph S. B. Mitchell, Yuval Nir: Visibility preserving terrain simplification-- an experimental study. Comput. Geom. 28(2-3): 175-190 (2004)
44	EE	Boaz Ben-Moshe, Paz Carmi, Matthew J. Katz: Computing all large sums-of-pairs in Rn and the discrete planar two-watchtower problem. Inf. Process. Lett. 89(3): 137-139 (2004)
2003
43	EE	Matthew J. Katz, Frank Nielsen, Michael Segal: Maintenance of a Piercing Set for Intervals with Applications. Algorithmica 36(1): 59-73 (2003)
42	EE	Mark de Berg, Haggai David, Matthew J. Katz, Mark H. Overmars, A. Frank van der Stappen, Jules Vleugels: Guarding scenes against invasive hypercubes. Comput. Geom. 26(2): 99-117 (2003)
2002
41	EE	Mark de Berg, Joachim Gudmundsson, Matthew J. Katz, Christos Levcopoulos, Mark H. Overmars, A. Frank van der Stappen: TSP with Neighborhoods of Varying Size. ESA 2002: 187-199
40	EE	Boaz Ben-Moshe, Joseph S. B. Mitchell, Matthew J. Katz, Yuval Nir: Visibility preserving terrain simplification: an experimental study. Symposium on Computational Geometry 2002: 303-311
39	EE	Mark de Berg, A. Frank van der Stappen, Jules Vleugels, Matthew J. Katz: Realistic Input Models for Geometric Algorithms. Algorithmica 34(1): 81-97 (2002)
38		Matthew J. Katz, Klara Kedem: Sixteenth European Workshop on Computational Geometry - Editorial. Comput. Geom. 21(1-2): 1 (2002)
37		Mark de Berg, Matthew J. Katz, Mark H. Overmars, A. Frank van der Stappen, Jules Vleugels: Models and motion planning. Comput. Geom. 23(1): 53-68 (2002)
36	EE	Matthew J. Katz, Klara Kedem, Michael Segal: Improved algorithms for placing undesirable facilities. Computers & OR 29(13): 1859-1872 (2002)
35	EE	L. Paul Chew, Haggai David, Matthew J. Katz, Klara Kedem: Walking around fat obstacles. Inf. Process. Lett. 83(3): 135-140 (2002)
2001
34	EE	Boaz Ben-Moshe, Matthew J. Katz, Joseph S. B. Mitchell: Farthest neighbors and center points in the presence of rectangular obstacles. Symposium on Computational Geometry 2001: 164-171
33	EE	Matthew J. Katz, Kasturi R. Varadarajan: A tight bound on the number of geometric permutations of convex fat objects in Rd. Symposium on Computational Geometry 2001: 249-251
32	EE	Alon Efrat, Alon Itai, Matthew J. Katz: Geometry Helps in Bottleneck Matching and Related Problems. Algorithmica 31(1): 1-28 (2001)
31	EE	Matthew J. Katz, Kasturi R. Varadarajan: A Tight Bound on the Number of Geometric Permutations of Convex Fat Objects in Rd. Discrete & Computational Geometry 26(4): 543-548 (2001)
2000
30		Matthew J. Katz, Frank Nielsen, Michael Segal: Shooter Location through Piercing Sets. EWCG 2000: 55-58
29	EE	Matthew J. Katz, Frank Nielsen, Michael Segal: Maintenance of a Percing Set for Intervals with Applications. ISAAC 2000: 552-563
28		Matthew J. Katz, Klara Kedem, Michael Segal: Discrete rectilinear 2-center problems. Comput. Geom. 15(4): 203-214 (2000)
27		Alon Efrat, Matthew J. Katz, Frank Nielsen, Micha Sharir: Dynamic data structures for fat objects and their applications. Comput. Geom. 15(4): 215-227 (2000)
26	EE	Alon Efrat, Matthew J. Katz: Computing Euclidean bottleneck matchings in higher dimensions. Inf. Process. Lett. 75(4): 169-174 (2000)
25		Boaz Ben-Moshe, Matthew J. Katz, Michael Segal: Obnoxious Facility Location: Complete Service with Minimal Harm. Int. J. Comput. Geometry Appl. 10(6): 581-592 (2000)
1999
24	EE	Matthew J. Katz, Klara Kedem, Michael Segal: Improved algorithms for placing undesirable facilities. CCCG 1999
23	EE	Boaz Ben-Moshe, Matthew J. Katz, Michael Segal: Obnoxious facility location: Complete service with minimal harm. CCCG 1999
22		Alon Efrat, Matthew J. Katz: On the union of k-curved objects. Comput. Geom. 14(4): 241-254 (1999)
21		Olivier Devillers, Matthew J. Katz: Optimal Line Bipartitions of Point Sets. Int. J. Comput. Geometry Appl. 9(1): 39-51 (1999)
20		Eyal Assa, Matthew J. Katz: 3-Piercing of d-Dimensional Boxes and Homothetic Triangles. Int. J. Comput. Geometry Appl. 9(3): 249- (1999)
1998
19		Mark de Berg, Haggai David, Matthew J. Katz, Mark H. Overmars, A. Frank van der Stappen, Jules Vleugels: Guarding Scenes against Invasive Hypercubes. Algorithm Engineering 1998: 110-120
18	EE	Mark de Berg, Matthew J. Katz, Mark H. Overmars, A. Frank van der Stappen, Jules Vleugels: Models and Motion Planning. SWAT 1998: 83-94
17	EE	Matthew J. Katz, Klara Kedem, Michael Segal: Constrained Square-Center Problems. SWAT 1998: 95-106
16	EE	Alon Efrat, Matthew J. Katz: On the Union of k-Curved Objects. Symposium on Computational Geometry 1998: 206-213
1997
15	EE	Mark de Berg, Matthew J. Katz, A. Frank van der Stappen, Jules Vleugels: Realistic Input Models for Geometric Algorithms. Symposium on Computational Geometry 1997: 294-303
14		Alon Efrat, Matthew J. Katz, Frank Nielsen, Micha Sharir: Dynamic Data Structures for Fat Objects and Their Applications. WADS 1997: 297-306
13		Matthew J. Katz: 3-D Vertical Ray Shooting and 2-D Point Enclosure, Range Searching, and Arc Shooting Amidst Convex Fat Objects. Comput. Geom. 8: 299-316 (1997)
12		Matthew J. Katz, Micha Sharir: An Expander-Based Approach to Geometric Optimization. SIAM J. Comput. 26(5): 1384-1408 (1997)
1996
11		Alon Efrat, Matthew J. Katz: Computing Fair and Bottleneck Matchings in Geormetric Graphs. ISAAC 1996: 115-125
10		Olivier Devillers, Matthew J. Katz: Optimal Line Bipartitions of Point Sets. ISAAC 1996: 45-54
9	EE	Matthew J. Katz, Frank Nielsen: On Piercing Sets of Objects. Symposium on Computational Geometry 1996: 113-121
1995
8		Matthew J. Katz: Improved Algorithms in Geometric Optimization via Expanders. ISTCS 1995: 78-87
7		Pankaj K. Agarwal, Matthew J. Katz, Micha Sharir: Computing Depth Orders for Fat Objects and Related Problems. Comput. Geom. 5: 187-206 (1995)
1994
6		Pankaj K. Agarwal, Matthew J. Katz, Micha Sharir: Computing Depth Orders and Related Problems. SWAT 1994: 1-12
1993
5		Matthew J. Katz, Micha Sharir: Optimal Slope Selection Via Expanders. CCCG 1993: 139-144
4	EE	Matthew J. Katz, Micha Sharir: An Expander-Based Approach to Geometric Optimization. Symposium on Computational Geometry 1993: 198-207
3		Matthew J. Katz, Micha Sharir: Optimal Slope Selection via Expanders. Inf. Process. Lett. 47(3): 115-122 (1993)
1992
2		Matthew J. Katz, Mark H. Overmars, Micha Sharir: Efficient Hidden Surface Removal for Objects with Small Union Size. Comput. Geom. 2: 223-234 (1992)
1991
1	EE	Matthew J. Katz, Mark H. Overmars, Micha Sharir: Efficient Hidden Surface Removal for Objects with small Union Size. Symposium on Computational Geometry 1991: 31-40

Coauthor Index

1	Karim Abu Affash	[71]
2	Pankaj K. Agarwal	[6] [7]
3	Boris Aronov	[57]
4	Eyal Assa	[20]
5	Boaz Ben-Moshe	[23] [25] [34] [40] [44] [45] [46] [48] [54] [62] [67] [68]
6	Mark de Berg	[15] [18] [19] [37] [39] [41] [42] [49]
7	Paz Carmi	[44] [47] [48] [50] [52] [53] [55] [56] [57] [60] [61] [63] [64] [65] [68] [70]
8	L. Paul Chew	[35]
9	Haggai David	[19] [35] [42]
10	Olivier Devillers	[10] [21]
11	Shlomi Dolev	[52]
12	Alon Efrat	[11] [14] [16] [22] [26] [27] [32]
13	Joachim Gudmundsson	[41] [49]
14	Olaf Hall-Holt	[46] [59]
15	Sariel Har-Peled	[50] [52]
16	Alon Itai	[32]
17	Klara Kedem	[17] [24] [28] [35] [36] [38]
18	Piyush Kumar	[59]
19	Nissan Lev-Tov	[65] [66] [70]
20	Christos Levcopoulos	[41] [49]
21	Joseph S. B. Mitchell	[34] [40] [45] [46] [51] [53] [54] [56] [59] [62]
22	Gila Morgenstern	[66]
23	Frank Nielsen	[9] [14] [27] [29] [30] [43]
24	Yuval Nir	[40] [45] [51]
25	Mark H. Overmars	[1] [2] [18] [19] [37] [41] [42] [49]
26	Gabriel S. Roisman	[58] [69]
27	Michael Segal	[17] [23] [24] [25] [28] [29] [30] [36] [43] [52] [60] [64]
28	Micha Sharir	[1] [2] [3] [4] [5] [6] [7] [12] [14] [27]
29	Hanan Shpungin	[60] [64]
30	Arik Sityon	[59]
31	A. Frank van der Stappen	[15] [18] [19] [37] [39] [41] [42] [49]
32	Kasturi R. Varadarajan	[31] [33]
33	Jules Vleugels	[15] [18] [19] [37] [39] [42]
34	Igor Zaslavsky	[67]

Colors in the list of coauthors