Matthew J. Katz

Matya Katz

	2012
98		Matthew J. Katz, Gila Morgenstern: A Scheme for Computing Minimum Covers within Simple Regions. Algorithmica 62(1-2): 349-360 (2012)
97		A. Karim Abu-Affash, Paz Carmi, Matthew J. Katz, Yohai Trabelsi: Bottleneck Non-Crossing Matching in the Plane CoRR abs/1202.4146: (2012)
96		A. Karim Abu-Affash, Rom Aschner, Paz Carmi, Matthew J. Katz: The MST of symmetric disk graphs is light. Comput. Geom. 45(1-2): 54-61 (2012)
95		Matthew J. Katz, Nissan Lev-Tov, Gila Morgenstern: Conflict-Free Coloring of points on a line with respect to a set of intervals. Comput. Geom. 45(9): 508-514 (2012)
94		Elad Horev, Matthew J. Katz, Roi Krakovski, Atsuhiro Nakamoto: Polychromatic 4-coloring of cubic bipartite plane graphs. Discrete Mathematics 312(4): 715-719 (2012)
	2011
93		A. Karim Abu-Affash, Paz Carmi, Matthew J. Katz: Bottleneck Steiner Tree with Bounded Number of Steiner Vertices. CCCG 2011
92		A. Karim Abu-Affash, Paz Carmi, Matthew J. Katz, Michael Segal: The euclidean bottleneck steiner path problem. Symposium on Computational Geometry 2011: 440-447
91		Prosenjit Bose, Paz Carmi, Mirela Damian, Robin Y. Flatland, Matthew J. Katz, Anil Maheshwari: Switching to Directional Antennas with Constant Increase in Radius and Hop Distance. WADS 2011: 134-146
90		A. Karim Abu-Affash, Paz Carmi, Matthew J. Katz, Gila Morgenstern: Multi Cover of a Polygon Minimizing the Sum of Areas. WALCOM 2011: 134-145
89		Rom Aschner, Matthew J. Katz, Gila Morgenstern: Symmetric Connectivity with Directional Antennas CoRR abs/1108.0492: (2011)
88		Paz Carmi, Matthew J. Katz, Zvi Lotker, Adi Rosén: Connectivity guarantees for wireless networks with directional antennas. Comput. Geom. 44(9): 477-485 (2011)
87		Matthew J. Katz, Gila Morgenstern: Settling the bound on the rectilinear link radius of a simple rectilinear polygon. Inf. Process. Lett. 111(3): 103-106 (2011)
86		Matthew J. Katz, Gila Morgenstern: Guarding Orthogonal Art Galleries with Sliding Cameras. Int. J. Comput. Geometry Appl. 21(2): 241-250 (2011)
85		A. Karim Abu-Affash, Paz Carmi, Matthew J. Katz, Gila Morgenstern: Multi Cover of a Polygon Minimizing the Sum of Areas. Int. J. Comput. Geometry Appl. 21(6): 685-698 (2011)
84		Haim Kaplan, Matthew J. Katz, Gila Morgenstern, Micha Sharir: Optimal Cover of Points by Disks in a Simple Polygon. SIAM J. Comput. 40(6): 1647-1661 (2011)
83		A. Karim Abu-Affash, Rom Aschner, Paz Carmi, Matthew J. Katz: Minimum power energy spanners in wireless ad hoc networks. Wireless Networks 17(5): 1251-1258 (2011)
	2010
82		Boaz Ben-Moshe, Paz Carmi, Lilach Chaitman, Matthew J. Katz, Gila Morgenstern, Yael Stein: Direction assignment in wireless networks. CCCG 2010: 39-42
81		Haim Kaplan, Matthew J. Katz, Gila Morgenstern, Micha Sharir: Optimal Cover of Points by Disks in a Simple Polygon. ESA (1) 2010: 475-486
80		A. Karim Abu-Affash, Rom Aschner, Paz Carmi, Matthew J. Katz: Minimum Power Energy Spanners in Wireless Ad Hoc Networks. INFOCOM 2010: 2411-2416
79		A. Karim Abu-Affash, Rom Aschner, Paz Carmi, Matthew J. Katz: The MST of Symmetric Disk Graphs Is Light. SWAT 2010: 236-247
	2009
78		Matthew J. Katz, Gila Morgenstern: A Scheme for Computing Minimum Covers within Simple Regions. WADS 2009: 447-458
77		Boris Aronov, Paz Carmi, Matthew J. Katz: Minimum-Cost Load-Balancing Partitions. Algorithmica 54(3): 318-336 (2009)
76		Elad Horev, Matthew J. Katz, Roi Krakovski, Maarten Löffler: Polychromatic 4-coloring of guillotine subdivisions. Inf. Process. Lett. 109(13): 690-694 (2009)
75		A. Karim Abu-Affash, Matthew J. Katz: Improved bounds on the average distance to the Fermat-Weber center of a convex object. Inf. Process. Lett. 109(6): 329-333 (2009)
74		Yefim Dinitz, Matthew J. Katz, Roi Krakovski: Guarding Rectangular Partitions. Int. J. Comput. Geometry Appl. 19(6): 579-594 (2009)
	2008
73		A. Karim Abu-Affash, Matthew J. Katz: Improved Bounds on the Average Distance to the Fermat-Weber Center of a Convex Object. CCCG 2008
72		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)
71		Matthew J. Katz, Gabriel S. Roisman: On guarding the vertices of rectilinear domains. Comput. Geom. 39(3): 219-228 (2008)
70		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
69		Boaz Ben-Moshe, Matthew J. Katz, Igor Zaslavsky: Distance Preserving Terrain Simplification - An Experimental Study. CCCG 2007: 129-132
68		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
67		Paz Carmi, Matthew J. Katz, Nissan Lev-Tov: Covering Points by Unit Disks of Fixed Location. ISAAC 2007: 644-655
66		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)
65		Paz Carmi, Matthew J. Katz: Power Assignment in Radio Networks with Two Power Levels. Algorithmica 47(2): 183-201 (2007)
64		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
63		Paz Carmi, Matthew J. Katz: Power Assignment in Radio Networks with Two Power Levels. Geometric Networks and Metric Space Embeddings 2006
62		Paz Carmi, Michael Segal, Matthew J. Katz, Hanan Shpungin: Fault-Tolerant Power Assignment and Backbone in Wireless Networks. PerCom Workshops 2006: 80-84
61		Olaf A. Hall-Holt, Matthew J. Katz, Piyush Kumar, Joseph S. B. Mitchell, Arik Sityon: Finding large sticks and potatoes in polygons. SODA 2006: 474-483
60		Matthew J. Katz, Gabriel S. Roisman: On Guarding Rectilinear Domains. SWAT 2006: 220-231
59		Boris Aronov, Paz Carmi, Matthew J. Katz: Minimum-cost load-balancing partitions. Symposium on Computational Geometry 2006: 301-308
58		Paz Carmi, Matthew J. Katz, Joseph S. B. Mitchell: The minimum-area spanning tree problem. Comput. Geom. 35(3): 218-225 (2006)
	2005
57		Paz Carmi, Matthew J. Katz: Minimum-Cost Load-Balancing Partitions. CCCG 2005: 65-67
56		Paz Carmi, Matthew J. Katz: The minimum area spanning tree problem. EuroCG 2005: 191-194
55		Boaz Ben-Moshe, Matthew J. Katz, Joseph S. B. Mitchell: A constant-factor approximation algorithm for optimal terrain guarding. SODA 2005: 515-524
54		Paz Carmi, Matthew J. Katz, Joseph S. B. Mitchell: The Minimum-Area Spanning Tree Problem. WADS 2005: 195-204
53		Paz Carmi, Shlomi Dolev, Sariel Har-Peled, Matthew J. Katz, Michael Segal: Geographic Quorum System Approximations. Algorithmica 41(4): 233-244 (2005)
52		Matthew J. Katz, Joseph S. B. Mitchell, Yuval Nir: Orthogonal segment stabbing. Comput. Geom. 30(2): 197-205 (2005)
51		Paz Carmi, Sariel Har-Peled, Matthew J. Katz: On the Fermat-Weber center of a convex object. Comput. Geom. 32(3): 188-195 (2005)
50		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
49		Boaz Ben-Moshe, Paz Carmi, Matthew J. Katz: Approximating the Visible Region of a Point on a Terrain. ALENEX/ANALC 2004: 120-128
48		Paz Carmi, Matthew J. Katz: Power Assignment in Radio Networks with Two Power Levels. SWAT 2004: 431-441
47		Boaz Ben-Moshe, Olaf A. 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
46		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)
45		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
44		Matthew J. Katz, Frank Nielsen, Michael Segal: Maintenance of a Piercing Set for Intervals with Applications. Algorithmica 36(1): 59-73 (2003)
43		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
42		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
41		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
40		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)
39		Matthew J. Katz, Klara Kedem: Sixteenth European Workshop on Computational Geometry - Editorial. Comput. Geom. 21(1-2): 1 (2002)
38		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)
37		Matthew J. Katz, Klara Kedem, Michael Segal: Improved algorithms for placing undesirable facilities. Computers & OR 29(13): 1859-1872 (2002)
36		L. Paul Chew, Haggai David, Matthew J. Katz, Klara Kedem: Walking around fat obstacles. Inf. Process. Lett. 83(3): 135-140 (2002)
	2001
35		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
34		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
33		Alon Efrat, Alon Itai, Matthew J. Katz: Geometry Helps in Bottleneck Matching and Related Problems. Algorithmica 31(1): 1-28 (2001)
32		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
31		Matthew J. Katz, Frank Nielsen, Michael Segal: Shooter Location through Piercing Sets. EuroCG 2000: 55-58
30		Matthew J. Katz, Frank Nielsen, Michael Segal: Maintenance of a Percing Set for Intervals with Applications. ISAAC 2000: 552-563
29		Matthew J. Katz, Klara Kedem, Michael Segal: Discrete rectilinear 2-center problems. Comput. Geom. 15(4): 203-214 (2000)
28		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)
27		Alon Efrat, Matthew J. Katz: Computing Euclidean bottleneck matchings in higher dimensions. Inf. Process. Lett. 75(4): 169-174 (2000)
26		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
25		Matthew J. Katz, Klara Kedem, Michael Segal: Improved algorithms for placing undesirable facilities. CCCG 1999
24		Boaz Ben-Moshe, Matthew J. Katz, Michael Segal: Obnoxious facility location: Complete service with minimal harm. CCCG 1999
23		Alon Efrat, Matthew J. Katz: On the union of k-curved objects. Comput. Geom. 14(4): 241-254 (1999)
22		Olivier Devillers, Matthew J. Katz: Optimal Line Bipartitions of Point Sets. Int. J. Comput. Geometry Appl. 9(1): 39-51 (1999)
21		Eyal Assa, Matthew J. Katz: 3-Piercing of d-Dimensional Boxes and Homothetic Triangles. Int. J. Comput. Geometry Appl. 9(3): 249- (1999)
	1998
20		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
19		Mark de Berg, Matthew J. Katz, Mark H. Overmars, A. Frank van der Stappen, Jules Vleugels: Models and Motion Planning. SWAT 1998: 83-94
18		Matthew J. Katz, Klara Kedem, Michael Segal: Constrained Square-Center Problems. SWAT 1998: 95-106
17		Alon Efrat, Matthew J. Katz: On the Union of k-Curved Objects. Symposium on Computational Geometry 1998: 206-213
	1997
16		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
15		Alon Efrat, Matthew J. Katz, Frank Nielsen, Micha Sharir: Dynamic Data Structures for Fat Objects and Their Applications. WADS 1997: 297-306
14		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)
13		Matthew J. Katz, Micha Sharir: An Expander-Based Approach to Geometric Optimization. SIAM J. Comput. 26(5): 1384-1408 (1997)
	1996
12		Alon Efrat, Matthew J. Katz: Computing Fair and Bottleneck Matchings in Geormetric Graphs. ISAAC 1996: 115-125
11		Olivier Devillers, Matthew J. Katz: Optimal Line Bipartitions of Point Sets. ISAAC 1996: 45-54
10		Matthew J. Katz, Frank Nielsen: On Piercing Sets of Objects. Symposium on Computational Geometry 1996: 113-121
	1995
9		Matthew J. Katz: Improved Algorithms in Geometric Optimization via Expanders. ISTCS 1995: 78-87
8		Pankaj K. Agarwal, Matthew J. Katz, Micha Sharir: Computing Depth Orders for Fat Objects and Related Problems. Comput. Geom. 5: 187-206 (1995)
	1994
7		Pankaj K. Agarwal, Matthew J. Katz, Micha Sharir: Computing Depth Orders and Related Problems. SWAT 1994: 1-12
	1993
6		Matthew J. Katz, Micha Sharir: Optimal Slope Selection Via Expanders. CCCG 1993: 139-144
5		Matthew J. Katz, Micha Sharir: An Expander-Based Approach to Geometric Optimization. Symposium on Computational Geometry 1993: 198-207
4		Matthew J. Katz, Micha Sharir: Optimal Slope Selection via Expanders. Inf. Process. Lett. 47(3): 115-122 (1993)
3		Matthew J. Katz, Jeffrey S. Rosenschein: Verifying plans for multiple agents. J. Exp. Theor. Artif. Intell. 5(1): 39-56 (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		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	A. Karim Abu-Affash	[73] [75] [79] [80] [83] [85] [90] [92] [93] [96] [97]
2	Pankaj K. Agarwal	[7] [8]
3	Boris Aronov	[59] [77]
4	Rom Aschner	[79] [80] [83] [89] [96]
5	Eyal Assa	[21]
6	Boaz Ben-Moshe	[24] [26] [35] [41] [45] [46] [47] [49] [55] [64] [69] [70] [82]
7	Mark de Berg	[16] [19] [20] [38] [40] [42] [43] [50]
8	Prosenjit Bose	[91]
9	Paz Carmi	[45] [48] [49] [51] [53] [54] [56] [57] [58] [59] [62] [63] [65] [66] [67] [70] [72] [77] [79] [80] [82] [83] [85] [88] [90] [91] [92] [93] [96] [97]
10	Lilach Chaitman	[82]
11	L. Paul Chew	[36]
12	Mirela Damian (Mirela Damian-Iordache)	[91]
13	Haggai David	[20] [36] [43]
14	Olivier Devillers	[11] [22]
15	Yefim Dinitz	[74]
16	Shlomi Dolev	[53]
17	Alon Efrat	[12] [15] [17] [23] [27] [28] [33]
18	Robin Y. Flatland	[91]
19	Joachim Gudmundsson	[42] [50]
20	Olaf A. Hall-Holt	[47] [61]
21	Sariel Har-Peled	[51] [53]
22	Elad Horev	[76] [94]
23	Alon Itai	[33]
24	Haim Kaplan	[81] [84]
25	Klara Kedem	[18] [25] [29] [36] [37] [39]
26	Roi Krakovski	[74] [76] [94]
27	Piyush Kumar	[61]
28	Nissan Lev-Tov (Nissan Law-yone)	[67] [68] [72] [95]
29	Christos Levcopoulos	[42] [50]
30	Maarten Löffler	[76]
31	Zvi Lotker	[88]
32	Anil Maheshwari	[91]
33	Joseph S. B. Mitchell	[35] [41] [46] [47] [52] [54] [55] [58] [61] [64]
34	Gila Morgenstern	[68] [78] [81] [82] [84] [85] [86] [87] [89] [90] [95] [98]
35	Atsuhiro Nakamoto	[94]
36	Frank Nielsen	[10] [15] [28] [30] [31] [44]
37	Yuval Nir	[41] [46] [52]
38	Mark H. Overmars	[1] [2] [19] [20] [38] [42] [43] [50]
39	Gabriel S. Roisman	[60] [71]
40	Adi Rosén	[88]
41	Jeffrey S. Rosenschein	[3]
42	Michael Segal	[18] [24] [25] [26] [29] [30] [31] [37] [44] [53] [62] [66] [92]
43	Micha Sharir	[1] [2] [4] [5] [6] [7] [8] [13] [15] [28] [81] [84]
44	Hanan Shpungin	[62] [66]
45	Arik Sityon	[61]
46	A. Frank van der Stappen	[16] [19] [20] [38] [40] [42] [43] [50]
47	Yael Stein	[82]
48	Yohai Trabelsi	[97]
49	Kasturi R. Varadarajan	[32] [34]
50	Jules Vleugels	[16] [19] [20] [38] [40] [43]
51	Igor Zaslavsky	[69]

Colors in the list of coauthors

Last update Sun Jun 3 16:06:10 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page