A Branch-and-Cut Approach to Physical Mapping of Chromosomes by Unique End-Probes ⬇️

artículo científico publicado el 1 de enero de 1997

A Graph–Theoretic Approach to Steganography

A Library of Algorithms for Graph Drawing

A Linear Time Implementation of SPQR-Trees

A branch-and-cut approach to the crossing number problem

A note on computing a maximal planar subgraph using PQ-trees

A polyhedral approach to sequence alignment problems

A polyhedral approach to the multi-layer crossing minimization problem

Advances in C-Planarity Testing of Clustered Graphs

Advances in Graph Drawing Special Issue on Selected Papers from the Ninth International Symposium on Graph Drawing, GD 2001: Guest Editors' Foreword

Algorithm Engineering im Graphenzeichnen

Algorithmen zum automatischen Zeichnen von Graphen

An Algorithmic Framework for the Exact Solution of the Prize-Collecting Steiner Tree Problem

An Alternative Method to Crossing Minimization on Hierarchical Graphs

An Experimental Comparison of Orthogonal Compaction Algorithms

scholarly article by Gunnar W Klau et al published 2001 in Lecture Notes in Computer Science

An Experimental Evaluation of Multilevel Layout Methods

An SPQR-Tree Approach to Decide Special Cases of Simultaneous Embedding with Fixed Edges

An alternative method to crossing minimization on hierarchical graphs

Approximating the Crossing Number of Apex Graphs

article published in 2009

Automatic Layout of UML Class Diagrams in Orthogonal Style

Bend Minimization in Planar Orthogonal Drawings Using Integer Programming

CHIPMUNK: A virtual synthesizable small molecule library for medicinal chemistry exploitable for protein-protein interaction modulators.

artículo científico publicado en 2018

CT-index: Fingerprint-based graph indexing combining cycles and trees

Classifying Dissemination Processes in Temporal Graphs

artículo científico publicado en 2020

Colored Simultaneous Geometric Embeddings and Universal Pointsets

Combining Graph Labeling and Compaction

article published in 1999

Compact Layered Drawings of General Directed Graphs

Computing Maximum C-Planar Subgraphs

Computing Optimal Embeddings for Planar Graphs

artículo científico publicado en 2000

Crossing Minimization and Layouts of Directed Hypergraphs with Port Constraints

Drawing Partially Embedded and Simultaneously Planar Graphs

Efficient Extraction of Multiple Kuratowski Subdivisions

Enumeration of Maximum Common Subtree Isomorphisms with Polynomial-Delay

Erratum: Corrigendum: Interactive exploration of chemical space with Scaffold Hunter

scholarly article published in Nature Chemical Biology

Exact Crossing Minimization

Exact ground states of Ising spin glasses: New experimental results with a branch-and-cut algorithm

Explicit Versus Implicit Graph Feature Maps: A Computational Phase Transition for Walk Kernels

Finding Largest Common Substructures of Molecules in Quadratic Time

Finding Maximum Common Biconnected Subgraphs in Series-Parallel Graphs

article published in 2014

Graph-Drawing Contest Report

Graph-Drawing Contest Report

Improved Steiner Tree Algorithms for Bounded Treewidth

scholarly article by Markus Chimani et al published 2011 in Lecture Notes in Computer Science

Improved Steiner tree algorithms for bounded treewidth

scholarly article by Markus Chimani et al published October 2012 in Journal of Discrete Algorithms

Inserting an Edge into a Planar Graph

Integrative visual analysis of the effects of alternative splicing on protein domain interaction networks.

artículo científico publicado en 2008

Interactive exploration of chemical space with Scaffold Hunter

artículo científico publicado en 2009

Layer-Free Upward Crossing Minimization

Level Planarity Testing in Linear Time

Maximum planar subgraphs and nice embeddings: Practical layout tools

More Compact Orthogonal Drawings by Allowing Additional Bends †

On Open Problems in Biological Network Visualization

scholarly article by Mario Albrecht et al published 2010 in Lecture Notes in Computer Science

On the Hardness and Approximability of Planar Biconnectivity Augmentation

On the Minimum Cut of Planarizations

On the embedding phase of the Hopcroft and Tarjan planarity testing algorithm

Optimal labeling of point features in rectangular labeling models

Orientation-based models for {0,1,2}-survivable network design: theory and practice

Output-Sensitive Algorithms for Enumerating the Extreme Nondominated Points of Multiobjective Combinatorial Optimization Problems

Parameterized Algorithms for Stochastic Steiner Tree Problems

scholarly article by Denis Kurz et al published 2013 in Lecture Notes in Computer Science

Pitfalls of using PQ-trees in automatic graph drawing

Planar Biconnectivity Augmentation with Fixed Embedding

Planar Polyline Drawings with Good Angular Resolution

Port Constraints in Hierarchical Layout of Data Flow Diagrams

Practical Experience with Hanani-Tutte for Testing c-Planarity

Practical SAHN Clustering for Very Large Data Sets and Expensive Distance Metrics

Protein complex similarity based on Weisfeiler-Lehman labeling

Protein complex similarity based on Weisfeiler-Lehman labeling

Recent Advances in Exact Crossing Minimization (Extended Abstract)

Retention time alignment algorithms for LC/MS data must consider non-linear shifts

artículo científico publicado en 2009

SAHN Clustering in Arbitrary Metric Spaces Using Heuristic Nearest Neighbor Search

SCOT: Rethinking the Classification of Secondary Structure Elements

artículo científico publicado en 2019

Scaffold Hunter – Interactive Exploration of Chemical Space

Scaffold Hunter: Facilitating Drug Discovery by Visual Analysis of Chemical Space

Scaffold Hunter: a comprehensive visual analytics framework for drug discovery.

artículo científico publicado en 2017

Scaffold hunter: visual analysis of biological activity data.

artículo científico publicado en 2014

Simple and Efficient Bilayer Cross Counting

Simple and Efficient Bilayer Cross Counting

article by Wilhelm Barth et al published 2002 in Lecture Notes in Computer Science

Solving Two-Stage Stochastic Steiner Tree Problems by Two-Stage Branch-and-Cut

Stochastic Survivable Network Design Problems

Stochastic survivable network design problems: Theory and practice

Strong Formulations for 2-Node-Connected Steiner Network Problems

The Constrained Crossing Minimization Problem

article by Petra Mutzel & Thomas Ziegler published 1999 in Lecture Notes in Computer Science

The Crossing Number of Graphs: Theory and Computation

The Landscape Metaphor for Visualization of Molecular Similarities

scholarly article by Martin Gronemann et al published 2014 in Communications in Computer and Information Science

The Maximum Weight Connected Subgraph Problem

The Rooted Maximum Node-Weight Connected Subgraph Problem

The Thickness of Graphs: A Survey

The polyhedral approach to the maximum planar subgraph problem: New chances for related problems

The thickness of a minor-excluded class of graphs

Upward Planarization Layout

Vertex insertion approximates the crossing number of apex graphs

Visual Analysis of Biological Activity Data with Scaffold Hunter

artículo científico publicado en 2013

Visualizing Domain Interaction Networks and the Impact of Alternative Splicing Events

scholarly article published July 2008

Weisfeiler and Leman go sparse: Towards scalable higher-order graph embeddings ⬇️