René Weiskircher

According to our database1, René Weiskircher authored at least 29 papers between 1998 and 2011.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2011
A multi-agent system for decentralised fractional shared resource constraint scheduling.
Web Intelligence and Agent Systems, 2011

2009
Using agents for solving a multi-commodity-flow problem.
European Journal of Operational Research, 2009

An Agent-Based Framework for Assessing the Cost of Committal Search in Supply Networks.
Proceedings of the Multi-Agent-Based Simulation X, International Workshop, 2009

2008
A branch-and-cut approach to the crossing number problem.
Discrete Optimization, 2008

Collaborative Resource Constraint Scheduling with a Fractional Shared Resource.
Proceedings of the 2008 IEEE/WIC/ACM International Conference on Intelligent Agent Technology, 2008

Scheduling Meetings at Trade Events with Complex Preferences.
Proceedings of the Eighteenth International Conference on Automated Planning and Scheduling, 2008

2006
Bend Minimization in Planar Orthogonal Drawings Using Integer Programming.
SIAM Journal on Optimization, 2006

An Algorithmic Framework for the Exact Solution of the Prize-Collecting Steiner Tree Problem.
Math. Program., 2006

A New Method of Scheduling UET Tasks on Parallel Machines.
Proceedings of the International MultiConference of Engineers and Computer Scientists 2006, 2006

2005
Inserting an Edge into a Planar Graph.
Algorithmica, 2005

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

Exact Crossing Minimization.
Proceedings of the Graph Drawing, 13th International Symposium, 2005

Solving the Prize-Collecting Steiner Tree Problem to Optimality.
Proceedings of the Seventh Workshop on Algorithm Engineering and Experiments and the Second Workshop on Analytic Algorithmics and Combinatorics, 2005

2004
Combining a Memetic Algorithm with Integer Programming to Solve the Prize-Collecting Steiner Tree Problem.
Proceedings of the Genetic and Evolutionary Computation, 2004

Label Number Maximization in the Slider Model.
Proceedings of the Graph Drawing, 12th International Symposium, 2004

Robustness and Resilience.
Proceedings of the Network Analysis: Methodological Foundations [outcome of a Dagstuhl seminar, 2004

AGD - A Library of Algorithms for Graph Drawing.
Proceedings of the Graph Drawing Software, 2004

2003
Subgraph Induced Planar Connectivity Augmentation: (Extended Abstract).
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2003

The Fractional Prize-Collecting Steiner Tree Problem on Trees: Extended Abstract.
Proceedings of the Algorithms, 2003

2002
Neue Anwendung von SPQR-Bäumen im Graphenzeichnen.
Proceedings of the Ausgezeichnete Informatikdissertationen 2002, 2002

Advances in C-Planarity Testing of Clustered Graphs.
Proceedings of the Graph Drawing, 10th International Symposium, 2002

Bend Minimization in Orthogonal Drawings Using Integer Programming.
Proceedings of the Computing and Combinatorics, 8th Annual International Conference, 2002

New applications of SPQR-trees in graph drawing.
PhD thesis, 2002

2001
AGD: A Library of Algorithms for Graph Drawing.
Proceedings of the Graph Drawing, 9th International Symposium, 2001

2000
Computing Optimal Embeddings for Planar Graphs.
Proceedings of the Computing and Combinatorics, 6th Annual International Conference, 2000

1999
Optimizing over All Combinatorial Embeddings of a Planar Graph.
Proceedings of the Integer Programming and Combinatorial Optimization, 1999

Optimieren über alle kombinatorischen Einbettungen eines planaren Graphen.
Proceedings of the Informatik '99, 1999

Drawing Planar Graphs.
Proceedings of the Drawing Graphs, 1999

1998
Two-Layer Planarization in Graph Drawing.
Proceedings of the Algorithms and Computation, 9th International Symposium, 1998


  Loading...