Rebuilding KEGG Maps: Algorithms and Benefits. | 0 | 0.34 | 2014 |
Boundary Labeling Methods for Dynamic Focus Regions. | 2 | 0.37 | 2014 |
Bend-optimal orthogonal graph drawing in the general position model | 5 | 0.42 | 2014 |
Linear-time algorithms for hole-free rectilinear proportional contact graph representations | 7 | 0.48 | 2013 |
NetworkTrail--a web service for identifying and visualizing deregulated subnetworks. | 4 | 0.42 | 2013 |
Planar packing of binary trees | 1 | 0.38 | 2013 |
On upward point set embeddability | 2 | 0.38 | 2013 |
Mad at edge crossings? break the edges! | 7 | 0.57 | 2012 |
On a tree and a path with no geometric simultaneous embedding | 9 | 0.65 | 2012 |
miRTrail--a comprehensive webserver for analyzing gene and miRNA patterns to enhance the understanding of regulatory mechanisms in diseases. | 9 | 0.54 | 2012 |
Upward point-set embeddability | 8 | 0.69 | 2011 |
On the area requirements of Euclidean minimum spanning trees | 4 | 0.41 | 2011 |
Small point sets for simply-nested planar graphs | 4 | 0.44 | 2011 |
On the perspectives opened by right angle crossing drawings | 30 | 1.47 | 2011 |
Approximating Minimum Manhattan Networks in Higher Dimensions | 2 | 0.41 | 2011 |
Proportional contact representations of planar graphs | 6 | 0.47 | 2011 |
Beyond unit propagation in SAT solving | 2 | 0.36 | 2011 |
Polynomial area bounds for MST embeddings of trees | 6 | 0.44 | 2011 |
Upward geometric graph embeddings into point sets | 8 | 0.65 | 2010 |
Visuelle Analytik biologischer Daten. | 0 | 0.34 | 2010 |
Visualizing differences between two large graphs | 1 | 0.39 | 2010 |
Modeling and Designing Real---World Networks | 2 | 0.37 | 2009 |
Constrained simultaneous and near-simultaneous embeddings | 10 | 0.70 | 2009 |
Planar packing of trees and spider trees | 6 | 0.55 | 2009 |
On Map Labeling with Leaders | 6 | 0.57 | 2009 |
A novel algorithm for detecting differentially regulated paths based on gene set enrichment analysis. | 18 | 0.87 | 2009 |
GeneTrailExpress: a web-based pipeline for the statistical evaluation of microarray experiments. | 34 | 0.73 | 2008 |
BNDB - the Biochemical Network Database. | 32 | 2.61 | 2007 |
Packing and squeezing subgraphs into planar graphs | 0 | 0.34 | 2007 |
Polynomial area bounds for MST embeddings of trees | 6 | 0.46 | 2007 |
Bn++ - A Biological Information System | 18 | 1.20 | 2006 |
Orthogonal graph drawing with constraints | 11 | 0.75 | 2000 |
Faster Approximation Algorithms for the Rectilinear Steiner Tree Problem | 7 | 0.91 | 1997 |
Area-Efficient Static and Incremental Graph Drawings | 38 | 1.58 | 1997 |
Routing on Meshes with Buses | 6 | 0.49 | 1997 |
On Triangulating Planar Graphs under the Four-Connectivity Constraint | 22 | 1.21 | 1994 |
Derandomizing algorithms for routing and sorting on meshes | 28 | 1.52 | 1994 |