Markus Chimani

According to our database1, Markus Chimani authored at least 92 papers between 2005 and 2021.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2021
Failure Resiliency With Only a Few Tunnels - Enabling Segment Routing for Traffic Engineering.
IEEE/ACM Trans. Netw., 2021

2020
Maximum Cut Parameterized by Crossing Number.
J. Graph Algorithms Appl., 2020

Toroidal grid minors and stretch in embedded graphs.
J. Comb. Theory, Ser. B, 2020

On the Bond Polytope.
CoRR, 2020

Approximating Multistage Matching Problems.
CoRR, 2020

Crossing Number for Graphs with Bounded Pathwidth.
Algorithmica, 2020

An Experimental Study of ILP Formulations for the Longest Induced Path Problem.
Proceedings of the Combinatorial Optimization - 6th International Symposium, 2020

A Simple Primal-Dual Approximation Algorithm for 2-Edge-Connected Spanning Subgraphs.
Proceedings of the Computing and Combinatorics - 26th International Conference, 2020

Approximating Multiobjective Shortest Path in Practice.
Proceedings of the Symposium on Algorithm Engineering and Experiments, 2020

2019
Exact Algorithms for the Maximum Planar Subgraph Problem: New Models and Experiments.
ACM J. Exp. Algorithmics, 2019

Strong Steiner Tree Approximations in Practice.
ACM J. Exp. Algorithmics, 2019

Advances on Testing C-Planarity of Embedded Flat Clustered Graphs.
Int. J. Found. Comput. Sci., 2019

Cut Polytopes of Minor-free Graphs.
CoRR, 2019

Failure Resilient Traffic Engineering Using Segment Routing.
Proceedings of the 44th IEEE Conference on Local Computer Networks, 2019

Computing Stable Demers Cartograms.
Proceedings of the Graph Drawing and Network Visualization - 27th International Symposium, 2019

Crossing Numbers of Beyond-Planar Graphs.
Proceedings of the Graph Drawing and Network Visualization - 27th International Symposium, 2019

Stronger ILPs for the Graph Genus Problem.
Proceedings of the 27th Annual European Symposium on Algorithms, 2019

2018
Traffic Engineering Using Segment Routing and Considering Requirements of a Carrier IP Network.
IEEE/ACM Trans. Netw., 2018

On the Maximum Crossing Number.
J. Graph Algorithms Appl., 2018

On the Practical Irrelevance of Metrics on Segment Routing Traffic Engineering optimization.
Proceedings of the 43rd IEEE Conference on Local Computer Networks, 2018

Crossing Numbers and Stress of Random Graphs.
Proceedings of the Graph Drawing and Network Visualization - 26th International Symposium, 2018

Cycles to the Rescue! Novel Constraints to Compute Maximum Planar Subgraphs Fast.
Proceedings of the 26th Annual European Symposium on Algorithms, 2018

2017
Algorithms and Characterizations for 2-Layer Fan-planarity: From Caterpillar to Stegosaurus.
J. Graph Algorithms Appl., 2017

A tighter insertion-based approximation of the crossing number.
J. Comb. Optim., 2017

Predictive Traffic Engineering with 2-Segment Routing Considering Requirements of a Carrier IP Network.
Proceedings of the 42nd IEEE Conference on Local Computer Networks, 2017

Planar L-Drawings of Directed Graphs.
Proceedings of the Graph Drawing and Network Visualization - 25th International Symposium, 2017

2016
Planarisation and Crossing Minimisation.
Encyclopedia of Algorithms, 2016

A Practical Method for the Minimum Genus of a Graph: Models and Experiments.
Proceedings of the Experimental Algorithms - 15th International Symposium, 2016

Limits of Greedy Approximation Algorithms for the Maximum Planar Subgraph Problem.
Proceedings of the Combinatorial Algorithms - 27th International Workshop, 2016

A Note on the Practicality of Maximal Planar Subgraph Algorithms.
Proceedings of the Graph Drawing and Network Visualization, 2016

Placing Arrows in Directed Graph Drawings.
Proceedings of the Graph Drawing and Network Visualization, 2016

An ILP-based Proof System for the Crossing Number Problem.
Proceedings of the 24th Annual European Symposium on Algorithms, 2016

Inserting Multiple Edges into a Planar Graph.
Proceedings of the 32nd International Symposium on Computational Geometry, 2016

2015
Approximating Spanning Trees with Few Branches.
Theory Comput. Syst., 2015

Hypergraph and Minor Crossing Number Problems.
J. Graph Algorithms Appl., 2015

Upward Planarity Testing in Practice: SAT Formulations and Comparative Study.
ACM J. Exp. Algorithmics, 2015

Network Design Problems with Bounded Distances via Shallow-Light Steiner Trees.
Proceedings of the 32nd International Symposium on Theoretical Aspects of Computer Science, 2015

2-Layer Fan-Planarity: From Caterpillar to Stegosaurus.
Proceedings of the Graph Drawing and Network Visualization - 23rd International Symposium, 2015

Speedy Colorful Subtrees.
Proceedings of the Computing and Combinatorics - 21st International Conference, 2015

The Influence of Preprocessing on Steiner Tree Approximations.
Proceedings of the Combinatorial Optimization and Applications, 2015

2014
Computing the Stretch of an Embedded Graph.
SIAM J. Discret. Math., 2014

Steiner Tree 1.39-Approximation in Practice.
Proceedings of the Mathematical and Engineering Methods in Computer Science, 2014

How to eat a graph: computing selection sequences for the continuous generalization of road networks.
Proceedings of the 22nd ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems, 2014

An Exact Approach to Upward Crossing Minimization.
Proceedings of the 2014 Proceedings of the Sixteenth Workshop on Algorithm Engineering and Experiments, 2014

2013
The Open Graph Drawing Framework (OGDF).
Proceedings of the Handbook on Graph Drawing and Visualization., 2013

Crossings and Planarization.
Proceedings of the Handbook on Graph Drawing and Visualization., 2013

Multi-level Verticality Optimization: Concept, Strategies, and Drawing Scheme.
J. Graph Algorithms Appl., 2013

Exact Approaches to Multilevel Vertical Orderings.
INFORMS J. Comput., 2013

2-InterConnected Facility Location: Specification, Complexity, and Exact Solutions.
Electron. Notes Discret. Math., 2013

Crossing number additivity over edge cuts.
Eur. J. Comb., 2013

How not to characterize planar-emulable graphs.
Adv. Appl. Math., 2013

Upward Planarity Testing: A Computational Study.
Proceedings of the Graph Drawing - 21st International Symposium, 2013

2012
Advances in the Planarization Method: Effective Multiple Edge Insertions.
J. Graph Algorithms Appl., 2012

Improved Steiner tree algorithms for bounded treewidth.
J. Discrete Algorithms, 2012

Vertex insertion approximates the crossing number of apex graphs.
Eur. J. Comb., 2012

Fast alignment of fragmentation trees.
Bioinform., 2012

Upward Planarity Testing via SAT.
Proceedings of the Graph Drawing - 20th International Symposium, 2012

Shrinking the Search Space for Clustered Planarity.
Proceedings of the Graph Drawing - 20th International Symposium, 2012

2011
Facets in the Crossing Number Polytope.
SIAM J. Discret. Math., 2011

Upward Planarization Layout.
J. Graph Algorithms Appl., 2011

An SDP approach to multi-level crossing minimization.
ACM J. Exp. Algorithmics, 2011

Contraction-Based Steiner Tree Approximations in Practice.
Proceedings of the Algorithms and Computation - 22nd International Symposium, 2011

A Closer Look at the Closest String and Closest Substring Problem.
Proceedings of the Thirteenth Workshop on Algorithm Engineering and Experiments, 2011

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

Layer-free upward crossing minimization.
ACM J. Exp. Algorithmics, 2010

Approximating the Crossing Number of Graphs Embeddable in Any Orientable Surface.
Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, 2010

Solving Two-Stage Stochastic Steiner Tree Problems by Two-Stage Branch-and-Cut.
Proceedings of the Algorithms and Computation - 21st International Symposium, 2010

Crossing Minimization and Layouts of Directed Hypergraphs with Port Constraints.
Proceedings of the Graph Drawing - 18th International Symposium, GD 2010, Konstanz, 2010

Exact ILP solutions for phylogenetic minimum flip problems.
Proceedings of the First ACM International Conference on Bioinformatics and Computational Biology, 2010

Algorithm Engineering: Concepts and Practice.
Proceedings of the Experimental Methods for the Analysis of Optimization Algorithms., 2010

2009
Obtaining optimal <i>k</i>-cardinality trees fast.
ACM J. Exp. Algorithmics, 2009

Experiments on exact crossing minimization using column generation.
ACM J. Exp. Algorithmics, 2009

Non-planar core reduction of graphs.
Discret. Math., 2009

Inserting a vertex into a planar graph.
Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2009

2008
A branch-and-cut approach to the crossing number problem.
Discret. Optim., 2008

Computing Crossing Numbers.
Proceedings of the Ausgezeichnete Informatikdissertationen 2008, 2008

Approximating the Crossing Number of Apex Graphs.
Proceedings of the Graph Drawing, 16th International Symposium, GD 2008, Heraklion, Crete, 2008

Computing Maximum C-Planar Subgraphs.
Proceedings of the Graph Drawing, 16th International Symposium, GD 2008, Heraklion, Crete, 2008

A New Approach to Exact Crossing Minimization.
Proceedings of the Algorithms, 2008

Strong Formulations for 2-Node-Connected Steiner Network Problems.
Proceedings of the Combinatorial Optimization and Applications, 2008

Crossing Minimization meets Simultaneous Drawing.
Proceedings of the IEEE VGTC Pacific Visualization Symposium 2008, 2008

Obtaining Optimal k-Cardinality Trees Fast.
Proceedings of the Tenth Workshop on Algorithm Engineering and Experiments, 2008

2007
On the Minimum Cut of Planarizations.
Electron. Notes Discret. Math., 2007

Algorithms for the Hypergraph and the Minor Crossing Number Problems.
Proceedings of the Algorithms and Computation, 18th International Symposium, 2007

Hybrid Numerical Optimization for Combinatorial Network Problems.
Proceedings of the Hybrid Metaheuristics, 4th International Workshop, 2007

Efficient Extraction of Multiple Kuratowski Subdivisions.
Proceedings of the Graph Drawing, 15th International Symposium, 2007

A New ILP Formulation for 2-Root-Connected Prize-Collecting Steiner Networks.
Proceedings of the Algorithms, 2007

2006
DiamondHelp: a new interaction design for networked home appliances.
Pers. Ubiquitous Comput., 2006

2005
Non-planar Orthogonal Drawings with Fixed Topology.
Proceedings of the SOFSEM 2005: Theory and Practice of Computer Science, 2005

DiamondHelp: A Collaborative Interface Framework for Networked Home Appliances.
Proceedings of the 25th International Conference on Distributed Computing Systems Workshops (ICDCS 2005 Workshops), 2005

A Case Study in Large-Scale Interactive Optimization.
Proceedings of the IASTED International Conference on Artificial Intelligence and Applications, 2005

DiamondHelp: A Collaborative Task Guidance Framework for Complex Devices.
Proceedings of the Proceedings, 2005


  Loading...