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="Eades, Peter"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
2-layer right angle crossing drawings
Emilio Dib Giacomo
,
Walter Didimo
,
Peter Eades
,
Giuseppe Liotta
Algorithmica
68
(4), 2014, pp. 954-997
Order-preserving matching
Jinil Kim
,
Peter Eades
,
Rudolf Fleischer
,
Seok-Hee Hong
,
Costas S. Iliopoulos
,
Kunsoo Park
,
Simon J. Puglisi
,
Takeshi Tokuyama
Theoretical Computer Science
525
, 2014, pp. 68-79
GION: Interactively untangling large graphs on wall-sized displays
Michael R. Marner
,
Ross T. Smith
,
Bruce H. Thomas
,
Karsten Klein
,
Peter Eades
,
Seok-Hee Hong
Lecture Notes in Computer Science
8871
, 2014, pp. 113-124
Testing maximal 1-planarity of graphs with a rotation system in linear time
Peter Eades
,
Seok-Hee Hong
,
Naoki Katoh
,
Giuseppe Liotta
,
Pascal Schweitzer
,
Yusuke Suzuki
Lecture Notes in Computer Science
7704
, 2013, pp. 339-345
A linear time algorithm for testing maximal 1-planarity of graphs with a rotation system
Peter Eades
,
Seok-Hee Hong
,
Naoki Katoh
,
Giuseppe Liotta
,
Pascal Schweitzer
,
Yusuke Suzuki
Theoretical Computer Science
513
, 2013, pp. 65-76
A linear-time algorithm for testing outer-1-planarity
Seok-Hee Hong
,
Peter Eades
,
Naoki Katoh
,
Giuseppe Liotta
,
Pascal Schweitzer
,
Yusuke Suzuki
Lecture Notes in Computer Science
8242
, 2013, pp. 71-82
StreamEB: Stream edge bundling
Quan Nguyen
,
Peter Eades
,
Seok-Hee Hong
Lecture Notes in Computer Science
7704
, 2013, pp. 400-413
On the faithfulness of graph visualizations
Quan Nguyen
,
Peter Eades
,
Seok-Hee Hong
Lecture Notes in Computer Science
7704
, 2013, pp. 566-568
Right angle crossing graphs and 1-planarity
Peter Eades
,
Giuseppe Liotta
Lecture Notes in Computer Science
7034
, 2012, pp. 148-153
Fáry's theorem for 1-planar graphs
Seok-Hee Hong
,
Peter Eades
,
Giuseppe Liotta
,
Sheung-Hung Poon
Lecture Notes in Computer Science
7434
, 2012, pp. 335-346
TGI-EB: A new framework for edge bundling integrating topology, geometry and importance
Quan Nguyen
,
Seok-Hee Hong
,
Peter Eades
Lecture Notes in Computer Science
7034
, 2012, pp. 123-135
Drawing graphs with right angle crossings
Walter Didimo
,
Peter Eades
,
Giuseppe Liotta
Theoretical Computer Science
412
(39), 2011, pp. 5156-5166
Large crossing angles in circular layouts
Quan Nguyen
,
Peter Eades
,
Seok-Hee Hong
,
Weidong Huang
Lecture Notes in Computer Science
6502
, 2011, pp. 397-399
A characterization of complete bipartite RAC graphs
Walter Didimo
,
Peter Eades
,
Giuseppe Liotta
Information Processing Letters
110
(16), 2010, pp. 687-691
On rectilinear drawing of graphs
Peter Eades
,
Seok-Hee Hong
,
Sheung-Hung Poon
Lecture Notes in Computer Science
5849
, 2010, pp. 232-243
Drawing graphs with right angle crossings
Walter Didimo
,
Peter Eades
,
Giuseppe Liotta
Lecture Notes in Computer Science
5664
, 2009, pp. 206-217
Some constrained notions of planarity
Peter Eades
Lecture Notes in Computer Science
5369
, 2008, pp. 2-2
Straight-line drawing algorithms for hierarchical graphs and clustered graphs
Peter Eades
,
Qingwen Feng
,
Xuemin Lin
,
Hiroshi Nagamochi
Algorithmica
44
(1), 2006, pp. 1-32
Drawing planar graphs symmetrically, III: Oneconnected planar graphs
Seok-Hee Hong
,
Peter Eades
Algorithmica
44
(1), 2006, pp. 67-100
Layout effects on sociogram perception
Weidong Huang
,
Seok-Hee Hong
,
Peter Eades
Lecture Notes in Computer Science
3843
, 2006, pp. 262-273
Drawing planar graphs symmetrically, II: Biconnected planar graphs
Seok-Hee Hong
,
Peter Eades
Algorithmica
42
(2), 2005, pp. 159-197
Graph drawing contest report
Franz J. Brandenburg
,
Ulrik Brandes
,
Peter Eades
,
Joe Marks
Lecture Notes in Computer Science
2912
, 2004, pp. 504-508
A linear time algorithm for constructing maximally symmetric straight-line drawings of planar graphs
Seok-Hee Hong
,
Peter Eades
Lecture Notes in Computer Science
3383
, 2004, pp. 307-317
HexGraph: Applying graph drawing algorithms to the game of hex
Colin Murray
,
Carsten Friedrich
,
Peter Eades
Lecture Notes in Computer Science
2912
, 2004, pp. 494-495
Skewness of graphs with small cutsets
Graham Farr
,
Peter Eades
Graphs and Combinatorics
19
(2), 2003, pp. 177-194
Seiten 1
2
3
4
5
6
7
8
9
10
>