Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Author="Katz, Matthew J."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Bounded-angle spanning tree: Modeling networks with angular constraints
Rom Aschner
,
Matthew J. Katz
Lecture Notes in Computer Science
8573
, 2014, pp. 387-398
Switching to directional antennas with constant increase in radius and hop distance
Prosenjit Bose
,
Paz Carmi
,
Mirela Damian
,
Robin Flatland
,
Matthew J. Katz
,
Anil Maheshwari
Algorithmica
69
(2), 2014, pp. 397-409
Bottleneck non-crossing matching in the plane
A. Karim Abu-Affash
,
Paz Carmi
,
Matthew J. Katz
,
Yohai Trabelsi
Lecture Notes in Computer Science
7501
, 2012, pp. 36-47
Do directional antennas facilitate in reducing interferences?
Rom Aschner
,
Matthew J. Katz
,
Gila Morgenstern
Lecture Notes in Computer Science
7357
, 2012, pp. 201-212
A scheme for computing minimum covers within simple regions
Matthew J. Katz
,
Gila Morgenstern
Algorithmica
62
(1-2), 2012, pp. 349-360
Switching to directional antennas with constant increase in radius and hop distance
Prosenjit Bose
,
Paz Carmi
,
Mirela Damian
,
Robin Flatland
,
Matthew J. Katz
,
Anil Maheshwari
Lecture Notes in Computer Science
6844
, 2011, pp. 134-146
Optimal cover of points by disks in a simple polygon
Haim Kaplan
,
Matthew J. Katz
,
Gila Morgenstern
,
Micha Sharir
SIAM Journal on Computing
40
(6), 2011, pp. 1647-1661
Settling the bound on the rectilinear link radius of a simple rectilinear polygon
Matthew J. Katz
,
Gila Morgenstern
Information Processing Letters
111
(3), 2011, pp. 103-106
The MST of symmetric disk graphs is light
A. Karim Abu-Affash
,
Rom Aschner
,
Paz Carmi
,
Matthew J. Katz
Lecture Notes in Computer Science
6139
, 2010, pp. 236-247
Optimal cover of points by disks in a simple polygon
Haim Kaplan
,
Matthew J. Katz
,
Gila Morgenstern
,
Micha Sharir
Lecture Notes in Computer Science
6346
, 2010, pp. 475-486
Improved bounds on the average distance to the Fermat-Weber center of a convex object
A. Karim Abu-Affash
,
Matthew J. Katz
Information Processing Letters
109
(6), 2009, pp. 329-333
Minimum-cost load-balancing partitions
Boris Aronov
,
Paz Carmi
,
Matthew J. Katz
Algorithmica
54
(3), 2009, pp. 318-336
Polychromatic 4-coloring of guillotine subdivisions
Elad Horev
,
Matthew J. Katz
,
Roi Krakovski
,
Maarten Löffler
Information Processing Letters
109
(13), 2009, pp. 690-694
A scheme for computing minimum covers within simple regions
Matthew J. Katz
,
Gila Morgenstern
Lecture Notes in Computer Science
5664
, 2009, pp. 447-458
A constant-factor approximation algorithm for optimal 1.5D terrain guarding
Boaz Ben-Moshe
,
Matthew J. Katz
,
Joseph S.B. Mitchell
SIAM Journal on Computing
36
(6), 2007, pp. 1631-1647
Covering points by unit disks of fixed location
Paz Carmi
,
Matthew J. Katz
,
Nissan Lev-Tov
Lecture Notes in Computer Science
4835
, 2007, pp. 644-655
Power assignment in radio networks with two power levels
Paz Carmi
,
Matthew J. Katz
Algorithmica
47
(2), 2007, pp. 183-201
On guarding rectilinear domains
Matthew J. Katz
,
Gabriel S. Roisman
Lecture Notes in Computer Science
4059
, 2006, pp. 220-231
Geographic quorum system approximations
Paz Carmi
,
Shlomi Dolev
,
Sariel Har-Peled
,
Matthew J. Katz
,
Michael Segal
Algorithmica
41
(4), 2005, pp. 233-244
The minimum-area spanning tree problem
Paz Carmi
,
Matthew J. Katz
,
Joseph S.B. Mitchell
Lecture Notes in Computer Science
3608
, 2005, pp. 195-204
TSP with neighborhoods of varying size
Mark de Berg
,
Joachim Gudmundsson
,
Matthew J. Katz
,
Christos Levcopoulos
,
Mark H. Overmars
,
A. Frank van der Stappen
Journal of Algorithms
57
(1), 2005, pp. 22-36
Computing all large sums-of-pairs in
R^n
and the discrete planar two-watchtower problem
Boaz Ben-Moshe
,
Paz Carmi
,
Matthew J. Katz
Information Processing Letters
89
(3), 2004, pp. 137-139
Power assignment in radio networks with two power levels
Paz Carmi
,
Matthew J. Katz
Lecture Notes in Computer Science
3111
, 2004, pp. 431-441
Maintenance of a piercing set for intervals with applications
Matthew J. Katz
,
Frank Nielsen
,
Michael Segal
Algorithmica
36
(1), 2003, pp. 59-73
Walking around fat obstacles
L. Paul Chew
,
Haggai David
,
Matthew J. Katz
,
Klara Kedem
Information Processing Letters
83
(3), 2002, pp. 135-140
Seiten 1
2
>