Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Daniel Fleischer
2000 – 2009
- 2009
[j3]Ulrik Brandes, Daniel Fleischer: Vertex Bisection is Hard, too. J. Graph Algorithms Appl. 13(2): 119-131 (2009)- 2007
[b1]Daniel Fleischer: Theory and applications of the Laplacian. Universität Konstanz 2007, pp. 1-180
[j2]Ulrik Brandes, Daniel Fleischer, Thomas Puppe: Dynamic Spectral Layout with an Application to Small Worlds. J. Graph Algorithms Appl. 11(2): 325-343 (2007)
[c5]Daniel Fleischer, Christian Pich: Positioning. Algorithms for Sensor and Ad Hoc Networks 2007: 283-304
[c4]- 2006
[j1]Ulrik Brandes, Daniel Fleischer, Jürgen Lerner: Summarizing Dynamic Bipolar Conflict Structures. IEEE Trans. Vis. Comput. Graph. 12(6): 1486-1499 (2006)- 2005
[c3]Ulrik Brandes, Daniel Fleischer, Thomas Puppe: Dynamic Spectral Layout of Small Worlds. Graph Drawing 2005: 25-36
[c2]Ulrik Brandes, Daniel Fleischer, Jürgen Lerner: Highlighting Conflict Dynamics in Event Data. INFOVIS 2005: 14
[c1]
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2012-09-10 15:51 CEST by the dblp team



