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
[1]
Hilfe
Suche: Author="Smorodinsky, Shakhar"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Strong conflict-free coloring for intervals
Panagiotis Cheilaris
,
Luisa Gargano
,
Adele A. Rescigno
,
Shakhar Smorodinsky
Algorithmica
70
(4), 2014, pp. 732-749
On totally positive matrices and geometric incidences
Miriam Farber
,
Saurabh Ray
,
Shakhar Smorodinsky
Journal of Combinatorial Theory Series A
128
, 2014, pp. 149-161
Strong conflict-free coloring for intervals
Panagiotis Cheilaris
,
Luisa Gargano
,
Adele A. Rescigno
,
Shakhar Smorodinsky
Lecture Notes in Computer Science
7676
, 2012, pp. 4-13
Polychromatic coloring for half-planes
Shakhar Smorodinsky
,
Yelena Yuditsky
Journal of Combinatorial Theory Series A
119
(1), 2012, pp. 146-154
Colorful strips
Greg Aloupis
,
Jean Cardinal
,
Sébastien Collette
,
Shinji Imahori
,
Matias Korman
,
Stefan Langerman
,
Oded Schwartz
,
Shakhar Smorodinsky
,
Perouz Taslakian
Graphs and Combinatorics
27
(3), 2011, pp. 327-339
Hitting sets online and vertex ranking
Guy Even
,
Shakhar Smorodinsky
Lecture Notes in Computer Science
6942
, 2011, pp. 347-357
Colorful strips
Greg Aloupis
,
Jean Cardinal
,
Sébastien Collette
,
Shinji Imahori
,
Matias Korman
,
Stephan Langerman
,
Oded Schwartz
,
Shakhar Smorodinsky
,
Perouz Taslakian
Lecture Notes in Computer Science
6034
, 2010, pp. 2-13
Conflict-free coloring made stronger
Elad Horev
,
Roi Krakovski
,
Shakhar Smorodinsky
Lecture Notes in Computer Science
6139
, 2010, pp. 105-117
Polychromatic coloring for half-planes
Shakhar Smorodinsky
,
Yelena Yuditsky
Lecture Notes in Computer Science
6139
, 2010, pp. 118-126
Weak
\epsilon
-nets and interval chains
Noga Alon
,
Haim Kaplan
,
Gabriel Nivasch
,
Micha Sharir
,
Shakhar Smorodinsky
Journal of the ACM
55
(6), 2008, pp. 28: 1-32
On center regions and balls containing many points
Shakhar Smorodinsky
,
Marek Sulovský
,
Uli Wagner
Lecture Notes in Computer Science
5092
, 2008, pp. 363-373
On center regions and balls containing many points
Shakhar Smorodinsky
,
Marek Sulovský
,
Uli Wagner
Lecture Notes in Computer Science
5092
, 2008, pp. 363-373
A note on the online First-Fit algorithm for coloring
k
-inductive graphs
Shakhar Smorodinsky
Information Processing Letters
109
(1), 2008, pp. 44-45
Online conflict-free colorings for hypergraphs
Amotz Bar-Noy
,
Panagiotis Cheilaris
,
Svetlana Olonetsky
,
Shakhar Smorodinsky
Lecture Notes in Computer Science
4596
, 2007, pp. 219-230
Weakening the online adversary just enough to get optimal conflict-free colorings for intervals
Amotz Bar-Noy
,
Panagiotis Cheilaris
,
Svetlana Olonetsky
,
Shakhar Smorodinsky
Proceedings of the 19th Annual Symposium on Parallelism in Algorithms and Architectures, SPAA'2007 (San Diego, CA, USA, June 9-11, 2007)
, 2007, pp. 194-195
On the chromatic number of geometric hypergraphs
Shakhar Smorodinsky
SIAM Journal on Discrete Mathematics
21
(3), 2007, pp. 676-687
Conflict-free coloring for intervals: From offline to online
Amotz Bar-Noy
,
Panagiotis Cheilaris
,
Shakhar Smorodinsky
Proceedings of the 18th Annual ACM Symposium on Parallelism in Algorithms and Architectures, SPAA'2006 (Cambridge, Massachusetts, USA, July 30 - August 2, 2006)
, 2006, pp. 128-137
Online conflict-free coloring for intervals
Ke Chen
,
Amos Fiat
,
Haim Kaplan
,
Meital Levy
,
Jiȓí Matous̑ek
,
Elchanan Mossel
,
János Pach
,
Micha Sharir
,
Shakhar Smorodinsky
,
Uli Wagner
,
Emo Welzl
SIAM Journal on Computing
36
(5), 2006-2007, pp. 1342-1359
Lenses in arrangements of pseudo-circles and their applications
Pankaj K. Agarwal
,
Eran Nevo
,
János Pach
,
Rom Pinchasi
,
Micha Sharir
,
Shakhar Smorodinsky
Journal of the ACM
51
(2), 2004, pp. 139-186
Conflict-free colorings of simple geometric regions with applications to frequency assignment in cellular networks
Guy Even
,
Zvi Lotker
,
Dana Ron
,
Shakhar Smorodinsky
SIAM Journal on Computing
33
(1), 2003, pp. 94-136
Extremal configurations and levels in pseudoline arrangements
Micha Sharir
,
Shakhar Smorodinsky
Lecture Notes in Computer Science
2748
, 2003, pp. 127-139
Conflict-free colorings of simple geometric regions with applications to frequency assignment in cellular networks
Guy Even
,
Zvi Lotker
,
Dana Ron
,
Shakhar Smorodinsky
Proceedings of the 43rd Annual IEEE Symposium on Foundations of Computer Science, FOCS'2002 (Vancouver, BC, Canada, November 16-19, 2002)
, 2002, pp. 691-700
On neighbors in geometric permutations
Micha Sharir
,
Shakhar Smorodinsky
Lecture Notes in Computer Science
2368
, 2002, pp. 131-139