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="Nussbaum, Doron"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Finding maximum edge bicliques in convex bipartite graphs
Doron Nussbaum
,
Shuye Pu
,
Jörg-Rüdiger Sack
,
Takeaki Uno
,
Hamid Zarrabi-Zadeh
Algorithmica
64
(2), 2012, pp. 311-325
Finding maximum edge bicliques in convex bipartite graphs
Doron Nussbaum
,
Shuye Pu
,
Jörg-Rüdiger Sack
,
Takeaki Uno
,
Hamid Zarrabi-Zadeh
Lecture Notes in Computer Science
6196
, 2010, pp. 140-149
On the longest increasing subsequence of a circular list
M.H. Albert
,
M.D. Atkinson
,
Doron Nussbaum
,
Jörg-Rüdiger Sack
,
Nicola Santoro
Information Processing Letters
101
(2), 2007, pp. 55-59
An
O(n^2\log n)
time algorithm for computing shortest paths amidst growing discs in the plane
Anil Maheshwari
,
Doron Nussbaum
,
Jörg-Rüdiger Sack
,
Jiehua Yi
Lecture Notes in Computer Science
4835
, 2007, pp. 668-680
Approximate shortest path queries on weighted polyhedral surfaces
Lyudmil Aleksandrov
,
Hristo N. Djidjev
,
Hua Guo
,
Anil Maheshwari
,
Doron Nussbaum
,
Jörg-Rüdiger Sack
Lecture Notes in Computer Science
4162
, 2006, pp. 98-109
Parallel implementation of geometric shortest path algorithms
Mark Lanthier
,
Doron Nussbaum
,
Jörg-Rüdiger Sack
Parallel Computing
29
(10), 2003, pp. 1445-1479
Rectilinear
p
-piercing problems
Doron Nussbaum
Proceedings of the 1997 International Symposium on Symbolic and Algebraic Computation, ISSAC'97 (Maui, Hawaii, July 21-23, 1997)
, 1997, pp. 316-323