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="Gudmundsson, Joachim"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
A generalization of the convex Kakeya problem
Hee-Kap Ahn
,
Sang Won Bae
,
Otfried Cheong
,
Joachim Gudmundsson
,
Takeshi Tokuyama
,
Antoine Vigneron
Algorithmica
70
(2), 2014, pp. 152-170
Increasing-chord graphs on point sets
Hooman Reisi Dehkordi
,
Fabrizio Frati
,
Joachim Gudmundsson
Lecture Notes in Computer Science
8871
, 2014, pp. 464-475
On the number of upward planar orientations of maximal planar graphs
Fabrizio Frati
,
Joachim Gudmundsson
,
Emo Welzl
Theoretical Computer Science
544
, 2014, pp. 32-59
SEFE with no mapping via large induced outerplane graphs in plane graphs
Patrizio Angelini
,
William Evans
,
Fabrizio Frati
,
Joachim Gudmundsson
Lecture Notes in Computer Science
8283
, 2013, pp. 185-195
A fast algorithm for data collection along a fixed track
Otfried Cheong
,
Radwa El Shawi
,
Joachim Gudmundsson
Lecture Notes in Computer Science
7936
, 2013, pp. 77-88
Fast query structures in anisotropic media
Radwa El Shawi
,
Joachim Gudmundsson
Theoretical Computer Science
497
, 2013, pp. 112-122
Augmenting graphs to minimize the diameter
Fabrizio Frati
,
Serge Gaspers
,
Joachim Gudmundsson
,
Luke Mathieson
Lecture Notes in Computer Science
8283
, 2013, pp. 383-393
Fréchet queries in geometric trees
Joachim Gudmundsson
,
Michiel Smid
Lecture Notes in Computer Science
8125
, 2013, pp. 565-576
Geodesic order types
Oswin Aichholzer
,
Matias Korman
,
Alexander Pilz
,
Birgit Vogtenhuber
Lecture Notes in Computer Science
7434
, 2012, pp. 216-227
Geometric RAC simultaneous drawings of graphs
Evmorfia Argyriou
,
Michael Bekos
,
Michael Kaufmann
,
Antonios Symvonis
Lecture Notes in Computer Science
7434
, 2012, pp. 287-298
An improved algorithm for packing
T
-paths in inner Eulerian networks
Maxim A. Babenko
,
Kamil Salikhov
,
Stepan Artamonov
Lecture Notes in Computer Science
7434
, 2012, pp. 109-120
Speed scaling for maximum lateness
Evripidis Bampis
,
Dimitrios Letsios
,
Ioannis Milis
,
Georgios Zois
Lecture Notes in Computer Science
7434
, 2012, pp. 25-36
Ramsey numbers for line graphs and perfect graphs
Rémy Belmonte
,
Pinar Heggernes
,
Pim van 't Hof
,
Reza Saei
Lecture Notes in Computer Science
7434
, 2012, pp. 204-215
Contiguous minimum single-source-multi-sink cuts in weighted planar graphs
Ivona Bezáková
,
Zachary Langley
Lecture Notes in Computer Science
7434
, 2012, pp. 49-60
A linear time algorithm for computing minmax regret 1-median on a tree
Binay Bhattacharya
,
Tsunehiko Kameda
Lecture Notes in Computer Science
7434
, 2012, pp. 1-12
External memory soft heap, and hard heap, a meldable priority queue
Alka Bhushan
,
Sajith Gopalan
Lecture Notes in Computer Science
7434
, 2012, pp. 360-371
Online coloring of bipartite graphs with and without advice
Maria Paola Bianchi
,
Hans-Joachim Böckenhauer
,
Juraj Hromkovic̑
,
Lucia Keller
Lecture Notes in Computer Science
7434
, 2012, pp. 519-530
Complementary vertices and adjacency testing in polytopes
Benjamin A. Burton
Lecture Notes in Computer Science
7434
, 2012, pp. 507-518
Stretch in bottleneck games
Costas Busch
,
Rajgopal Kannan
Lecture Notes in Computer Science
7434
, 2012, pp. 592-603
Unexplored Steiner ratios in geometric networks
Paz Carmi
,
Lilach Chaitman-Yerushalmi
Lecture Notes in Computer Science
7434
, 2012, pp. 275-286
Rainbow colouring of split and threshold graphs
L. Sunil Chandran
,
Deepak Rajendraprasad
Lecture Notes in Computer Science
7434
, 2012, pp. 181-192
Lower bounds against weakly uniform circuits
Ruiwen Chen
,
Valentine Kabanets
Lecture Notes in Computer Science
7434
, 2012, pp. 408-419
Making profit in a prediction market
Jen-Hou Chou
,
Chi-Jen Lu
,
Mu-En Wu
Lecture Notes in Computer Science
7434
, 2012, pp. 556-567
Maximum number of minimal feedback vertex sets in chordal graphs and cographs
Jean-François Couturier
,
Pinar Heggernes
,
Pim van 't Hof
,
Yingve Villanger
Lecture Notes in Computer Science
7434
, 2012, pp. 133-144
On the advice complexity of tournaments
Sebastian Ben Daniel
Lecture Notes in Computer Science
7434
, 2012, pp. 470-481
Seiten 1
2
3
4
5
6
>