default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRené Weiskircher
Person information
- affiliation: Vienna University of Technology, Austria
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2011
[j6]Gaurav Singh
, René Weiskircher:
A multi-agent system for decentralised fractional shared resource constraint scheduling. Web Intell. Agent Syst. 9(2): 99-108 (2011)
2000 – 2009
- 2009
- [j5]René Weiskircher, Nectarios Kontoleon, Rodolfo García-Flores, Simon Dunstall:
Using agents for solving a multi-commodity-flow problem. Eur. J. Oper. Res. 194(3): 888-900 (2009) - [c21]Rodolfo García-Flores, René Weiskircher, Nectarios Kontoleon, Simon Dunstall:
An Agent-Based Framework for Assessing the Cost of Committal Search in Supply Networks. MABS 2009: 25-36 - 2008
- [j4]Christoph Buchheim, Markus Chimani, Dietmar Ebner, Carsten Gutwenger, Michael Jünger, Gunnar W. Klau, Petra Mutzel, René Weiskircher:
A branch-and-cut approach to the crossing number problem. Discret. Optim. 5(2): 373-388 (2008) - [c20]Andreas T. Ernst, Gaurav Singh, René Weiskircher:
Scheduling Meetings at Trade Events with Complex Preferences. ICAPS 2008: 76-82 - [c19]Gaurav Singh, René Weiskircher:
Collaborative Resource Constraint Scheduling with a Fractional Shared Resource. IAT 2008: 359-365 - 2006
- [j3]Ivana Ljubic, René Weiskircher, Ulrich Pferschy, Gunnar W. Klau, Petra Mutzel, Matteo Fischetti:
An Algorithmic Framework for the Exact Solution of the Prize-Collecting Steiner Tree Problem. Math. Program. 105(2-3): 427-449 (2006) - [j2]Petra Mutzel, René Weiskircher:
Bend Minimization in Planar Orthogonal Drawings Using Integer Programming. SIAM J. Optim. 17(3): 665-687 (2006) - [c18]Yakov Zinder, Gaurav Singh, René Weiskircher:
A New Method of Scheduling UET Tasks on Parallel Machines. IMECS 2006: 796-801 - 2005
- [j1]Carsten Gutwenger, Petra Mutzel, René Weiskircher:
Inserting an Edge into a Planar Graph. Algorithmica 41(4): 289-308 (2005) - [c17]Ivana Ljubic, René Weiskircher, Ulrich Pferschy, Gunnar W. Klau, Petra Mutzel, Matteo Fischetti:
Solving the Prize-Collecting Steiner Tree Problem to Optimality. ALENEX/ANALCO 2005: 68-76 - [c16]Christoph Buchheim, Dietmar Ebner, Michael Jünger, Gunnar W. Klau, Petra Mutzel, René Weiskircher:
Exact Crossing Minimization. GD 2005: 37-48 - [c15]Markus Chimani, Gunnar W. Klau, René Weiskircher:
Non-planar Orthogonal Drawings with Fixed Topology. SOFSEM 2005: 96-105 - 2004
- [c14]Gunnar W. Klau, René Weiskircher:
Robustness and Resilience. Network Analysis 2004: 417-437 - [c13]Dietmar Ebner, Gunnar W. Klau, René Weiskircher:
Label Number Maximization in the Slider Model. GD 2004: 144-154 - [c12]Gunnar W. Klau, Ivana Ljubic, Andreas Moser, Petra Mutzel, Philipp Neuner, Ulrich Pferschy, Günther R. Raidl, René Weiskircher:
Combining a Memetic Algorithm with Integer Programming to Solve the Prize-Collecting Steiner Tree Problem. GECCO (1) 2004: 1304-1315 - [p2]Michael Jünger, Gunnar W. Klau, Petra Mutzel, René Weiskircher:
AGD - A Library of Algorithms for Graph Drawing. Graph Drawing Software 2004: 149-172 - 2003
- [c11]Gunnar W. Klau, Ivana Ljubic, Petra Mutzel, Ulrich Pferschy, René Weiskircher:
The Fractional Prize-Collecting Steiner Tree Problem on Trees: Extended Abstract. ESA 2003: 691-702 - [c10]Carsten Gutwenger, Michael Jünger, Sebastian Leipert, Petra Mutzel, Merijam Percan, René Weiskircher:
Subgraph Induced Planar Connectivity Augmentation: (Extended Abstract). WG 2003: 261-272 - 2002
- [b1]René Weiskircher:
New applications of SPQR-trees in graph drawing. Saarland University, Saarbrücken, Germany, 2002, pp. I-VI, 1-172 - [c9]Petra Mutzel, René Weiskircher:
Bend Minimization in Orthogonal Drawings Using Integer Programming. COCOON 2002: 484-493 - [c8]Carsten Gutwenger, Michael Jünger, Sebastian Leipert, Petra Mutzel, Merijam Percan, René Weiskircher:
Advances in C-Planarity Testing of Clustered Graphs. GD 2002: 220-235 - [p1]René Weiskircher:
Neue Anwendungen von SPQR-Bäumen im Graphenzeichnen. Ausgezeichnete Informatikdissertationen 2002: 201-210 - 2001
- [c7]Carsten Gutwenger, Michael Jünger, Gunnar W. Klau, Sebastian Leipert, Petra Mutzel, René Weiskircher:
AGD: A Library of Algorithms for Graph Drawing. GD 2001: 473-474 - [c6]Carsten Gutwenger, Petra Mutzel, René Weiskircher:
Inserting an edge into a planar graph. SODA 2001: 246-255 - 2000
- [c5]Petra Mutzel, René Weiskircher:
Computing Optimal Embeddings for Planar Graphs. COCOON 2000: 95-104
1990 – 1999
- 1999
- [c4]René Weiskircher:
Drawing Planar Graphs. Drawing Graphs 1999: 23-45 - [c3]Petra Mutzel, René Weiskircher:
Optimieren über alle kombinatorischen Einbettungen eines planaren Graphen. GI Jahrestagung 1999: 199-206 - [c2]Petra Mutzel, René Weiskircher:
Optimizing over All Combinatorial Embeddings of a Planar Graph. IPCO 1999: 361-376 - 1998
- [c1]Petra Mutzel, René Weiskircher:
Two-Layer Planarization in Graph Drawing. ISAAC 1998: 69-78
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:09 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
