Publications

Manuel Sorge (2026). Tractability via Low Dimensionality: The Parameterized Complexity of Training Quantized Neural Networks.

Cite Project Project

Enrico Iurlano, Günther Raidl, Djukanović, Marko (2026). The Graph Burning Problem under Constrained Diffusion.

Weissenfels, Alexander, Enrico Iurlano, Günther Raidl (2026). Superstrings of Uniform-Cardinality Set Systems via the Generalized Traveling Salesperson Problem.

Robert Ganian (2026). Routing Few Robots in a Crowded Network.

Cite Project Project Project

Stefan Szeider (2026). OBDDs, SDDs, and Circuits of Bounded Width: Completeness Matters.

PDF Cite Project Project Project DOI

Dobler, Alexander, Le Thanh, Son, Martin Nöllenburg, Weinkauf, Tino (2026). Minimizing Visual Clutter in Temporal Treemaps to Enable Comparison of Evolving Hierarchies.

Phuc Hung Hoang (2026). Matrix Editing Meets Fair Clustering: Parameterized Algorithms and Complexity.

Cite Project Project

Robert Ganian (2026). Makespan Minimization in Split Learning: From Theory to Practice.

Cite Project Project

Markus Kirchweger, Tomas Peitl, David Seka, Stefan Szeider (2026). Graph Choosability via SAT: Beyond the Nullstellensatz.

Cite Project Project

Bhore, Sujoy, Martin Nöllenburg, Tóth, Csaba D., Wulms, Jules (2026). Fully Dynamic Maximum Independent Sets of Disks in Polylogarithmic Update Time.

Robert Ganian (2026). From Data Completion to Problems on Hypercubes: A Parameterized Analysis of the Independent Set Problem.

PDF Cite Project Project Project DOI

Johannes Blaha, Robert Ganian, Katharina Gillig, Jonathan Højlev, Simon Wietheger (2026). Fair Correlation Clustering Meets Graph Parameters.

Cite Project Project

Jan Niclas Dreier, Jakub Gajarský, Michał Pilipczuk (2026). Efficient reversal of transductions of sparse graph classes.

Robert Ganian, Mathis Teva Rocton (2026). Computing Twin-Width via Treedepth and Vertex Integrity.

Ordyniak, Sebastian, Rychlicki, Mateusz, Stefan Szeider (2026). Computing Probabilistic Explanations for ML Models: Fixed-Parameter Algorithms.

Cite Project Project

Enrico Iurlano, Günther Raidl (2026). Complexity of Positive Influence Domination on Partial Grids.

Wallinger, Markus, Bonerath, Annika, Terziadis, Soeren, Wulms, Jules, Martin Nöllenburg (2026). Clarity and Computational Efficiency of Orbital Boundary Labeling.

Dobler, Alexander, Martin Nöllenburg (2026). Block Crossings in One-Sided Tanglegrams.

Cite Project DOI

Stefan Szeider (2026). Backdoors to Satisfaction Continued.

PDF Cite Project DOI

Robert Ganian (2026). A Structural Complexity Analysis of Synchronous Dynamical Systems.

Cite Project Project

Ajaykrishnan E S, Robert Ganian, Daniel Lokshtanov, Vaishali Surianarayanan (2026). A Quasi-Polynomial Time Algorithm for 3-Coloring Circle Graphs (Best Paper Award).

Cite Project Project Project

Phuc Hung Hoang (2026). A Parameterized-Complexity Framework for Finding Local Optima.

Cite Project Project

Stefan Szeider (2026). A General Theoretical Framework for Learning Smallest Interpretable Models.

PDF Cite Project Project Project DOI

Wustinger, Martin, Enrico Iurlano, Günther Raidl (2026). A Denoising Diffusion Adaptive Search for the Alpha-Domination Problem on Social Graphs.

Piselli, Tommaso, Liotta, Giuseppe, Montecchiani, Fabrizio, Martin Nöllenburg, Sara Di Bartolomeo (2026). $F^2$Stories: A Modular Framework for Multi-Objective Optimization of Storylines with a Focus on Fairness.

PDF Cite Project DOI

Jan Niclas Dreier, Robert Ganian, Hamm, Thekla (2025). Approximate Evaluation of Quantitative Second Order Queries.

Jonas Kompauer (2025). Optimizing Elevator Control with a Destination Registration System.

Joan Salva Soler (2025). Denoising Diffusion-Based Evolutionary Algorithms -- Exploring Hybridizations of Evolutionary Algorithms with Denoising Diffusion Models.

Chiu, Alvin, Thomas Depian, Eppstein, David, Goodrich, Michael T., Martin Nöllenburg (2025). Visualizing Treewidth.

Cite Project DOI

Stefan Szeider (2025). Uncovering and Verifying Optimal Community Structure in Complex Networks: A MaxSAT Approach.

PDF Cite Project Project DOI

Thomas Depian, Li, Guangping, Martin Nöllenburg, Wulms, Jules (2025). Transitions in Dynamic Point Labeling.

Cite Project Project Project DOI

Mathis Teva Rocton (2025). Training One-Dimensional Graph Neural Networks is NP-Hard.

PDF Cite Project

Thomas Depian, Simon Dominik Fink, Robert Ganian, Martin Nöllenburg (2025). The Peculiarities of Extending Queue Layouts.

Cite Project Project

Liana Khazaliya (2025). The Computational Complexity of Positive Non-Clashing Teaching in Graphs.

PDF Cite Project

Robert Ganian (2025). The complexity of optimizing atomic congestion.

PDF Cite Project DOI

Robert Ganian (2025). The Complexity of Extending Fair Allocations of Indivisible Goods.

PDF Cite Project DOI

Alexander Firbas, Alexander Dobler, Fabian Holzer, Jakob Schafellner, Manuel Sorge, Anaïs Villedieu, Monika Wißmann (2025). The complexity of cluster vertex splitting and company.

Cite Project DOI

Stefan Szeider (2025). The 3-Decomposition Conjecture: A SAT-Based Approach with Specialized Propagators.

PDF Cite Project Project DOI

Enrico Iurlano, Johannes Varga, Günther Raidl (2025). Tackling the Alpha-Domination Problem Heuristically.

Thomas Depian, Simon Dominik Fink, Alexander Firbas, Robert Ganian, Matthias Pfretzschner, Ignaz Rutter (2025). Structural Parameterizations of Simultaneous Planarity.

Cite Project Project Project

Florentina Voboril, Peruvemba Ramaswamy, Vaidyanathan, Stefan Szeider (2025). StreamLLM: Enhancing Constraint Programming with Large Language Model-Generated Streamliners.

PDF Cite Project Project Project DOI

Enrico Iurlano, Günther Raidl (2025). SAT-Based Search for Minwise Independent Families.

Stefan Szeider (2025). SAT Modulo Symmetries: A Survey.

PDF Cite Project Project

Dobler, Alexander, Kobourov, Stephen G., Mondal, Debajyoti, Martin Nöllenburg (2025). Representing Hypergraphs by Point-Line Incidences.

Cite Project DOI

Caroppo, Susanna, Da Lozzo, Giordano, Di Battista, Giuseppe, Goodrich, Michael, Martin Nöllenburg (2025). Quantum Speedups for Polynomial-Time Dynamic Programming Algorithms.

Fleischner, Herbert, Enrico Iurlano, Günther Raidl (2025). Putting Tutte's Counterexample to Tait's Conjecture in Perspective to Hamiltonicity and Non-Hamiltonicity in Certain Planar Cubic Graphs.

Martin Nöllenburg, Manuel Sorge, Terziadis, Soeren, Villedieu, Anaïs, Wu, Hsiang-Yun, Wulms, Jules (2025). Planarizing Graphs and their Drawings by Vertex Splitting.

Cite Project DOI

Alexander Firbas (2025). Pathways to Tractability for Geometric Thickness (Best Paper Award).

PDF Cite Project Project DOI

Thomas Depian, Simon Dominik Fink, Alexander Firbas, Robert Ganian, Martin Nöllenburg (2025). Pathways to Tractability for Geometric Thickness.

Cite Project DOI

Prabhakar, Archana, Grison, Elise, Morgagni, Simone, Martin Nöllenburg, Gyselinck, Valérie (2025). Passenger Decision-Making in Mass Transit Systems: Insights From Dual-Process Theories.

Thomas Depian, Simon Dominik Fink, Klemz, Boris, Robert Ganian, Martin Nöllenburg, Sieper, Marie Diana (2025). Partial Level Planarity Parameterized by the Size of the Missing Graph.

Robert Ganian (2025). Parameterized Complexity of Caching in Networks.

PDF Cite Project DOI

Robert Ganian (2025). Parameterized Complexity in Machine Learning.

Robert Ganian (2025). Parameterized Algorithms for Multiagent Pathfinding on Trees.

PDF Cite Project Project DOI

Dobler, Alexander, Hegemann, Tim, Martin Nöllenburg, Wolff, Alexander (2025). Optimizing Wiggle in Storylines.

Cite Project DOI

Sara Di Bartolomeo, Wallinger, Markus, Martin Nöllenburg (2025). Optimizing Staircase Motifs in Biofabric Network Layouts.

Cite Project DOI

Manuel Sorge (2025). Optimal Decision Tree Pruning Revisited: Algorithms and Complexity.

PDF Cite Project

Thomas Depian, Haase, Carolina, Martin Nöllenburg, Schulz, André (2025). On Planar Unit-Length Linear Linkages in Polygonal Domains.

Dobler, Alexander, Martin Nöllenburg (2025). On Minimizing Wiggle in Stacked Area Charts.

Cite Project DOI

Thomas Depian, Kern, Christoph, Röder, Sebastian, Terziadis, Soeren, Wallinger, Markus (2025). Network Navigation with Online Delays is PSPACE-complete.

Jan Niclas Dreier, Toruńczyk, Szymon (2025). Merge-Width and First-Order Model Checking.

Thomas Depian, Simon Dominik Fink, Robert Ganian, Vaishali Surianarayanan (2025). Linear Layouts Revisited: Stacks, Queues, and Exact Algorithms.

PDF Cite Project Project Project DOI

Maria Bresich, Günther Raidl, Limmer, Steffen (2025). Learning Value Functions for Same-Day Delivery Problems in the Tardiness Regime.

Huber, Marc, Günther Raidl, Blum, Christian (2025). Learning to Select Promising Initial Solutions for Large Neighborhood Search-Based Multi-Agent Path Finding.

Stefan Szeider (2025). Large and Parallel Human Sorting Networks.

Eades, Peter, Hong, Seok-Hee, Liotta, Giuseppe, Montecchiani, Fabrizio, Martin Nöllenburg, Piselli, Tommaso, Wismath, Stephen (2025). Introducing Fairness in Network Visualization.

Maria Bresich, Günther Raidl, Limmer, Steffen (2025). Improvements in Large Neighborhood Search for the Electric Autonomous Dial-A-Ride Problem.

Dobler, Alexander, Holzmüller, Maximilian, Martin Nöllenburg (2025). Geometry Matters in Planar Storyplans.

Cite Project DOI

Huang, William, Mei, Yi, Günther Raidl, Tianwei Zhang, Laurenz Tomandl, Limmer, Steffen, Rodemann, Tobias (2025). Genetic Programming Hyper-Heuristic for the Dynamic Electric Dial-a-Ride Problem.

Florentina Voboril, Vaidyanathan Peruvemba Ramaswamy, Stefan Szeider (2025). Generating Streamlining Constraints with Large Language Models.

Cite Project Project Project

Tommaso Piselli, Giuseppe Liotta, Fabrizio Montecchiani, Martin Nöllenburg, Sara Di Bartolomeo (2025). F2Stories: A Modular Framework for Multi-Objective Optimization of Storylines with a Focus on Fairness.

André Schidler, Stefan Szeider (2025). Extracting Problem Structure with LLMs for Optimized SAT Local Search.

PDF Cite Project Project

Liana Khazaliya (2025). Extending Orthogonal Planar Graph Drawings Is Fixed-Parameter Tractable.

Cite Project Project

Robert Ganian (2025). Crossing and Independent Families Among Polygons.

PDF Cite Project Project DOI

Thomas Depian, Martin Nöllenburg, Terziadis, Soeren, Wallinger, Markus (2025). Constrained Boundary Labeling.

Cite Project DOI

Jakub Balabán, Robert Ganian, Mathis Teva Rocton (2025). Computing Twin-Width Parameterized by the Feedback Edge Number and Vertex Integrity.

Cite Project Project

Wallinger, Markus, Piselli, Tommaso, Tappini, Alessandra, Archambault, Daniel, Liotta, Giuseppe, Martin Nöllenburg (2025). Bundling-Aware Graph Drawing Revisited.

Stefan Szeider (2025). Bridging Language Models and Symbolic Solvers via the Model Context Protocol.

PDF Cite Project Project DOI

Markus Kirchweger (2025). Breaking Symmetries in Quantified Graph Search: A Comparative Study.

PDF Cite Project Project DOI

Tomas Peitl (2025). Better Extension Variables in DQBF via Independence.

Florentina Voboril (2025). Balancing Latin Rectangles with LLM-Generated Streamliners.

PDF Cite Project Project DOI

Stefan Szeider (2025). Analyzing Reformulation Performance in Core-Guided MaxSAT Solving.

PDF Cite Project Project DOI

Ehlers, Henry, Brich, Nicolas, Jiehua Chen, Krone, Michael, Martin Nöllenburg, Natsukawa, Hiroaki, Hai Xia, Wu, Hsiang-Yun (2025). An Introduction to and Survey of Biological Network Visualization.

Maria Bresich, Günther Raidl, Steffen Limmer (2025). ACM Transactions on Evolutionary Learning and Optimization.

Robert Ganian (2025). A Structural Complexity Analysis of Hierarchical Task Network Planning.

PDF Cite Project Project DOI

Alexander Dobler (2025). A note on the complexity of one-sided crossing minimization of trees.

Cite Project DOI

Robert Ganian (2025). A Minor-Testing Approach for Coordinated Motion Planning with Sliding Robots.

PDF Cite Project Project DOI

Laurenz Tomandl, Jatschka, Thomas, Günther Raidl, Rodemann, Tobias (2025). A Learning Twolevel Optimization Approach for the Demand Maximizing Battery Swapping Station Location Problem.

Peter Neubauer (2024). Strength Estimation in the Game of Go.

Alexander Simunics (2024). Graph Neural Networks Meet Local Search for the Weighted Total Domination Problem.

Peter Neubauer (2024). An AlphaZero Agent for Just 4 Fun, a Non-Deterministic Game with Imperfect Information.

Martin Nöllenburg, Pirker, Christian, Rapberger, Anna, Woltran, Stefan, Wulms, Jules (2024). Visualizing Extensions of Argumentation Frameworks as Layered Graphs.

Mathis Teva Rocton (2024). Twin-Width Meets Feedback Edges and Vertex Integrity.

PDF Cite Project DOI

Ramaswamy, Vaidyanathan Peruvemba, Stefan Szeider, Hai Xia (2024). The Power of Collaboration: Learning Large Bayesian Networks at Scale.

Thomas Depian, Simon Dominik Fink, Robert Ganian, Martin Nöllenburg (2024). The Parameterized Complexity of Extending Stack Layouts.

PDF Cite Project Project DOI

Mathis Teva Rocton (2024). The Parameterized Complexity Landscape of the Unsplittable Flow Problem.

PDF Cite Project Project DOI

Phuc Hung Hoang (2024). The k-Opt Algorithm for the Traveling Salesman Problem Has Exponential Running Time for k \(≥\) 5.

PDF Cite Project DOI

Robert Ganian (2024). The Fine-Grained Complexity of Graph Homomorphism Parameterized by Clique-Width.

PDF Cite Project Project DOI

Argyrios Deligkas and Eduard Eiben and Viktoriia Korchemna and Simon Schierreich (2024). The Complexity of Fair Division of Indivisible Items with Externalities.

PDF Cite Project DOI

Henning Martin Woydt, Christian Komusiewicz, Frank Sommer (2024). SubModST: A Fast Generic Solver for Submodular~Maximization with Size Constraints.

André Schidler, Stefan Szeider (2024). Structure-guided Local Improvement for Maximum Satisfiability.

Gronemann, Martin, Martin Nöllenburg, Villedieu, Anaïs (2024). Splitting Plane Graphs to Outerplanarity.

Cite Project DOI

Johannes Varga, Karlsson, Emil, Günther Raidl, R\n̈nberg, Elina, Lindsten, Fredrik, Rodemann, Tobias (2024). Speeding up Logic-Based Benders Decomposition by Strengthening Cuts with Graph Neural Networks.

Éric Duchêne and Valentin Gledel and Sylvain Gravier and Fionn Mc Inerney and Mehdi Mhalla and Aline Parreau (2024). Smash and grab: The 0*6 scoring game on graphs.

PDF Cite Project DOI

Tianwei Zhang, Tomas Peitl, Stefan Szeider (2024). Small unsatisfiable k-CNFs with bounded literal occurrence.

Cite Project DOI

Robert Ganian (2024). Slim Tree-Cut Width.

PDF Cite Project DOI

Enrico Iurlano, Zec, Tatjana, Djukanović, Marko, Günther Raidl (2024). Signed double Roman domination on cubic graphs.

Tomas Peitl (2024). Should Decisions in QCDCL Follow Prefix Order?.

Johannes Varga, Günther Raidl, Todemann, Tobias (2024). Selecting User Queries in Interactive Job Scheduling.

Johannes Varga, Günther Raidl, Rönnberg, Elina, Rodemann, Tobias (2024). Scheduling Jobs Using Queries to Interactively Learn Human Availability Times.

Markus Kirchweger (2024). Satisfiability Modulo User Propagators.

Hai Xia, Stefan Szeider (2024). SAT-Based Tree Decomposition with Iterative Cascading Policy Selection.

PDF Cite Project Project Project DOI

André Schidler, Stefan Szeider (2024). SAT-based Decision Tree Learning for Large Data Sets.

Cite Project Project

Markus Kirchweger, Stefan Szeider (2024). SAT Modulo Symmetries for Graph Generation and Enumeration.

Cite Project DOI

Jan Niclas Dreier, Sebastian Ordyniak, Stefan Szeider (2024). SAT backdoors: Depth beats size.

Cite Project Project Project DOI

Dobler, Alexander, Jünger, Michael, Jünger, Paul J., Meffert, Julian, Mutzel, Petra, Martin Nöllenburg (2024). Revisiting ILP Models for Exact Crossing Minimization in Storyline Drawings.

PDF Cite Project DOI

Robert Ganian, Viktoriia Korchemna, Stefan Szeider (2024). Revisiting Causal Discovery from a Complexity-Theoretic Perspective.

Cite Project Project Project Project DOI

Tomas Peitl (2024). QCDCL with cube learning or pure literal elimination - What is best?.

Liana Khazaliya (2024). Problems in NP Can Admit Double-Exponential Lower Bounds When Parameterized by Treewidth or Vertex Cover.

PDF Cite Project Project DOI

Robert Ganian (2024). Parameterized Algorithms for Coordinated Motion Planning: Minimizing Energy.

PDF Cite Project Project DOI

Alexander Dobler (2024). PACE Solver Description: CRGone.

Cite Project DOI

Binucci, Carla, Di Giacomo, Emilio, Lenhart, William J., Liotta, Giuseppe, Montecchiani, Fabrizio, Martin Nöllenburg, Symvonis, Antonios (2024). On the Complexity of the Storyplan Problem.

Cite Project DOI

Emanuel Herrendorf, Christian Komusiewicz, Nils Morawietz, Frank Sommer (2024). On the Complexity of Community-aware Network~Sparsification.

Jannik Schestag and Niels Grüttemeier and Christian Komusiewicz and Frank Sommer (2024). On Critical Node Problems with Vulnerable Vertices.

Jérémie Chalopin and Victor Chepoi and Fionn Mc Inerney and Sébastien Ratel (2024). Non-Clashing Teaching Maps for Balls in Graphs.

PDF Cite Project

Simon Wietheger (2024). Near-Tight Runtime Guarantees for Many-Objective Evolutionary Algorithms.

PDF Cite Project DOI

Maria Bresich, Johannes Varga, Günther Raidl, Limmer, Steffen (2024). Mixed Integer Linear Programming Based Large Neighborhood Search Approaches for the Directed Feedback Vertex Set Problem.

Robert Ganian, Martin Nöllenburg, Röder, Sebastian (2024). Minimizing Switches in Cased Graph Drawings.

Cite Project DOI

Thomas Depian, Alexander Dobler, Christoph Kern, Jules Wulms (2024). Minimizing Corners in Colored Rectilinear Grids.

Cite Project DOI

Maria Bresich, Günther Raidl, Limmer, Steffen (2024). Letting a Large Neighborhood Search for an Electric Dial-A-Ride Problem Fly: On-The-Fly Charging Station Insertion.

Konrad Dabrowski, Eduard Eiben, Sebastian Ordyniak, Giacomo Paesani, Stefan Szeider (2024). Learning Small Decision Trees for Data of Low Rank-Width.

PDF Cite Project Project Project DOI

Montecchiani, Fabrizio, Liotta, Giuseppe, Martin Nöllenburg, Hong, Seok-Hee, Piselli, Tommaso (2024). Introducing Fairness in Graph Visualization via Gradient Descent.

Hong, Seok-Hee, Liotta, Giuseppe, Montecchiani, Fabrizio, Martin Nöllenburg, Piselli, Tommaso (2024). Introducing Fairness in Graph Visualization.

Dobler, Alexander, Martin Nöllenburg (2024). Improving Temporal Treemaps by Minimizing Crossings.

Cite Project DOI

Franz-Xaver Reichl, Friedrich Slivovsky, Stefan Szeider (2024). Improved Circuit Minimization with Exact Synthesis.

Valentin Bartier and Oscar Defrain and Fionn Mc Inerney (2024). Hypergraph Dualization with FPT-delay Parameterized by the Degeneracy and Dimension.

PDF Cite Project DOI

Simon Wietheger (2024). Hot off the Press: The First Proven Performance Guarantees for the Non-Dominated Sorting Genetic Algorithm II (NSGA-II) on a Combinatorial Optimization Problem.

PDF Cite Project DOI

Rodgers, Peter, Chapman, Peter, Blake, Andrew, Martin Nöllenburg, Wallinger, Markus, Dobler, Alexander (2024). Hoop Diagrams: A Set Visualization Method.

Cite Project DOI

Leroy Chew, Alexis De Colnet, Friedrich Slivovsky, Stefan Szeider (2024). Hardness of Random Reordered Encodings of Parity for Resolution and CDCL.

PDF Cite Project Project DOI

Phuc Hung Hoang (2024). Generating All Invertible Matrices by Row Operations.

PDF Cite Project DOI

Martin Nöllenburg, Röder, Sebastian, Wallinger, Markus (2024). GdMetriX - A NetworkX Extension For Graph Drawing Metrics.

Cite Project DOI

Jan Niclas Dreier, Mählmann, Nikolas, Toru\ŉczyk, Szymon (2024). Flip-breakability: A combinatorial dichotomy for monadically dependent graph classes.

Robert Ganian (2024). Fixed-Parameter Algorithms for Computing Bend-Restricted RAC Drawings of Graphs.

PDF Cite Project Project DOI

Jan Niclas Dreier, Eleftheriadis, Ioannis, Mählmann, Nikolas, McCarty, Rose, Pilipczuk, Michał, Toruńczyk, Szymon (2024). First-Order Model Checking on Monadically Stable Graph Classes.

Ordyniak, Sebastian, Paesani, Giacomo and Rychlicki, Mateusz, Stefan Szeider (2024). Explaining Decisions in ML Models: A Parameterized Complexity Analysis.

Salvà Soler, Joan, Hemmelmayr, Vera C., Günther Raidl (2024). Exact methods for the Selective Assessment Routing Problem.

Da Lozzo, Giordano, Robert Ganian, Gupta, Siddharth, Mohar, Bojan, Ordyniak, Sebastian, Zehavi, Meirav (2024). Exact Algorithms for Clustered Planarity with Linear Saturators.

Franz-Xaver Reichl, Stefan Szeider (2024). eSLIM: Circuit Minimization with SAT Based Local Improvement.

Cite Project DOI

Benjamin Bergougnoux and Oscar Defrain and Fionn Mc Inerney (2024). Enumerating Minimal Solution Sets for Metric Graph Problems.

PDF Cite Project DOI

Niels Grüttemeier and Philipp Heinrich Keßler, Christian Komusiewicz and Frank Sommer (2024). Efficient Branch-and-Bound Algorithms for Finding Triangle-Constrained 2-Clubs.

Liana Khazaliya (2024). Crossing Number Is NP-Hard for Constant Path-Width (And Tree-Width).

PDF Cite Project DOI

Cornelius Brand and Viktoriia Korchemna and Kirill Simonov and Michael Skotnica (2024). Counting Vanishing Matrix-Vector Products.

PDF Cite Project DOI

Phuc Hung Hoang (2024). Conflict-Free Coloring: Graphs of Bounded Clique-Width and Intersection Graphs.

PDF Cite Project DOI

Jakub Balabán, Robert Ganian, Mathis Teva Rocton (2024). Computing Twin-Width Parameterized by the Feedback Edge Number.

PDF Cite Project DOI

Markus Kirchweger, Stefan Szeider (2024). Computing small Rainbow Cycle Numbers with SAT modulo Symmetries.

Martin Nöllenburg, Wallinger, Markus (2024). Computing Hive Plots: A Combinatorial Framework.

Cite Project DOI

Martin Nöllenburg, Terziadis, Soeren (2024). Computing Data-driven Multilinear Metro Maps.

Cite Project DOI

Alexis De Colnet, Stefan Szeider, Tianwei Zhang (2024). Compilation and Fast Model Counting beyond CNF.

Cite Project Project Project DOI

Archambault, Daniel, Liotta, Giuseppe, Martin Nöllenburg, Piselli, Tommaso, Tappini, Alessandra, Wallinger, Markus (2024). Bundling-Aware Graph Drawing.

Cite Project DOI

Robert Ganian (2024). Bounding and Computing Obstacle Numbers of Graphs.

PDF Cite Project DOI

Bonerath, Annika, Martin Nöllenburg, Terziadis, Soeren, Wallinger, Markus, Wulms, Jules (2024). Boundary Labeling in a Circular Orbit.

PDF Cite Project DOI

Sebastian Ordyniak, Andre Schidler, Stefan Szeider (2024). Backdoor DNFs.

Cite Project Project DOI

Chew, Leroy, De Colnet, Alexis, Stefan Szeider (2024). ASP-QRAT: A Conditionally Optimal Dual Proof System for ASP.

Robert Ganian (2024). A Tight Subexponential-Time Algorithm for Two-Page Book Embedding.

PDF Cite Project Project DOI

Greilhuber, Jakob, Schober, Sophia, Enrico Iurlano, Günther Raidl (2024). A Simulated Annealing Based Approach for the Roman Domination Problem.

Reixach, Jaume, Blum, Christian, Djukanović, Marko, Günther Raidl (2024). A Neural Network Based Guidance for a BRKGA: An Application to the Longest Common Square Subsequence Problem.

Reixach, Jaume, Blum, Christian, Djukanović, Marko, Günther Raidl (2024). A Biased Random Key Genetic Algorithm for Solving the Longest Common Square Subsequence Problem.

Bernhard Kreutzer (2023). Computational Optimization Approaches for Distributing Battery Exchange Stations for Electric Scooters.

Johannes K. Fichte, Daniel Le Berre, Markus Hecher, Stefan Szeider (2023). The Silent (R)evolution of SAT.

Nikolaus Frohner (2023). Advancing State Space Search for Static and Dynamic Optimization by Parallelization and Learning.

Laurenz Tomandl (2023). A Learning Multilevel Optimization Approach for a Large Location Allocation Problem.

Bhore, Sujoy, Robert Ganian, Li, Guangping, Martin Nöllenburg, Wulms, Jules (2023). Worbel: Aggregating Point Labels into Word Clouds.

Cite Project DOI

Liana Khazaliya (2023). Upward and Orthogonal Planarity are W[1]-Hard Parameterized by Treewidth.

PDF Cite Project Project DOI

Bhore, Sujoy, Li, Guangping, Martin Nöllenburg, Rutter, Ignaz, Wu, Hsiang-Yun (2023). Untangling Circular Drawings: Algorithms and Complexity.

Cite Project DOI

Jaroslav Garvardt and Christian Komusiewicz and Frank Sommer (2023). The Parameterized Complexity of s-Club with Triangle and Seed Constraints.

Robert Ganian (2023). The Parameterized Complexity of Network Microaggregation.

PDF Cite Project

Sebastian Ordyniak, Giacomo Paesani, Stefan Szeider (2023). The Parameterized Complexity of Finding Concise Local Explanations.

PDF Cite Project Project DOI

Robert Ganian (2023). The Parameterized Complexity of Coordinated Motion Planning.

PDF Cite Project Project DOI

Stephen G. Kobourov, Maarten Löffler, Fabrizio Montecchiani, Marcin Pilipczuk, Ignaz Rutter, Raimund Seidel, Manuel Sorge, Jules Wulms (2023). The Influence of Dimensions on the Complexity of Computing Decision Trees.

Cite Project DOI

Robert Ganian (2023). The Computational Complexity of Concise Hypersphere Classification.

PDF Cite Project Project Project

Robert Ganian (2023). Structure-Aware Lower Bounds and Broadening the Horizon of Tractability for QBF.

PDF Cite Project DOI

Ahmed, Reyan, Angelini, Patrizio, Bekos, Michael A., Di Battista, Giuseppe, Kaufmann, Michael, Kindermann, Philipp, Kobourov, Stephen, Martin Nöllenburg, Symvonis, Antonios, Villedieu, Anaïs, Wallinger, Markus (2023). Splitting Vertices in 2-Layer Graph Drawings.

Cite Project Project DOI

Benjamin Bergougnoux, Vera Chekan, Robert Ganian, Mamadou Moustapha Kanté, Matthias Mnich, Sang-Il Oum, Michał Pilipczuk, Erik Jan Van Leeuwen (2023). Space-Efficient Parameterized Algorithms on Graphs of Low Shrubdepth.

PDF Cite Project DOI

Tianwei Zhang, Stefan Szeider (2023). Searching for smallest universal graphs and tournaments with SAT.

PDF Cite Project Project DOI

Andre Schidler, Stefan Szeider (2023). SAT-Boosted Tabu Search for Coloring Massive Graphs.

Cite Project Project DOI

Markus Kirchweger, Manfred Scheucher, Stefan Szeider (2023). SAT-Based Generation of Planar Graphs.

Cite Project Project DOI

Jérémie Chalopin, Victor Chepoi, Fionn Mc~Inerney, Sébastien Ratel, Yann Vaxès (2023). Sample compression schemes for balls in graphs.

Jan Niclas Dreier (2023). Pseudorandom Finite Models.

Vaidyanathan Peruvemba Ramaswamy, Stefan Szeider (2023). Proven optimally-balanced Latin rectangles with SAT.

PDF Cite Project Project DOI

Robert Ganian (2023). Parameterized complexity of envy-free resource allocation in social networks.

PDF Cite Project DOI

Gaétan Berthe, Yoann Coudert-Osmont, Alexander Dobler, Laure Morelle, Amadeus Reinald, Mathis Teva Rocton (2023). PACE Solver Description: Touiouidth.

Cite Project DOI

Günther Raidl (2023). Optimizing the positions of battery swapping stations -- Pilot Studies and Layout Optimization Algorithm.

Bhore, Sujoy, Da Lozzo, Giordano, Montecchiani, Fabrizio, Martin Nöllenburg (2023). On the Upward Book Thickness Problem: Combinatorial and Complexity Results.

Robert Ganian (2023). On the parameterized complexity of clustering problems for incomplete data.

Cite Project Project Project DOI

Christian Komusiewicz and Jannis Schramek and Frank Sommer (2023). On the Group Coverage Centrality Problem: Parameterized Complexity and Heuristics.

Matthias Bentert and Jannik Schestag and Frank Sommer (2023). On the Complexity of Finding a Sparse Connected Spanning Subgraph in a Non-Uniform Failure Model.

Martin Nöllenburg, Pupyrev, Sergey (2023). On Families of Planar DAGs with Constant Stack Number.

PDF Cite Project DOI

Manuel Sorge (2023). On Computing Optimal Tree Ensembles.

Robert Ganian, Montecchiani, Fabrizio, Martin Nöllenburg, Zehavi, Meirav, Liana Khazaliya (2023). New Frontiers of Parameterized Complexity in Graph Drawing (Dagstuhl Seminar 23162).

Mathis Teva Rocton (2023). New Complexity-Theoretic Frontiers of Tractability for Neural Network Training.

Huber, Michael, Martin Nöllenburg, Villedieu, Anaïs (2023). MySemCloud: Semantic-aware Word Cloud Editing.

PDF Cite Project DOI

Emmanuel Arrighi and Niels Grüttemeier and Nils Morawietz and Frank Sommer and Petra Wolf (2023). Multi-Parameter Analysis of Finding Minors and Subgraphs in Edge-Periodic Temporal Graphs.

Nikolaus Frohner, Günther Raidl, Francisco Chicano (2023). Multi-Objective Policy Evolution for a Same-Day Delivery Problem with Soft Deadlines.

Rottmann, Peter, Wallinger, Markus, Bonerath, Annika, Gedicke, Sven, Martin Nöllenburg, Haunert, Jan-Henrik (2023). MosaicSets: Embedding Set Systems into Grid Graphs.

PDF Cite Project

Esther Galby, Liana Khazaliya, Fionn Mc~Inerney, Roohani Sharma, Prafullkumar Tale (2023). Metric Dimension Parameterized by Feedback Vertex Set and Other Structural Parameters.

Robert Ganian (2023). Maximizing Social Welfare in Score-Based Social Distance Games.

PDF Cite Project DOI

Wallinger, Markus, Dobler, Alexander, Martin Nöllenburg (2023). LinSets.zip: Compressing Linear Set Diagrams.

Cite Project DOI

Eduard Eiben, Sebastian Ordyniak, Giacomo Paesani, Stefan Szeider (2023). Learning Small Decision Trees with Large Domain.

PDF Cite Project Project DOI

Limmer, Steffen, Johannes Varga, Günther Raidl (2023). Large Neighborhood Search for Electric Vehicle Fleet Scheduling.

Katalin Fazekas, Aina Niemetz, Markus Kirchweger, Stefan Szeider, Armin Biere (2023). IPASIR-UP: User Propagators for CDCL.

Cite Project Project DOI

Johannes Varga, Günther Raidl, Rönnberg, Elina, Rodemann, Tobias (2023). Interactive Job Scheduling with Partially Known Personnel Availabilities.

Jan Niclas Dreier (2023). Indiscernibles and Flatness in Monadically Stable and Monadically NIP Classes.

Johannes K. Fichte, Markus Hecher, Stefan Szeider (2023). Inconsistent Cores for ASP: The Perks and Perils of Non-Monotonicity.

PDF Cite Project DOI

Maria Bresich (2023). Hybrid Metaheuristics Based on Large Neighborhood Search and Mixed Integer Linear Programming for the Directed Feedback Vertex Set Problem.

Bernhard Neumann (2023). Hybrid Approaches to Sports League Scheduling using Constraint Programming and Simulated Annealing.

Robert Ganian (2023). Hedonic diversity games: A complexity picture with more than two colors.

PDF Cite Project DOI

Enrico Iurlano (2023). Growth of the perfect sequence covering array number.

Cornelius Brand, Robert Ganian, Sebastian Röder, Florian Schager (2023). Fixed-Parameter Algorithms for Computing RAC Drawings of Graphs.

PDF Cite Project Project DOI

Jan Niclas Dreier, Mählmann, Nikolas, Siebertz, Sebastian (2023). First-Order Model Checking on Structurally Sparse Graph Classes.

Wallinger, Markus, Archambault, Daniel, Auber, David, Martin Nöllenburg, Peltonen, Jaakko (2023). Faster Edge-Path Bundling Through Graph Spanners.

Cite Project DOI

Cornelius Brand and Alexandra Lassota (2023). Fast Convolutions for Near-Convex Sequences.

PDF Cite Project DOI

Luca Pascal Staus and Christian Komusiewicz and Nils Morawietz and Frank Sommer (2023). Exact Algorithms for Group Closeness Centrality.

Jan Niclas Dreier, Mock, Daniel, Rossmanith, Peter (2023). Evaluating Restricted First-Order Counting Properties on Nowhere Dense Classes and Beyond.

Tomohiro Koana and Christian Komusiewicz and Frank Sommer (2023). Essentially Tight Kernels for (Weakly) Closed Graphs.

Cornelius Brand and Viktoriia Korchemna and Michael Skotnica (2023). Deterministic Constrained Multilinear Detection.

PDF Cite Project DOI

Nils Jakob Eckstein and Niels Grüttemeier and Christian Komusiewicz and Frank Sommer (2023). Destroying Multicolored Paths and Cycles in Edge-Colored Graphs.

Jan Niclas Dreier (2023). CSP beyond tractable constraint languages.

Dobler, Alexander, Martin Nöllenburg, Stojanovic, Daniel, Villedieu, Anaïs, Wulms, Jules (2023). Crossing Minimization in Time Interval Storylines.

PDF Cite Project Project

Liana Khazaliya (2023). Consistency Checking Problems: A Gateway to Parameterized Sample Complexity.

PDF Cite Project DOI

Andre Schidler, Stefan Szeider (2023). Computing twin-width with SAT and branch & bound.

PDF Cite Project Project DOI

Stefan Szeider (2023). Computing optimal hypertree decompositions with SAT.

Tomohiro Koana and Christian Komusiewicz and Frank Sommer (2023). Computing Dense and Sparse Subgraphs of Weakly Closed Graphs.

Markus Kirchweger, Tomas Peitl, Stefan Szeider (2023). Co-Certificate Learning with SAT Modulo Symmetries.

PDF Cite Project Project DOI

Franz-Xaver Reichl, Friedrich Slivovsky, Stefan Szeider (2023). Circuit Minimization with QBF-Based Exact Synthesis.

PDF Cite Project Project Project DOI

Stefan Szeider (2023). Circuit Minimization with Exact Synthesis: From QBF Back to SAT.

Stefan Szeider (2023). Are Hitting Formulas Hard for Resolution?.

Cite Project Project DOI

Limmer, Steffen, Johannes Varga, Günther Raidl (2023). An Evolutionary Approach for Scheduling a Fleet of Shared Electric Vehicles.

Florentina Voboril (2023). Algorithms for Satisfiability Testing.

Markus Kirchweger (2023). A SAT Solver's Opinion on the Erdős-Faber-Lovász Conjecture.

Huber, Marc, Günther Raidl (2023). A Relative Value Function Based Learning Beam Search for the Longest Common Subsequence Problem.

Cornelius Brand and Martin Koutecký and Alexandra Lassota (2023). A Polyhedral Perspective on Tropical Convolutions.

PDF Cite Project DOI

Ettrich, Rupert, Huber, Marc, Günther Raidl (2023). A Policy-Based Learning Beam Search for Combinatorial Optimization.

Robert Ganian (2023). A Parameterized Theory of PAC Learning.

PDF Cite Project

Günther Raidl (2023). A Multilevel Optimization Approach for Large Scale Battery Exchange Station Location Planning.

Benjamin Bergougnoux, Jan Niclas Dreier, Lars Jaffke (2023). A logic-based algorithmic meta-theorem for mim-width.

Rafael Kiesel and André Schidler (2023). A Dynamic MaxSAT-based Approach to Directed Feedback Vertex Sets.

Cite Project Project DOI

Lukas Felician Krasel (2022). Optimization of Container Transportation for Fixed-Schedule Block Trains with Optional Round Trips in Collaborative Logistics.

Beyersdorff, Olaf, Blinkhorn, Joshua, Mahajan, Meena, Tomas Peitl (2022). Hardness Characterisations and Size-Width Lower Bounds for QBF Resolution.

Jonas Mayerhofer (2022). Minimizing Makespan in Flow Shops with a Reinforcement Learning Like Approach.

Thomas Jatschka (2022). Computational Optimization Approaches for Distributing Service Points for Mobility Applications and Smart Charging of Electric Vehicles.

Günther Raidl (2022). A Large Neighborhood Search for Battery Swapping Station Location Planning for Electric Scooters.

Robert Ganian, Filip Pokr ́Yvka, Andre Schidler, Kirill Simonov, Stefan Szeider (2022). Weighted Model Counting with Twin-Width.

PDF Cite Project Project Project Project DOI

Jan Niclas Dreier, Jakub Gajarský, Yiting Jiang, Patrice Ossona De Mendez, Jean-Florent Raymond (2022). Twin-width and generalized coloring numbers.

Dobler, Alexander, Manuel Sorge, Villedieu, Anäis (2022). Turbocharging Heuristics for Weak Coloring Numbers.

Cite Project Project DOI

Jan Niclas Dreier, Gajarský, Jakub, Kiefer, Sandra, Pilipczuk, Michał, Toruńczyk, Szymon (2022). Treelike Decompositions for Transductions of Sparse Graphs.

Wolfgang Dvorak, Markus Hecher, Matthias König and Andre Schidler, Stefan Szeider, Stefan Woltran (2022). Tractable Abstract Argumentation via Backdoor-Treewidth.

PDF Cite Project Project

Leroy Chew and Friedrich Slivovsky (2022). Towards Uniform Certification in QBF.

PDF Cite Project DOI

Robert Ganian, Andre Schidler, Manuel Sorge, Stefan Szeider (2022). Threshold Treewidth and Hypertree Width.

PDF Cite Project Project Project DOI

Thekla Hamm and Nina Klobas and George B. Mertzios and Paul G. Spirakis (2022). The Complexity of Temporal Vertex Cover in Small-Degree Graphs.

PDF Cite Project Project

Robert Ganian (2022). The Complexity of k-Means Clustering when Little is Known.

PDF Cite Project Project

Robert Ganian (2022). The Complexity of Envy-Free Graph Cutting.

PDF Cite Project Project DOI

Robert Ganian (2022). Testing Upward Planarity of Partial 2-Trees.

PDF Cite Project DOI

Robert Ganian, Eun Jung Kim, Friedrich Slivovsky, Stefan Szeider (2022). Sum-of-Products with Default Values: Algorithms and Complexity Results.

PDF Cite Project Project

Batik, Tobias, Terziadis, Soeren, Wang, Yu-Shuen, Martin Nöllenburg, Wu, Hsiang-Yun (2022). Shape-Guided Mixed Metro Map Layout.

Cite Project DOI

Enrico Iurlano (2022). Scrambling Permutations and Related Structures: Asymptotics and Constructions.

André Schidler (2022). SAT-Based Local Search for Plane Subgraph Partitions (CG Challenge).

PDF Cite Project Project DOI

Phoebe De Nooijer and Soeren Nickel and Alexandra Weinberger and Zuzana Masárová and Tamara Mchedlidze and Maarten Löffler and Günter Rote (2022). Removing Popular Faces in Curve Arrangements.

Nils Morawietz and Niels Grüttemeier and Christian Komusiewicz and Frank Sommer (2022). Refined Parameterizations for Computing Colored Cuts in Edge-Colored Graphs.

Klemz, Boris, Martin Nöllenburg, Prutkin, Roman (2022). Recognizing Weighted and Seeded Disk Graphs.

Robert Ganian (2022). Preface: Ninth workshop on graph classes, optimization, and Width Parameters, Vienna, Austria.

Robert Ganian (2022). Preface: 47th International Symposium on Mathematical Foundations of Computer Science, MFCS 2022, August 22-26, 2022, Vienna, Austria.

Franz-Xaver Reichl and Friedrich Slivovsky (2022). Pedant: A Certifying DQBF Solver.

Robert Ganian (2022). Parameterized Algorithms for Upward Planarity.

PDF Cite Project Project DOI

Bhore, Sujoy, Robert Ganian, Montecchiani, Fabrizio, Martin Nöllenburg (2022). Parameterized Algorithms for Queue Layouts.

PDF Cite Project Project DOI

Thekla Hamm and Petr Hlinený (2022). Parameterised Partially-Predrawn Crossing Number.

PDF Cite Project Project DOI

Rafael Kiesel and André Schidler (2022). PACE Solver Description: DAGer - Cutting out Cycles with MaxSAT.

PDF Cite Project Project DOI

Frank Sommer (2022). On Hard Subgraph Problems: Parameterized Algorithms and Efficient Implementations.

Robert Ganian (2022). On Covering Segments with Unit Intervals.

PDF Cite Project Project DOI

Dobler, Alexander, Martin Nöllenburg (2022). On Computing Optimal Linear Diagrams.

PDF Cite Project DOI

Jiehua Chen, Martin Nöllenburg, Simola, Sofia, Villedieu, Anaïs, Wallinger, Markus (2022). Multidimensional Manhattan Preferences.

Cite Project Project DOI

Nickel, Soeren, Sondag, Max, Meulemans, Wouter, Kobourov, Stephen, Peltonen, Jaakko, Martin Nöllenburg (2022). Multicriteria Optimization for Dynamic Demers Cartograms.

Cite Project DOI

Wu, Hsiang-Yun, Martin Nöllenburg, Viola, Ivan (2022). Multi-level Area Balancing of Clustered Graphs.

Cite Project DOI

Bonnet, Édouard, Jan Niclas Dreier, Gajarský, Jakub, Kreutzer, Stephan, Mählmann, Nikolas, Simon, Pierre, Toruńczyk, Szymon (2022). Model Checking on Interpretations of Classes of Bounded Local Cliquewidth.

Čmolík, Ladislav, Pavlovec, Václav, Wu, Hsiang-Yun, Martin Nöllenburg (2022). Mixed Labeling: Integrating Internal and External Labels.

PDF Cite Project DOI

Bhore, Sujoy, Klute, Fabian, Löffler, Maarten, Martin Nöllenburg, Terziadis, Soeren, Villedieu, Anaïs (2022). Minimum Link Fencing.

Cite Project DOI

Bandyapadhyay, Sayan, Fomin, Fedor V., Golovach, Petr A., Purohit, Nidhi, Siminov, Kirill (2022). Lossy Kernelization of Same-Size Clustering.

Fomin, Fedor V., Golovach, Petr A., Sagunov, Danil, Simonov, Kirill (2022). Longest Cycle above Erdős--Gallai Bound.

Cite Project DOI

Vaidyanathan Peruvemba Ramaswamy, Stefan Szeider (2022). Learning Large Bayesian Networks with Expert Constraints.

Cite Project Project

Huber, Marc, Günther Raidl (2022). Learning Beam Search: Utilizing Machine Learning to Guide Beam Search for Solving Combinatorial Optimization Problems.

Landman, Martina, Futschek, Gerald, Unkovic, Svetlana, Florentina Voboril (2022). Initial Learning of Textual Programming at School: Evolution of Outreach Activities.

Sayan Bandyapadhyay and Fedor v. Fomin and Petr A. Golovach and William Lochet and Nidhi Purohit and Kirill Simonov (2022). How to Find a Good Explanation for Clustering?.

PDF Cite Project

Djukanovic, Marko, Kartelj, Aleksandar, Matić, Dragan, Grbić, Milana, Blum, Christian, Günther Raidl (2022). Graph Search and Variable Neighborhood Search for Finding Constrained Longest Common Subsequences in Artificial and Real Gene Sequences.

Bandyapadhyay, Sayan, Fomin, Fedor V., Golovach, Petr A., Purohit, Nidhi, Simonov, Kirill (2022). FPT Approximation for Fair Minimum-Load Clustering.

Bliznets, Ivan, Sagunov, Danil, Simonov, Kirill (2022). Fine-grained Complexity of Partial Minimum Satisfiability.

PDF Cite Project DOI

Eduard Eiben, Robert Ganian, Iyad Kanj, Sebastian Ordyniak, Stefan Szeider (2022). Finding a Cluster in Incomplete Data.

PDF Cite Project Project Project DOI

Eva-Maria Hainzl and Maarten Löffler and Daniel Perz and Josef Tkadlec and Markus Wallinger (2022). Finding a Battleship of Uncertain Shape.

Tomohiro Koana and Christian Komusiewicz and Frank Sommer (2022). Exploiting $c$-Closure in Kernelization Algorithms for Graph Problems.

Wallinger, Markus, Archambault, Daniel, Auber, David, Martin Nöllenburg, Peltonen, Jaakko (2022). Edge-Path Bundling: A Less Ambiguous Edge Bundling Approach.

Cite Project DOI

Christian Hatschka (2022). Edge-Cut Width: An Algorithmically Driven Analogue of Treewidth Based on Edge Cuts.

PDF Cite Project DOI

Fomin, Fedor V., Golovach, Petr A., Lochet, William, Sagunov, Danil, Simonov, Kirill, Saurabh, Saket (2022). Detours in Directed Graphs.

PDF Cite Project DOI

Tomohiro Koana and Christian Komusiewicz and André Nichterlein and Frank Sommer (2022). Covering Many (Or Few) Edges with k Vertices in Sparse Graphs.

Florentina Voboril (2022). Computing Treewidth with Constraint Programming.

Johannes Varga, Günther Raidl, Steffen Limmer (2022). Computational Methods for Scheduling the Charging and Assignment of an On-Site Shared Electric Vehicle Fleet.

A. Akitaya, Hugo, Demaine, Erik D., Korman, Matias, Kostitsyna, Irina, Parada, Irene, Sonke, Willem, Speckmann, Bettina, Uehara, Ryuhei, Wulms, Jules (2022). Compacting Squares: Input-Sensitive In-Place Reconfiguration of Sliding Squares.

Cite Project Project DOI

Jan Niclas Dreier, Mählmann, Nikolas, Mouawad, Amer E., Siebertz, Sebastian, Vigny, Alexandre (2022). Combinatorial and Algorithmic Aspects of Monadic Stability.

Nils Morawietz and Niels Grüttemeier and Christian Komusiewicz and Frank Sommer (2022). Colored cut games.

Robert Ganian (2022). An efficient algorithm for counting Markov equivalent DAGs.

PDF Cite Project Project DOI

Bhore, Sujoy, Li, Guangping, Martin Nöllenburg (2022). An Algorithmic Study of Fully Dynamic Independent Sets for Map Labeling.

Cite Project DOI

Robert Ganian, Eun Jung Kim, Stefan Szeider (2022). Algorithmic Applications of Tree-Cut Width.

PDF Cite Project Project DOI

Robert Ganian (2022). A Unifying Framework for Characterizing and Computing Width Measures.

Cite Project Project

Markus Kirchweger, Manferd Scheucher, Stefan Szeider (2022). A SAT Attack on Rota’s Basis Conjecture.

PDF Cite Project Project DOI

André Schidler, Stefan Szeider (2022). A SAT Approach to Twin-Width.

Cite Project Project DOI

Peter Knees, Bruce Ferwerda, Andreas Rauber, Sebastian Strumbelj, Annabel Resch, Laurenz Tomandl, Valentin Bauer, Fung Yee Tang, Josip Bobinac, Amila Ceranic, Riad Dizdar (2022). A Reproducibility Study on User-centric MIR Research and Why it is Important.

Huber, Marc, Günther Raidl (2022). A Relative Value Function Based Learning Beam Search for Longest Common Subsequence Problems.

Matthias Rauscher (2022). A Matheuristic for Battery Exchange Station Location Planning for Electric Scooters.

Günther Raidl (2022). A Large Neighborhood Search for a Cooperative Optimization Approach to Distribute Service Points in Mobility Applications.

Mayerhofer, Jonas, Markus Kirchweger, Huber, Marc, Günther Raidl (2022). A Beam Search for the Shortest Common Supersequence Problem Guided by an Approximate Expected Length Calculation.

(2022). 47th International Symposium on Mathematical Foundations of Computer Science, MFCS 2022, August 22-26, 2022, Vienna, Austria.

Marko Djukanovic (2021). Exact and heuristic approaches for solving string problems from bioinformatics.

Fabio Francisco Oberweger (2021). A Learning Large Neighborhood Search for the Staff Rerostering Problem.

Johannes Varga (2021). Computational Methods for Fleet Scheduling in E-Mobility.

Benjamin Schaden (2021). Scheduling the Charging of Electric Vehicles with SOC-Dependent Maximum Charging Power.

Giulio Pace (2021). Randomized Construction Approaches to the Traveling Tournament Problem using Lower Bound Based Heuristics.

Bhore, Sujoy, Löffler, Maarten, Nickel, Soeren, Martin Nöllenburg (2021). Unit Disk Representations of Embedded Trees, Outerplanar and Multi-Legged Graphs.

Bojan Nikolic, Marko Djukanovic, Dragan Matic (2021). Two new Mixed-Integer Linear Programming Models for Solving the Multidimensional Multi-Way Number Partitioning Problem.

Vaidyanathan Peruvemba Ramaswamy, Stefan Szeider (2021). Turbocharging Treewidth-Bounded Bayesian Network Structure Learning.

PDF Cite Project Project

Robert Ganian (2021). Towards a Polynomial Kernel for Directed Feedback Vertex Set.

PDF Cite Project

Robert Ganian (2021). The Power of Cut-Based Parameters for Computing Edge-Disjoint Paths.

PDF Cite Project

Robert Ganian (2021). The Parameterized Complexity of Connected Fair Division.

PDF Cite Project Project

Eduard Eiben, Robert Ganian, Iyad Kanj and Sebastian Ordyniak, Stefan Szeider (2021). The Parameterized Complexity of Clustering Incomplete Data.

PDF Cite Project Project Project Project

Robert Ganian (2021). The Complexity of Object Association in Multiple Object Tracking.

PDF Cite Project Project

Robert Ganian (2021). The Complexity of Bayesian Network Learning: Revisiting the Superstructure.

PDF Cite Project Project

Robert Ganian (2021). The complexity landscape of decompositional parameters for ILP: Programs with Few Global Variables and Constraints.

PDF Cite Project Project

Tomas Peitl (2021). Strong (D)QBF Dependency Schemes via Implication-free Resolution Paths.

Jules Wulms, Juri Buchmüller, Wouter Meulemans, Kevin Verbeek, Bettina Speckmann (2021). Stable Visual Summaries for Trajectory Collections.

Cite Project DOI

Nikolic, Bojan, Kartelj Aleksandar, Djukanovic, Marko, Grbic, Milana, Blum, Christian, Günther Raidl (2021). Solving the Longest Common Subsequence Problem Concerning Non-Uniform Distributions of Letters in Input Strings.

Djukanovic, Marko, Kartelj Aleksandar, Matic, Dragan,, Grbic, Milana, Blum, Christian, Günther Raidl (2021). Solving the Generalized Constrained Longest Common Subsequence Problem with Many Pattern Strings.

Schaden, Benjamin, Jatschka, Thomas, Limmer, Steffen, Günther Raidl (2021). Smart Charging of Electric Vehicles Considering SOC-Dependent Maximum Charging Powers.

Markus Kirchweger, Stefan Szeider (2021). SAT Modulo Symmetries for Graph Generation.

Cite Project Project DOI

Nikolaus Frohner, Matthias Horn, Günther Raidl (2021). Route Duration Prediction in a Stochastic and Dynamic Vehicle Routing Problem with Short Delivery Deadlines.

Stefan Mengel and Friedrich Slivovsky (2021). Proof Complexity of Symbolic QBF Reasoning.

PDF Cite Project DOI

Niels Grüttemeier and Christian Komusiewicz and Nils Morawietz and Frank Sommer (2021). Preventing Small (s,t)Cuts by Protecting Edges.

Fedor v. Fomin, Petr A. Golovach, Kirill Simonov (2021). Parameterized k-Clustering: Tractability island.

Sebastian Ordyniak, André Schidler, Stefan Szeider (2021). Parameterized Complexity of Small Decision Tree Learning.

PDF Cite Project Project

Bandyapadhyay, Sayan, Fomin, Fedor V., Golovach, Petr A., Simonov, Kirill (2021). Parameterized Complexity of Feature Selection for Categorical Data Clustering.

Robert Ganian, Montecchiani, Fabrizio, Martin Nöllenburg, Zehavi, Meirav (2021). Parameterized Complexity in Graph Drawing (Dagstuhl Seminar 21293).

Wallinger, Markus, Jacobsen, Ben, Kobourov, Stephen, Martin Nöllenburg (2021). On the Readability of Abstract Set Visualizations.

Cite Project DOI

Robert Ganian (2021). On Structural Parameterizations of the Bounded-Degree Vertex Deletion Problem.

PDF Cite Project

Henry Förster, Robert Ganian, Fabian Klute, Martin Nöllenburg (2021). On Strict (Outer-)Confluent Graphs.

PDF Cite Project Project

Sayan Bandyapadhyay and Fedor v. Fomin and Kirill Simonov (2021). On Coresets for Fair Clustering in Metric and Euclidean Spaces and Their Applications.

Robert Ganian, Stefan Szeider (2021). New Width Parameters for SAT and Sharp-SAT.

PDF Cite Project Project Project DOI

Jacobsen, Ben, Wallinger, Markus, Kobourov, Stephen, Martin Nöllenburg (2021). MetroSets: Visualizing Sets as Metro Maps.

PDF Cite Project DOI

Robert Ganian (2021). Measuring what matters: A hybrid approach to dynamic programming with treewidth.

PDF Cite Project Project

Adrian Bracher, Nikolaus Frohner, Günther Raidl (2021). Learning Surrogate Functions for the Short-Horizon Planning in Same-Day Delivery Problems.

Vaidyanathan Peruvemba Ramaswamy, Stefan Szeider (2021). Learning fast-inference Bayesian networks.

PDF Cite Project Project

Martin Nöllenburg, Villedieu, Anaïs, Wulms, Jules (2021). Layered Area-Proportional Rectangle Contact Representation.

Cite Project DOI

Jan Niclas Dreier (2021). Lacon- and Shrub-Decompositions: A New Characterization of First-Order Transductions of Bounded Expansion Classes.

Klute, Fabian, Löffler, Maarten, Martin Nöllenburg (2021). Labeling Nonograms: Boundary Labeling for Curve Arrangements.

Leroy Chew (2021). Hardness and Optimality in QBF Proof Systems Modulo NP.

Clément Dallard, Robert Ganian, Meike Hatzel, Matjaz Krnc, Martin Milanic (2021). Graphs with two moplexes.

PDF Cite Project Project

Clément Dallard, Robert Ganian, Meike Hatzel, Matjaz Krnc, Martin Milanic (2021). Graphs with at most two moplexes.

Cite Project Project

Bandyapadhyay, Sayan, Banik, Aritra, Bhore, Sujoy, Martin Nöllenburg (2021). Geometric Planar Networks on Bichromatic Collinear Points.

Cite Project DOI

Marko Samer, Stefan Szeider (2021). Fixed-Parameter Tractability.

Wolfgang Schreiner and Franz-Xaver Reichl (2021). First-Order Logic in Finite Domains: Where Semantic Evaluation Competes with SMT Solving.

Stefan Szeider (2021). Finding the Hardest Formulas for Resolution (Extended Abstract).

Cite Project Project DOI

Tomas Peitl, Stefan Szeider (2021). Finding the Hardest Formulas for Resolution.

Cite Project Project DOI

Bekos, Michael A., Niedermann, Benjamin, Martin Nöllenburg (2021). External Labeling: Fundamental Concepts and Algorithmic Techniques.

Eduard Eiben and Fedor v. Fomin and Petr A. Golovach and William Lochet and Fahad Panolan and Kirill Simonov (2021). EPTAS for \emphk-means Clustering of Affine Subspaces.

Christian Komusiewicz and Frank Sommer (2021). Enumerating connected induced subgraphs: Improved delay and experimental comparison.

Priyanka Golia and Friedrich Slivovsky and Subhajit Roy and Kuldeep S. Meel (2021). Engineering an Efficient Boolean Functional Synthesis Engine.

PDF Cite Project DOI

Matthias Horn, Nikolaus Frohner, Günther Raidl (2021). Driver Shift Planning for an Online Store with Short Delivery Times.

Bhore, Sujoy, Li, Guangping, Martin Nöllenburg, Wulms, Jules (2021). Disjoint Box Covering in a Rectilinear Polygon.

PDF Cite Project

Niels Grüttemeier and Christian Komusiewicz and Jannik Schestag and Frank Sommer (2021). Destroying Bicolored $P_3$s by Deleting Few Edges.

Tomas Peitl (2021). Davis and Putnam Meet Henkin: Solving DQBF with Resolution.

PDF Cite Project DOI

Robert Ganian (2021). Crossing-Optimal Extension of Simple Drawings.

PDF Cite Project Project

Thekla Hamm, Martin Lackner, Anna Rapberger (2021). Computing Kemeny Rankings from d-Euclidean Preferences.

Cite Project Project

Geiger, Jakob, Cornelsen, Sabine, Haunert, Jan-Henrik, Kindermann, Philipp, Mchedlidze, Tamara, Martin Nöllenburg, Okamoto, Yoshio, Wolff, Alexander (2021). ClusterSets: Optimizing Planar Clusters in Categorical Point Data.

Stefan Szeider (2021). Certified DQBF Solving by Definition Extraction.

PDF Cite Project DOI

Bhore, Sujoy, Haunert, Jan-Henrik, Klute, Fabian, Li, Guangping, Martin Nöllenburg (2021). Balanced Independent and Dominating Sets on Colored Interval Graphs.

Cite Project DOI

Jan Niclas Dreier, Rossmanith, Peter (2021). Approximate Evaluation of First-Order Counting Queries.

Thomas Jatschka, Günther Raidl, Tobias Rodemann (2021). A General Cooperative Optimization Approach for Distributing Service Points in Mobility Applications.

Nikolaus Frohner, Stephan Teuschl, Günther Raidl (2020). Casual Employee Scheduling with Constraint Programming and Metaheuristics.

Christoph Berger (2020). Solving a Generalized Constrained Longest Common Subsequence Problem.

Benedikt Klocker (2020). Combinatorial Optimization Approaches for Graph Construction Problems.

Simeon Kuran (2020). Heuristische Optimierungsverfahren für die Koordinierung von Flughafenslots.

Robert Ganian (2020). Using decomposition-parameters for QBF: Mind the prefix!.

PDF Cite Project

Johannes Klaus Fichte and Norbert Manthey and Julian Stecklina and André Schidler (2020). Towards Faster Reasoners by Using Transparent Huge Pages.

Nickel, Soeren, Martin Nöllenburg (2020). Towards Data-Driven Multilinear Metro Maps.

Purchase, Helen C., Archambault, Daniel, Kobourov, Stephen, Martin Nöllenburg, Pupyrev, Sergey, Wu, Hsiang-Yun (2020). The Turing Test for Graph Drawing Algorithms.

PDF Cite Project DOI

Robert Ganian (2020). The Complexity Landscape of Resource-Constrained Scheduling.

PDF Cite Project

Tomas Peitl (2020). Strong (D)QBF Dependency Schemes via Tautology-free Resolution Paths.

Niels Grüttemeier and Christian Komusiewicz and Nils Morawietz and Frank Sommer (2020). String Factorizations Under Various Collision Constraints.

Jiehua Chen (2020). Stable Matchings with Diversity Constraints: Affirmative Action is beyond NP.

PDF Cite Project

Johannes Klaus Fichte and Markus Hecher and André Schidler (2020). Solving the Steiner Tree Problem with few Terminals.

Christian Blum, Marko Djukanovic, Alberto Santini, Hua Jiang, Chu-Min Li, Felipe Manya, Günther Raidl (2020). Solving Longest Common Subsequence Problems via a Transformation to the Maximum Clique Problem.

Ankit Shukla, Friedrich Slivovsky, Stefan Szeider (2020). Short Q-Resolution Proofs with Homomorphisms.

PDF Cite Project Project Project

Galvão, Marcelo, Krukar, Jakub, Martin Nöllenburg, Schwering, Angela (2020). Route Schematization with Landmarks.

PDF Cite Project DOI

Gemsa, Andreas, Niedermann, Benjamin, Martin Nöllenburg (2020). Placing Labels in Road Maps: Algorithms and Complexity.

Frank Sommer and Christian Komusiewicz (2020). Parameterized algorithms for Module Map problems.

Bhore, Sujoy, Robert Ganian, Montecchiani, Fabrizio, Martin Nöllenburg (2020). Parameterized Algorithms for Book Embedding Problems.

Cite Project Project DOI

Horn, Matthias, Djukanovic, Marko, Blum, Christian, Günther Raidl (2020). On the Use of Decision Diagrams for Finding Repetition-Free Longest Common Subsequences.

Robert Ganian, Iyad Kanj, Stefan Szeider (2020). On the Parameterized Complexity of Clustering Incomplete Data into Subspaces of Small Rank.

PDF Cite Project Project Project

Robert Ganian, Iyad Kanj, Stefan Szeider (2020). On the Parameterized Complexity of Clustering.

Marko Djukanovic, Christoph Berger, Günther Raidl, Christian Blum (2020). On Solving a Generalized Constrained Longest Common Subsequence Problem.

Matthias Schlaipfer and Friedrich Slivovsky and Georg Weissenbacher and Florian Zuleger (2020). Multi-linear Strategy Extraction for QBF Expansion Proofs via Local Soundness.

Nikolaus Frohner, Günther Raidl (2020). Merging Quality Estimation for Binary Decision Diagrams with Binary Classifiers.

Vaidyanathan Peruvemba Ramaswamy, Stefan Szeider (2020). MaxSAT-Based Postprocessing for Treedepth.

PDF Cite Project Project DOI

Jan Niclas Dreier, Philipp Kuinke, Peter Rossmanith (2020). Maximum Shallow Clique Minors in Preferential Attachment Graphs have Polylogarithmic Size.

Eduard Eiben and Fedor v. Fomin and Fahad Panolan and Kirill Simonov (2020). Manipulating Districts to Win Elections: Fine-Grained Complexity.

Fedor v. Fomin, Petr A. Golovach, Fahad Panolan, Kirill Simonov (2020). Low-Rank Binary Matrix Approximation in Column-Sum Norm.

Biedl, Therese, Chaplick, Steven, Kaufmann, Michael, Montecchiani, Fabrizio, Martin Nöllenburg, Raftopoulou, Chrysanthi (2020). Layered Fan-Planar Graph Drawings.

Löffler, Maarten, Martin Nöllenburg (2020). Labeling Nonograms.

Friedrich Slivovsky (2020). Interpolation-Based Semantic Gate Extraction and Its Applications to QBF Preprocessing.

Tomas Peitl (2020). Hard QBFs for Merge Resolution.

Jan Niclas Dreier, Henri Lotze, Peter Rossmanith (2020). Hard Problems on Random Graphs.

Bandyapadhyay, Sayan, Banik, Aritra, Bhore, Sujoy, Martin Nöllenburg (2020). Geometric Planar Networks on Bichromatic Points.

PDF Cite Project DOI

Stefan Szeider (2020). Formalizing Graph Trail Properties in Isabelle/HOL.

PDF Cite Project Project

Robert Ganian (2020). Foreword: Eighth Workshop on Graph Classes, Optimization, and Width Parameters, Toronto, Ontario, Canada.

Robert Ganian (2020). Fixed-Parameter Tractability of Dependency QBF with Structural Parameters.

PDF Cite Project Project Project Project

Christian Komusiewicz and Frank Sommer (2020). FixCon: A Generic Solver for Fixed-Cardinality Subgraph Problems.

Jan Niclas Dreier, Philipp Kuinke, Peter Rossmanith (2020). First-Order Model-Checking in Random Graphs and Complex Networks.

Marko Djukanovic, Günther Raidl, Christian Blum (2020). Finding Longest Common Subsequences: New anytime A$^*$ Search Results.

Eiben, Eduard, Robert Ganian, Hamm, Thekla, Klute, Fabian, Martin Nöllenburg (2020). Extending Partial 1-Planar Drawings.

PDF Cite Project DOI

Eiben, Eduard, Robert Ganian, Hamm, Thekla, Klute, Fabian, Martin Nöllenburg (2020). Extending Nearly Complete 1-Planar Drawings in Polynomial Time.

PDF Cite Project DOI

Günther Raidl (2020). Exploiting Similar Behavior of Users in a Cooperative Optimization Approach for Distributing Service Points in Mobility Applications.

Jatschka, Thomas, Oberweger, Fabio F., Rodemann, Tobias, Günther Raidl (2020). Distributing Battery Swapping Stations for Electric Scooters in an Urban Area.

Matthias Horn, Günther Raidl (2020). Decision Diagram Based Limited Discrepancy Search for a Job Sequencing Problem.

Martin Nöllenburg (2020). Crossing Layout in Non-planar Graphs.

André Schidler, Stefan Szeider (2020). Computing Optimal Hypertree Decompositions.

PDF Cite Project

Jan Niclas Dreier (2020). Complexity of independency and cliquy trees.

Fedor v. Fomin, Danil Sagunov, Kirill Simonov (2020). Building Large k-Cores from Sparse Graphs.

Johannes K. Fichte, Markus Hecher, Stefan Szeider (2020). Breaking Symmetries with RootClique and LexTopsort.

PDF Cite Project Project

Riedler, Martin, Jatschka, Thomas, Maschler, Johannes, Günther Raidl (2020). An Iterative Time-Bucket Refinement Algorithm for a High-Resolution Resource-Constrained Project Scheduling Problem.

PDF Cite Project DOI

Marko Djukanovic, Christoph Berger, Günther Raidl, Christian Blum (2020). An A* Search Algorithm for the Constrained Longest Common Subsequence Problem.

Gemsa, Andreas, Niedermann, Benjamin, Martin Nöllenburg (2020). A Unified Model and Algorithms for Temporal Map Labeling.

Johannes K. Fichte, Markus Hecher, Stefan Szeider (2020). A Time Leap Challenge for SAT-Solving.

Cite Project Project

Wu, Hsiang-Yun, Niedermann, Benjamin, Takahashi, Shigeo, Roberts, Maxwell J., Martin Nöllenburg (2020). A Survey on Transit Map Layout -- from Design, Machine, and Human Perspectives.

PDF Cite Project DOI

Günther Raidl (2020). A Large Neighborhood Search for Distributing Service Points in Mobility Applications with Capacities and Limited Resources.

Friedrich Slivovsky, Stefan Szeider (2020). A Faster Algorithm for Propositional Model Counting Parameterized by Incidence Treewidth.

PDF Cite Project Project Project

Nikolaus Frohner, Günther Raidl (2020). A Double-Horizon Approach to a Purely Dynamic and Stochastic Vehicle Routing Problem with Delivery Deadlines and Shift Flexibility.

Djukanovic, Marko, Günther Raidl, Blum, Christian (2020). A Beam Search for the Longest Common Subsequence Problem Guided by a Novel Approximate Expected Length Calculation.

Nikolaus Frohner, Bernhard Neumann, Günther Raidl (2020). A Beam Search Approach to the Traveling Tournament Problem.

Thomas Kaufmann (2019). A Variable Neighborhood Search for the Job Sequencing with One Common and Multiple Secondary Resources Problem.

Benjamin Schwendinger (2019). Perfect Pseudo Matchings on Snarks.

Benedikt Klocker (2019). Solving a Weighted Set Covering Problem for Improving Algorithms for Cutting Stock Problems with Setup Costs by Solution Merging.

Johannes Maschler (2019). Patient Scheduling in Particle Therapy.

Sigrid Gerger (2019). Automated Calculation of Optimal Adjustment Parameters for Myoelectric Hand Prostheses.

Christian Kloimüllner (2019). Algorithmic Approaches for Optimization Problems in Bike Sharing and Security Control.

PDF Cite Project

Andreas Windbichler (2019). A Heuristic Approach to Aircraft Trajectory Optimization with Constraints.

Günther Raidl (2019). VNS and PBIG as Optimization Cores in a Cooperative Optimization Approach for Distributing Service Points.

Nikolaus Frohner, Günther Raidl (2019). Towards Improving Merging Heuristics for Binary Decision Diagrams.

Eduard Eiben, Robert Ganian, Stefan Szeider (2019). The Parameterized Complexity of Cascading Portfolio Scheduling.

PDF Cite Project

Jan Niclas Dreier, Janosch Fuchs, Tim A. Hartmann, Philipp Kuinke, Peter Rossmanith, Bjoern Tauer, Hung-Lung Wang (2019). The Complexity of Packing Edge-Disjoint Paths.

Martin Riedler, Mario Ruthmair, Günther Raidl (2019). Strategies for Iteratively Refining Layered Graph Models.

Eduard Eiben, Robert Ganian, Dusan Knop and Sebastian Ordyniak (2019). Solving integer quadratic programming via explicit and structural restrictions.

PDF Cite Project

Robert Ganian (2019). Solving Integer Linear Programs by Exploiting Variable-Constraint Interactions: A Survey.

PDF Cite Project

Hoffmann-Ostenhof, Arthur, Jatschka, Thomas (2019). Snarks with Special Spanning Trees.

Robert Ganian, Petr Hlinen ́Y, Jaroslav Nesetril, Jan Obdrz\ĺek, Patrice Ossona De Mendez (2019). Shrub-Depth: Capturing Height of Dense Graphs.

PDF Cite Project

Castermans, Thom, Van Garderen, Mereke, Meulemans, Wouter, Martin Nöllenburg, Hai Xia (2019). Short Plane Supports for Spatial Hypergraphs.

Robert Ganian, Neha Lodha, Stefan Szeider (2019). SAT-Encodings for Treecut Width and Treedepth.

PDF Cite Project DOI

Kirill Simonov and Fedor v. Fomin and Petr A. Golovach and Fahad Panolan (2019). Refined Complexity of PCA with Outliers.

Tomas Peitl, Friedrich Slivovsky, Stefan Szeider (2019). Proof Complexity of Fragments of Long-Distance Q-resolution.

Bekos, Michael A., De Luca, Felice, Didimo, Walter, Mchedlidze, Tamara, Martin Nöllenburg, Symvonis, Antonios, Tollis, Ioannis (2019). Planar Drawings of Fixed-Mobile Bigraphs.

Nesic, Aleksandar, Blaicher, Matthias, Hoose, Tobias, Hofmann, Andreas, Lauermann, Matthias, Kutuvantavida, Yasar, Martin Nöllenburg, Randel, Sebastian, Freude, Wolfgang, Koos, Christian (2019). Photonic-integrated circuits with non-planar topologies realized by 3D-printed waveguide overpasses.

Martin Kronegger (2019). Parameterized Complexity of Asynchronous Border Minimization.

PDF Cite Project

Barth, Lukas, Gemsa, Andreas, Niedermann, Benjamin, Martin Nöllenburg (2019). On the Readability of Leaders in Boundary Labeling.

Daniël~Paulusma, Stefan Szeider (2019). On the Parameterized Complexity of (k,s)-SAT.

Johannes Maschler, Günther Raidl (2019). Multivalued Decision Diagrams for Prize-Collecting Job Sequencing with One Common and Multiple Secondary Resources.

Jan Niclas Dreier (2019). Motif Counting in Preferential Attachment Graphs.

De Col, Philipp, Klute, Fabian, Martin Nöllenburg (2019). Mixed Linear Layouts: Complexity, Heuristics, and Experiments.

Klute, Fabian, Martin Nöllenburg (2019). Minimizing crossings in constrained two-sided circular graph layouts.

Günther Raidl, Jakob Puchinger, Christian Blum (2019). Metaheuristic Hybrids.

Wu, Hsiang-Yun, Martin Nöllenburg, Sousa, Filipa L., Viola, Ivan (2019). Metabopolis: scalable network layout for biological pathway diagrams in urban map style.

Cite Project DOI

Hummel, Matthias, Klute, Fabian, Nickel, Soeren, Martin Nöllenburg (2019). Maximizing Ink in Partial Edge Drawings of k-plane Graphs.

Tomas Peitl, Friedrich Slivovsky, Stefan Szeider (2019). Long-Distance Q-Resolution with Dependency Schemes.

Kindermann, Philipp, Kobourov, Stephen, Löffler, Maarten, Martin Nöllenburg, Schulz, André, Vogtenhuber, Birgit (2019). Lombardi Drawings of Knots and Links.

Matthias Horn, Günther Raidl, Christian Blum (2019). Job Sequencing with One Common and Multiple Secondary Resources: An A*/Beam Search Based Anytime Algorithm.

Robert Ganian (2019). Integer Programming and Incidence Treedepth.

PDF Cite Project

Jan Niclas Dreier (2019). Hardness of FO Model-Checking on Random Graphs.

Eugenio Angriman, Van Der Grinten, Alexander, Von Looz, Moritz, Henning Meyerhenke, Martin Nöllenburg, Maria Predari, Charilaos Tzovas (2019). Guidelines for Experimental Algorithmics: A Case Study in Network Analysis.

PDF Cite Project DOI

Robert Ganian, Sebastian Ordyniak, C. S. Rahul (2019). Group Activity Selection with Few Agent Types.

PDF Cite Project

Marko Djukanovic, Günther Raidl, Christian Blum (2019). Finding Longest Common Subsequences: New A* Anytime Results.

Thekla Hamm (2019). Finding Linear Arrangements of Hypergraphs with Bounded Cutwidth in Linear Time.

PDF Cite Project DOI

Bekos, Michael A., Niedermann, Benjamin, Martin Nöllenburg (2019). External Labeling Techniques: A Taxonomy and Survey.

Klute, Fabian, Li, Guangping, Löffler, Raphael, Martin Nöllenburg, Schmidt, Manuela (2019). Exploring Semi-Automatic Map Labeling.

PDF Cite Project DOI

Marko Djukanovic, Günther Raidl, Christian Blum (2019). Exact and Heuristic Approaches for the Longest Common Palindromic Subsequence Problem.

Horiyama, Takashi, Klute, Fabian, Korman, Matias, Parada, Irene, Uehara, Ryuhei, Yamanaka, Katsuhisa (2019). Efficient Segment Folding is Hard.

Thomas Fenz, Klaus-Tycho Foerster, Stefan Schmid, Anaïs Villedieu (2019). Efficient Non-Segregated Routing for Reconfigurable Demand-Aware Networks.

Tomas Peitl, Friedrich Slivovsky, Stefan Szeider (2019). Dependency Learning for QBF.

Nickel, Soeren, Sondag, Max, Meulemans, Wouter, Chimani, Markus, Kobourov, Stephen, Peltonen, Jaakko, Martin Nöllenburg (2019). Computing Stable Demers Cartograms.

PDF Cite Project DOI

Stefan Szeider (2019). Compendium of Parameterized Problems at Higher Levels of the Polynomial Hierarchy.

Tomas Peitl, Friedrich Slivovsky, Stefan Szeider (2019). Combining Resolution-Path Dependencies with Dependency Learning.

Nikolaus Frohner, Stephan Teuschl, Günther Raidl (2019). Casual Employee Scheduling with Constraint Programming and Ant Colony Optimization.

Markus Brill and Piotr Faliszewski and Frank Sommer and Nimrod Talmon (2019). Approximation Algorithms for BalancedCC Multiwinner Rules.

Matthias Horn, Günther Raidl, Elina Rönnberg (2019). A* Search for Prize-Collecting Job Sequencing with One Common and Multiple Secondary Resources.

Stefan Szeider (2019). A SAT Approach to Branchwidth.

Christian Kloimüllner, Günther Raidl (2019). A Novel Approach for Solving Large-Scale Bike Sharing Station Planning Problems.

Benjamin Biesinger, Bin Hu, Günther Raidl (2019). A Memetic Algorithm for Competitive Facility Location Problems.

Benedikt Klocker, Herbert Fleischner, Günther Raidl (2019). A Lower Bound for the Smallest Uniquely Hamiltonian Planar Graph with Minimum Degree Three.

Robert Ganian, Sebastian Ordyniak, Stefan Szeider (2019). A Join-Based Hybrid Parameter for Constraint Satisfaction.

PDF Cite Project DOI

Djukanovic, Marko, Günther Raidl, Blum, Christian (2019). A Heuristic Approach for Solving the Longest Common Square Subsequence Problem.

Günther Raidl (2019). A Cooperative Optimization Approach for Distributing Service Points in Mobility Applications.

Blum, Christian, Thiruvady, Dhananjay, Ernst, Andreas T., Horn, Matthias, Günther Raidl (2019). A Biased Random Key Genetic Algorithm with Rollout Evaluations for the Resource Constraint Job Scheduling Problem.

Michael Höfler (2018). Methods for Intraday Scheduling in Particle Therapy.

Martin Riedler (2018). Advances in Decomposition Approaches for Mixed Integer Linear Programming.

Abraham Hinteregger (2018). Monero Chross-Chain Traceability.

Thomas Hackl (2018). Local Search Methods for the Particle Therapy Patient Scheduling Problem.

Gajo Gajic (2018). Parallel Hybrid Metaheuristics for Solving the Firefighter Problem Using the GPU.

Robert Ganian (2018). Unary Integer Linear Programming with Structural Restrictions.

Klute, Fabian, Martin Nöllenburg (2018). Towards Characterizing Strict Outerconfluent Graphs.

Robert Ganian (2018). The complexity landscape of decompositional parameters for ILP.

Eduard Eiben, Robert Ganian, Stefan Szeider (2018). Solving Problems on Graphs of High Rank-Width.

Eduard Eiben, Robert Ganian (2018). Small Resolution Proofs for QBF using Dependency Treewidth.

Markus Straub, Christian Rudloff, Anita Graser, Christian Kloimüllner, Günther Raidl, Markus Pajones, Felix Beyer (2018). Semi-Automated Location Planning for Urban Bike-Sharing Systems.

Yifan Hu, Luana Micallef, Martin Nöllenburg, Peter Rodgers (2018). Scalable Set Visualizations (Dagstuhl Seminar 17332).

Tomas Peitl (2018). QBF Encodings of Chess Problems.

Hoos, Holger H., Tomas Peitl, Slivovsky, Friedrich, Stefan Szeider (2018). Portfolio-Based Algorithm Selection for Circuit QBFs.

Hoos, Holger H., Tomas Peitl, Stefan Szeider (2018). Portfolio Solvers for QDIMACS and QCIR.

Tomas Peitl, Friedrich Slivovsky, Stefan Szeider (2018). Polynomial-Time Validation of QCDCL Certificates.

Chaplick, Steven, Chimani, Markus, Cornelsen, Sabine, Da Lozzo, Giordano, Martin Nöllenburg, Patrignani, Maurizio, Tollis, Ioannis G., Wolff, Alexander (2018). Planar L-Drawings of Directed Graphs.

Duncan, Christian A., Eppstein, David, Goodrich, Michael T., Kobourov, Stephen G., Löffler, Maarten, Martin Nöllenburg (2018). Planar and poly-arc Lombardi drawings.

Johannes Maschler, Günther Raidl (2018). Particle Therapy Patient Scheduling with Limited Starting Time Variations of Daily Treatments.

Robert Ganian, Iyad Kanj, Stefan Szeider (2018). Parameterized Algorithms for the Matrix Completion Problem.

Argyriou, Evmorfia, Cornelsen, Sabine, Förster, Henry, Kaufmann, Michael, Martin Nöllenburg, Okamoto, Yoshio, Raftopoulou, Chrysanthi, Wolff, Alexander (2018). Orthogonal and Smooth Orthogonal Layouts of 1-Planar Graphs with Low Edge Complexity.

Robert Ganian (2018). On the complexity of rainbow coloring problems.

Johannes Maschler, Günther Raidl (2018). Multivalued Decision Diagrams for a Prize-Collecting Sequencing Problem.

Fröschl, Theresa, Martin Nöllenburg (2018). Minimzing Wiggles in Storyline Visualizations.

Robert Ganian (2018). Meta-kernelization using well-structured modulators.

Jan Niclas Dreier (2018). Local Structure Theorems for Erdos-Rényi Graphs and Their Algorithmic Applications.

Airam Expósito, Günther Raidl, Julio Brito and José A. Moreno-Pérez (2018). GRASP-VNS for a Periodic VRP with Time Windows to Deal with Milk Collection.

Hu, Yifan, Martin Nöllenburg (2018). Graph Visualization.

Klocker, Benedikt, Fleischner, Herbert, Günther Raidl (2018). Finding Smooth Graphs with Small Independence Numbers.

Klawitter, Jonathan, Mchedlidze, Tamara, Martin Nöllenburg (2018). Experimental Evaluation of Book Drawing Algorithms.

Markus Leitner, Ivana Ljubić, Martin Riedler, Mario Ruthmair (2018). Exact approaches for the directed network design problem with relays.

Meyerhenke, Henning, Martin Nöllenburg, Schulz, Christian (2018). Drawing Large Graphs by Multilevel Maxent-Stress Optimization.

Marko Djukanovic, Günther Raidl, Christian Blum (2018). Anytime Algorithms for the Longest Common Palindromic Subsequence Problem.

Johannes K. Fichte, Markus Hecher, Stefan Szeider (2018). An SMT Approach to Fractional Hypertree Width.

Matthias Horn, Günther Raidl, Elina Rönnberg (2018). An A* Algorithm for Solving a Prize-Collecting Sequencing Problem with One Common and Multiple Secondary Resources and Time Windows.

Matthias Horn, Johannes Maschler, Günther Raidl, Elina Rönnberg (2018). A*-Based Construction of Decision Diagrams for a Prize-Collecting Scheduling Problem.

Wu, Hsiang-Yun, Martin Nöllenburg, Viola, Ivan (2018). A Visual Comparison of Hand-Drawn and Machine-Generated Human Metabolic Pathways.

Cite Project DOI

Robert Ganian (2018). A Structural Approach to Activity Selection.

Robert Ganian (2018). A single-exponential fixed-parameter algorithm for distance-hereditary vertex deletion.

Benedikt Klocker, Herbert Fleischner, Günther Raidl (2018). A SAT Approach for Finding Sup-Transition-Minors.

Benedikt Klocker, Herbert Fleischner, Günther Raidl (2018). A Model for Finding Transition-Minors.

Benjamin Biesinger, Bin Hu, Günther Raidl (2018). A Genetic Algorithm in Combination with a Solution Archive for Solving the Generalized Vehicle Routing Problem with Stochastic Demands.

Thomas Jatschka (2017). An Iterative Time-Bucket Refinement Algorithm for High Resolution Scheduling Problems.

Moritz Müller, Stefan Szeider (2017). The Treewidth of Proofs.

Haris Aziz, Péter Bir\ ́And Tamas Fleiner, Serge Gaspers, Ronald De Haan, Nicholas Mattei and Baharak Rastegari (2017). Stable Matching with Uncertain Pairwise Preferences.

Petrica C. Pop, Cosmin Sabo, Benjamin Biesinger, Bin Hu, Günther Raidl (2017). Solving the Two-State Fixed-Charge Transportation Problem with a Hybrid Genetic Algorithm.

Robert Ganian (2017). Solving Integer Linear Programs with a Small Number of Global Variables and Constraints.

Jayesh Choudhari, Anirban Dasgupta, Neeldhara Misra, M. S. Ramanujan (2017). Saving Critical Nodes with Firefighters is FPT.

Neha Lodha, Sebastian Ordyniak, Stefan Szeider (2017). SAT-Encodings for Special Treewidth and Pathwidth.

PDF Cite Project DOI

Johannes K. Fichte, Neha Lodha, Stefan Szeider (2017). SAT-Based Local Improvement for Finding Tree Decompositions of Small Width.

Stefan Szeider (2017). Rigging Nearly Acyclic Tournaments Is Fixed-Parameter Tractable.

(2017). Recent Trends in Knowledge Compilation (Dagstuhl Seminar 17381).

Niedermann, Benjamin, Martin Nöllenburg, Rutter, Ignaz (2017). Radial Contour Labeling with Straight Leaders.

Bruckdorfer, Till, Cornelsen, Sabine, Gutwenger, Carsten, Kaufmann, Michael, Montecchiani, Fabrizio, Martin Nöllenburg, Wolff, Alexander (2017). Progress on Partial Edge Drawings.

Gregory Gutin, M. S. Ramanujan, Felix Reidl, Magnus Wahlström (2017). Path-Contractions, Edge Deletions and Connectivity Preservation.

Martin Nöllenburg, Prutkin, Roman, Rutter, Ignaz (2017). Partitioning Graph Drawings and Triangulated Simple Polygons into Greedily Routable Regions.

Maschler, Johannes, Riedler, Martin, Günther Raidl (2017). Particle Therapy Patient Scheduling: Time Estimation to Schedule Sets of Treatments.

Haris Aziz, Ronald De Haan, Baharak Rastegari (2017). Pareto Optimal Allocation under Uncertain Preferences (Extended Abstract).

Haris Aziz, Ronald De Haan, Baharak Rastegari (2017). Pareto Optimal Allocation under Uncertain Preferences.

Mark Jones and Daniel Lokshtanov and M. S. Ramanujan and Saket Saurabh and Ondrej Suchý (2017). Parameterized Complexity of Directed Steiner Tree on Sparse Graphs.

Ronald De Haan, Stefan Szeider (2017). Parameterized Complexity Classes Beyond Para-NP.

De Haan, Ronald, Kanj, Iyad, Stefan Szeider (2017). On the parameterized complexity of finding small unsatisfiable subsets of CNF formulas and CSP instances.

Robert Ganian (2017). On Structural Parameterizations of the Edge Disjoint Paths Problem.

Robert Ganian, Stefan Szeider (2017). New Width Parameters for Model Counting.

Rémy Belmonte and Fedor v. Fomin and Petr A. Golovach and M. S. Ramanujan (2017). Metric Dimension of Bounded Tree-length Graphs.

Daniel Lokshtanov and Fahad Panolan and M. S. Ramanujan and Saket Saurabh (2017). Lossy kernelization.

Ramanujan, M. S., Saurabh, Saket (2017). Linear-Time Parameterized Algorithms via Skew-Symmetric Multicuts.

Fahad Panolan, Pranabendu Misra, M. S. Ramanujan and Saket Saurabh (2017). Linear Representation of Transversal Matroids and Gammoids parameterized by rank.

Evelia Lizárraga, Maria J. Blesa, Günther Raidl (2017). Large Neighborhood Search for the Most Strings with Few Bad Columns Problem.

Jakub Gajarský and Petr Hlinený and Jan Obdrzálek and Sebastian Ordyniak and Felix Reidl and Peter Rossmanith and Fernando Sánchez Villaamil and Somnath Sikdar (2017). Kernelization using structural parameters on sparse graph classes.

Matthias Horn, Günther Raidl, Christian Blum (2017). Job Sequencing with One Common and Multiple Secondary Resources: A Problem Motivated from Particle Therapy for Cancer Treatment.

Jiehua Chen (2017). How many variables are needed to express an existential positive query?.

Daniel Lokshtanov, Pranabendu Misra, M. S. Ramanujan and Saket Saurabh (2017). Hitting (Selected) Odd Cycles.

Christian Kloimüllner, Günther Raidl (2017). Hierarchical Clustering and Multilevel Refinement for the Bike-Sharing Station Planning Problem.

Simone Bova, Fabio Mogavero (2017). Herbrand Property: Finite Quasi-Herbrand Models and Lifting Chandra-Merlin Theorem to Quantified Conjunctive Queries.

Airam Expósito, Günther Raidl, Julio Brito and José A. Moreno-Pérez (2017). GRASP and VNS for a Periodic VRP with Time Windows to Deal with Milk Collection.

Robert Ganian (2017). Going Beyond Primal Treewidth for (M)ILP.

Kloimüllner, Christian, Günther Raidl (2017). Full-Load Route Planning for Balancing Bike Sharing Systems by Logic-Based Benders Decomposition.

Stefano Aguzzoli, Simone Bova, Diego Valota (2017). Free Weak Nilpotent Minimum Algebras.

Rajesh Chitnis and Fedor v. Fomin and Daniel Lokshtanov and Pranabendu Misra and M. S. Ramanujan and Saket Saurabh (2017). Faster exact algorithms for some terminal set problems.

Martin Nöllenburg, Prutkin, Roman (2017). Euclidean Greedy Drawings of Trees.

Kim, Bong-Min, Kloimüllner, Christian, Günther Raidl (2017). Efficient Consideration of Soft Time Windows in a Large Neighborhood Search for the Districting and Routing Problem for Security Control.

Robert Ganian (2017). Discovering Archipelagos of Tractability for Constraint Satisfaction and Counting.

Gadiraju, Ujwal, Möller, Sebastian, Martin Nöllenburg, Saupe, Dietmar, Egger-Lampl, Sebastian, Archambault, Daniel, Fisher, Brian (2017). Crowdsourcing Versus the Laboratory: Towards Human-Centered Experiments Using the Crowd.

Ronald De Haan (2017). Complexity Results for Manipulation, Bribery and Control of the Kemeny Judgment Aggregation Procedure.

Ronald De Haan, Marija Slavkovik (2017). Complexity Results for Aggregating Judgments using Scoring or Distance-Based Procedures.

Robert Ganian, M. S. Ramanujan, Stefan Szeider (2017). Combining Treewidth and Backdoors for CSP.

Simone Bova, Stefan Szeider (2017). Circuit Treewidth, Sentential Decision, and Query Compilation.

Stefan Szeider (2017). Backdoors into heterogeneous classes of SAT and CSP.

Robert Ganian, M. S. Ramanujan, Stefan Szeider (2017). Backdoor Treewidth for SAT.

Stefan Szeider (2017). Backdoor Trees for Answer Set Programming.

Stefan Szeider (2017). Backdoor Sets for CSP.

Frederico Dusberger, Günther Raidl (2017). A Scalable Approach for the K-Staged Two-Dimensional Cutting Stock Problem.

Johannes Maschler, Günther Raidl (2017). A Logic-Based Benders Decomposition Approach for the 3-Staged Strip Packing Problem.

Daniel Lokshtanov, M. S. Ramanujan, Saket Saurabh (2017). A Linear-Time Parameterized Algorithm for Node Unique Label Cover.

Michael Prischink (2016). Metaheuristics for the Districting and Routing Problem for Security Control.

Benjamin Biesinger (2016). Complete Solution Archives for Evolutionary Combinatorial Optimization: Application to a Competitive Facility Location and Stochastic Vehicle Routing Problem.

Franz Leberl (2016). Column Generation at Strip Level for the k-Staged Two-Dimensional Cutting Stock Problem.

Carina Schwab (2016). Visibility Based Obstacle Placing -- Automated Obstacle Placing Based on Circularity.

Petr Hlinený and O-Joung Kwon and Jan Obdrzálek and Sebastian Ordyniak (2016). Tree-depth and vertex-minors.

Günther Raidl, Thomas Jatschka, Martin Riedler, Johannes Maschler (2016). Time-Bucket Relaxation Based Mixed Integer Programming Models for Scheduling Problems: A Promising Starting Point for Matheuristics.

Barth, Lukas, Niedermann, Benjamin, Martin Nöllenburg, Strash, Darren (2016). Temporal Map Labeling: A New Unified Framework with Experiments.

Ulle Endriss, Umberto Grandi, Ronald De Haan, Jérôme Lang (2016). Succinctness of Languages for Judgment Aggregation.

Ashutosh Rai and M. S. Ramanujan (2016). Strong Parameterized Deletion: Bipartite Graphs.

Eppstein, David, Holten, Danny, Löffler, Maarten, Martin Nöllenburg, Speckmann, Bettina, Verbeek, Kevin (2016). Strict Confluent Drawing.

Haris Aziz, Peter Biro, Serge Gaspers, Ronald De Haan, Nicholas Mattei, Baharak Rastegari (2016). Stable Matching with Uncertain Linear Preferences.

Stefan Szeider (2016). Soundness of Q-resolution with dependency schemes.

Martin Riedler, Günther Raidl (2016). Solving a Selective Dial-a-Ride Problem with Logic-based Benders Decomposition.

Martin Nöllenburg, Rutter, Ignaz, Schuhmacher, Alfred (2016). Software Visualization via Hierarchic Micro/Macro Layouts.

Guillaume Blin and Marie Gasparoux and Sebastian Ordyniak and Alexandru Popa (2016). SOBRA - Shielding Optimization for BRAchytherapy.

Simone Bova (2016). SDDs Are Exponentially More Succinct than OBDDs.

Slivovsky, Friedrich, Stefan Szeider (2016). Quantifier reordering for QBF.

Simone Bova, Robert Ganian, Stefan Szeider (2016). Quantified Conjunctive Queries on Partially Ordered Sets.

(2016). Proc. 24th International Symposium on Graph Drawing and Network Visualization (GD'16).

Simone Bova, Ronald De Haan, Neha Lodha, Stefan Szeider (2016). Positive and Negative Results for Parameterized Compilability.

Robert Ganian (2016). Polynomial-Time Construction of Optimal MPI Derived Datatype Trees.

Johannes Maschler, Martin Riedler, Markus Stock, Günther Raidl (2016). Particle Therapy Patient Scheduling: First Heuristic Approaches.

PDF Cite Project

Manu Basavaraju and Mathew C. Francis and M. S. Ramanujan and Saket Saurabh (2016). Partially Polynomial Kernels for Set Cover and Test Cover.

De Haan, Ronald (2016). Parameterized Complexity Results for the Kemeny Rule in Judgment Aggregation.

Ulle Endriss, Ronald De Haan, Stefan Szeider (2016). Parameterized Complexity Results for Agenda Safety in Judgment Aggregation.

Ronald De Haan, Stefan Szeider (2016). Parameterized Complexity Results for Symbolic Model Checking of Temporal Logics.

Ronald De Haan (2016). Parameterized Complexity in the Polynomial Hierarchy.

Robert Ganian, N.S. Narayanaswamy, Sebastian Ordyniak, C.S. Rahul, Ramanujan M. S. (2016). On the Complexity Landscape of Connected f-factor Problems.

Martin Nöllenburg, Prutkin, Roman, Rutter, Ignaz (2016). On Self-Approaching and Increasing-Chord Drawings of 3-Connected Planar Graphs.

Robert Ganian, Ronald De Haan, Iyad Kanj, Stefan Szeider (2016). On Existential MSO and its Relation to ETH.

Hoong Chuin Lau, Günther Raidl, Pascal Van Hentenryck (2016). New Developments in Metaheuristics and their Applications -- Selected Extended Contributions from the 10th Metaheuristics International Conference (MIC~2013).

Benjamin Biesinger, Bin Hu, Günther Raidl (2016). Models and Algorithms for Competitive Facility Location Problems with Different Customer Behavior.

Daniël Paulusma, Stefan Szeider (2016). Model Counting for CNF Formulas of Bounded Modular Treewidth.

Simone Bova, Robert Ganian, Stefan Szeider (2016). Model Checking Existential Logic on Partially Ordered Sets.

Cite Project DOI

Löffler, Maarten, Martin Nöllenburg, Staals, Frank (2016). Mixed Map Labeling.

Robert Ganian, Friedrich Slivovsky, Stefan Szeider (2016). Meta-Kernelization with Structural Parameters.

Simone Bova and Florent Capelli and Stefan Mengel and Friedrich Slivovsky (2016). Knowledge Compilation Meets Communication Complexity.

Christian Blum, Günther Raidl (2016). Hybrid Metaheuristics -- Powerful Tools for Optimization.

PDF Cite Project

Robert Ganian, Petr Hlinen ́Y, Daniel Kr\ál, Jan Obdrz\'ék, Jarett Schwartz, Jakub Teska (2016). FO Model Checking of Interval Graphs.

Benedikt Klocker, Herbert Fleischner, Günther Raidl (2016). Finding Uniquely Hamiltonian Graphs of Minimum Degree Three with Small Crossing Numbers.

Mchedlidze, Tamara, Martin Nöllenburg, Rutter, Ignaz (2016). Extending Convex Partial Drawings of Graphs.

Gemsa, Andreas, Martin Nöllenburg, Rutter, Ignaz (2016). Evaluation of Labeling Strategies for Rotating Maps.

Michal Kotrbčík and Rastislav Královič and Sebastian Ordyniak (2016). Edge-Editing to a Dense and a Sparse Graph Class.

Michael Prischink, Christian Kloimüllner, Benjamin Biesinger, Günther Raidl (2016). Districting and Routing for Security Control.

Viktor Engelmann and Sebastian Ordyniak and Stephan Kreutzer (2016). Directed elimination games.

Eduard Eiben, Robert Ganian, Kustaa Kangas, Sebastian Ordyniak (2016). Counting Linear Extensions: Parameterizations by Treewidth.

Gemsa, Andreas, Martin Nöllenburg, Rutter, Ignaz (2016). Consistent Labeling of Rotating Maps.

Christian Blum, Günther Raidl (2016). Computational Performance Evaluation of Two Integer Linear Programming Models for the Minimum Common String Partition Problem.

Ronald De Haan (2016). Complexity Results for Manipulation, Bribery and Control of the Kemeny Procedure in Judgment Aggregation.

Stephan Kreutzer and Sebastian Ordyniak (2016). Complexity and monotonicity results for domination games.

Bernhard Bliem and Sebastian Ordyniak and Stefan Woltran (2016). Clique-Width and Directed Width Measures for Answer-Set Programming.

Robert Ganian, M.S. Ramanujan, Stefan Szeider (2016). Backdoors to Tractable Valued CSP.

Serge Gaspers, Sebastian Ordyniak and M. S. Ramanujan, Saket Saurabh, Stefan Szeider (2016). Backdoors to q-Horn.

Arne Meier, Sebastian Ordyniak, Ramanujan Sridharan, Irena Schindler (2016). Backdoors for Linear Temporal Logic.

Robert Ganian, Petr Hlinen ́Y, Joachim Kneis, Daniel Meister, Jan Obdrz\ĺek, Peter Rossmanith, Somnath Sikdar (2016). Are There Any Good Digraph Measures?.

Benjamin Biesinger, Bin Hu, Günther Raidl (2016). An Integer L-shaped Method for the Generalized Vehicle Routing Problem with Stochastic Demands.

Niedermann, Benjamin, Martin Nöllenburg (2016). An Algorithmic Framework for Labeling Road Maps.

Buchin, Kevin, Eppstein, David, Löffler, Maarten, Martin Nöllenburg, Silveira, Rodrigo I. (2016). Adjacency-Preserving Spatial Treemaps.

Ashutosh Rai and M. S. Ramanujan and Saket Saurabh (2016). A Parameterized Algorithm for Mixed-Cut.

Jakub Gajarský and Petr Hlinený and Jan Obdrzálek and Daniel Lokshtanov and M. S. Ramanujan (2016). A New Perspective on FO Model Checking of Dense Graph Classes.

Christian Schauer, Günther Raidl (2016). A Multi-Commodity Flow Based Model for Multi Layer Hierarchical Ring Network Design.

Johannes Inführ, Günther Raidl (2016). A Memetic Algorithm for the Virtual Network Mapping Problem.

M. S. Ramanujan (2016). A Faster Parameterized Algorithm for Group Feedback Edge Set.

Bernhard Bonigl (2016). A Branch-and-Bound Approach for the Constrained k-Staged 2-Dimensional Cutting Stock Problem.

Christoph Wachter (2015). Solving the Travelling Thief Problem with an Evolutionary Algorithm.

Katharina Ölsböck (2015). Electric Vehicles Recharge Scheduling with Logic-Based Benders Decomposition.

Benedikt Klocker (2015). Optimization Approaches for Recreational Bicycle Tour Planning.

Krenek, Thorsten, Bacher, Christopher, Lauer, Thomas, Günther Raidl (2015). Numerische Optimierung elektrifizierter Antriebsstränge.

Krenek, Thorsten, Bacher, Christopher, Lauer, Thomas, Günther Raidl (2015). Numerical Optimisation of Electro-Hybrid Powertrains.

Martin Kronegger (2015). Variable-Deletion Backdoors to Planning.

Andreev, Simeon, Dibbelt, Julian, Martin Nöllenburg, Pajor, Thomas, Wagner, Dorothea (2015). Towards Realistic Pedestrian Route Planning.

Mchedlidze, Tamara, Martin Nöllenburg, Rutter, Ignaz, Wagner, Dorothea, Wegner, Franziska (2015). Towards Realistic Flow Control in Power Grid Operation.

Simone Bova, Jiehua Chen (2015). The complexity of equivalence, entailment, and minimization in existential positive logic.

Georg Brandstätter (2015). Solving the Multi-Objective Steiner Tree Problem with Resources.

Frederico Dusberger, Günther Raidl (2015). Solving the 3-Staged 2-Dimensional Cutting Stock Problem by Dynamic Programming and Variable Neighborhood Search.

Fedor v. Fomin and Daniel Lokshtanov and Neeldhara Misra and M. S. Ramanujan and Saket Saurabh (2015). Solving d-SAT via Backdoors to Small Treewidth.

Daniel Lokshtanov and Amer E. Mouawad and Fahad Panolan and M. S. Ramanujan and Saket Saurabh (2015). Reconfiguration on Sparse Graphs.

Klemz, Boris, Martin Nöllenburg, Prutkin, Roman (2015). Recognizing Weighted Disk Contact Graphs.

Rainer-Harbach, Marian, Papazek, Petrina, Günther Raidl, Hu, Bin, Kloimüllner, Christian (2015). PILOT, GRASP, and VNS Approaches for the Static Balancing of Bicycle Sharing Systems.

PDF Cite Project DOI

Stefan Szeider (2015). Parameterized and subexponential-time complexity of satisfiability problems and applications.

Jakub Gajarský and Michael Lampis and Kazuhisa Makino and Valia Mitsou and Sebastian Ordyniak (2015). Parameterized Algorithms for Parity Games.

Leibfried, Thomas, Mchedlidze, Tamara, Meyer-Hübner, Nico, Martin Nöllenburg, Rutter, Ignaz, Sanders, Peter, Wagner, Dorothea, Wegner, Franziska (2015). Operating Power Grids with Few Flow Control Buses.

Barth, Lukas, Gemsa, Andreas, Niedermann, Benjamin, Martin Nöllenburg (2015). On the Readability of Boundary Labeling.

Fahad Panolan and M. S. Ramanujan and Saket Saurabh (2015). On the Parameterized Complexity of Girth and Connectivity Problems on Linear Matroids.

Christian Schauer, Günther Raidl (2015). On the Comparison of Decoding Strategies for a Memetic Algorithm for the Multi-Layer Hierarchical Ring Network Design Problem.

Evelia Lizárraga, Maria J. Blesa, Christian Blum, Günther Raidl (2015). On Solving the Most Strings With Few Bad Columns Problem: An ILP Model and Heuristics.

Kostitsyna, Irina, Martin Nöllenburg, Polishchuk, Valentin, Schulz, André, Strash, Darren (2015). On Minimizing Crossings in Storyline Visualizations.

Stefan Szeider (2015). On finding optimal polytrees.

Simone Bova and Friedrich Slivovsky (2015). On Compiling Structured CNFs to OBDDs.

Simone Bova and Florent Capelli and Stefan Mengel and Friedrich Slivovsky (2015). On Compiling CNFs into Structured Deterministic DNNFs.

Gemsa, Andreas, Haunert, Jan-Henrik, Martin Nöllenburg (2015). Multi-Row Boundary-Labeling Algorithms for Panorama Images.

Rémy Belmonte and Fedor v. Fomin and Petr A. Golovach and M. S. Ramanujan (2015). Metric Dimension of Bounded Width Graphs.

Alan Tus, Andrea Rendl, Günther Raidl (2015). Metaheuristics for the Two-Dimensional Container Pre-Marshalling Problem.

Gerhard Hiermann, Matthias Prandtstetter, Andrea Rendl, Jakob Puchinger, Günther Raidl (2015). Metaheuristics for Solving a Multimodal Home-Healthcare Scheduling Problem.

Bekos, Michael, Cornelsen, Sabine, Simon Dominik Fink, Hong, Seok-Hee, Kaufmann, Michael, Martin Nöllenburg, Rutter, Ignaz, Symvonis, Antonios (2015). Many-to-One Boundary Labeling with Backbones.

Stefan Szeider (2015). Machine Characterizations for Parameterized Complexity Classes Beyond Para-NP.

Daniel Lokshtanov and M. S. Ramanujan and Saket Saurabh (2015). Linear Time Parameterized Algorithms for Subset Feedback Vertex Set.

Gemsa, Andreas, Niedermann, Benjamin, Martin Nöllenburg (2015). Label Placement in Road Maps.

Robert Ganian (2015). Improving Vertex Cover as a Graph Parameter.

Michael Abseher, Frederico Dusberger, Nysret Musliu, Stefan Woltran (2015). Improving the Efficiency of Dynamic Programming on Tree Decompositions via Machine Learning.

Christoph Weiler, Benjamin Biesinger, Bin Hu, Günther Raidl (2015). Heuristic Approaches for the Probabilistic Traveling Salesman Problem.

Jakub Gajarský and Petr Hlinený and Daniel Lokshtanov and Jan Obdrzálek and Sebastian Ordyniak and M. S. Ramanujan and Saket Saurabh (2015). FO Model Checking on Posets of Bounded Width.

Ronald De Haan, Martin Kronegger, Andreas Pfandler (2015). Fixed-parameter Tractable Reductions to SAT for Planning.

Simone Bova and Barnaby Martin (2015). First-Order Queries on Finite Abelian Groups.

Esha Ghosh and Sudeshna Kolay and Mrinal Kumar and Pranabendu Misra and Fahad Panolan and Ashutosh Rai and M. S. Ramanujan (2015). Faster Parameterized Algorithms for Deletion to Split Graphs.

Markus Leitner, Ivana Ljubić, Martin Riedler, Mario Ruthmair (2015). Exact Approaches for Network Design Problems with Relays.

Brandes, Ulrik, Finocchi, Irene, Martin Nöllenburg, Quigley, Aaron (2015). Empirical Evaluation for Graph Drawing (Dagstuhl Seminar 15052).

Günther Raidl (2015). Decomposition Based Hybrid Metaheuristics.

David Markvica, Christian Schauer, Günther Raidl (2015). CPU Versus GPU Parallelization of an Ant Colony Optimization for the Longest Common Subsequence Problem.

Michael Abseher, Bernhard Bliem, Günther Charwat, Frederico Dusberger, Stefan Woltran (2015). Computing secure sets in graphs using answer set programming.

Ulle Endriss, Ronald De Haan (2015). Complexity of the Winner Determination Problem in Judgment Aggregation: Kemeny, Slater, Tideman, Young.

Robert Ganian, Stefan Szeider (2015). Community Structure Inspired Algorithms for SAT and #SAT.

Klawitter, Jonathan, Martin Nöllenburg, Ueckerdt, Torsten (2015). Combinatorial Properties of Triangle-Free Rectangle Arrangements and the Squarability Problem.

Stefan Szeider (2015). Backdoors to Tractable Answer Set Programming.

Johannes Klaus Fichte, Stefan Szeider (2015). Backdoors to Normality for Disjunctive Logic Programs.

De Haan, Ronald (2015). An Overview of Non-Uniform Parameterized Complexity.

Benjamin Biesinger, Bin Hu, Günther Raidl (2015). A Variable Neighborhood Search for the Generalized Vehicle Routing Problem with Stochastic Demands.

PDF Cite Project

Frederico Dusberger, Günther Raidl (2015). A Value-Correction Construction Heuristic for the Two-Dimensional Cutting Stock Problem with Variable Sheet Size.

Frederico Dusberger, Günther Raidl (2015). A Scalable Approach for the K-Staged Two-Dimensional Cutting Stock Problem with Variable Sheet Size.

Stefan Szeider (2015). A SAT Approach to Clique-Width.

Christopher Bacher, Günther Raidl, Thorsten Krenek (2015). A New Type of Metamodel for Longitudinal Dynamics Optimization of Hybrid Electric Vehicles.

Bin Hu, Andreas Windbichler, Günther Raidl (2015). A New Solution Representation for the Firefighter Problem.

Benjamin Biesinger, Bin Hu, Günther Raidl (2015). A Hybrid Genetic Algorithm with Solution Archive for the Discrete (r|p)-Centroid Problem.

Cite Project DOI

Matthias Lanzinger, Benjamin Biesinger, Bin Hu, Günther Raidl (2015). A Genetic Algorithm for the Capacity and Distance Constrained Plant Location Problem.

Ronald De Haan, Jakub Szymanik (2015). A Dichotomy Result for Ramsey Quantifiers.

Bäckström, Christer, Jonsson, Peter, Ordyniak, Sebastian, Stefan Szeider (2015). A complete parameterized complexity analysis of bounded planning.

Christian Kloimüllner, Petrina Papazek, Günther Raidl (2015). A Cluster-First Route-Second Approach for Balancing Bicycle Sharing Systems.

Alan Tus (2014). Heuristic Solution Approaches for the Two Dimensional Pre-Marshalling Problem.

Patrick Klaffenboeck (2014). Pfadsuche in einer Triangulation Reduction im Mammoth Massive Multiplayer Online Research Framework.

Martin Nöllenburg (2014). A survey on automated metro map layout methods.

David Markvica (2014). Finding Longest Common Subsequences by GPU-Based Parallel Ant Colony Optimization.

Dietmar Trummer (2014). Applying Ant Colony Optimization to the Periodic Vehicle Routing Problem with Time Windows.

Gilbert Fritz (2014). A Hybrid Algorithm for the Partition Coloring Problem.

Geevarghese Philip and M. S. Ramanujan (2014). Vertex Exponential Algorithms for Connected f-Factors.

Grujicic, Igor, Günther Raidl, Schöbel, Andreas (2014). Variable Neighbourhood Search for Integrated Timetable Design of Railway Infrastructure.

Stefan Szeider (2014). Variable Dependencies and Q-Resolution.

Simone Bova and Leonardo Manuel Cabrer (2014). Unification and Projectivity in De Morgan and Kleene Algebras.

Stefan Szeider (2014). Tractable answer-set programming with weight constraints: bounded treewidth is not enough.

De Haan, Ronald, Stefan Szeider (2014). The Parameterized Complexity of Reasoning Problems Beyond NP.

Jiehua Chen (2014). The Complexity of Width Minimization for Existential Positive Queries.

Ronald De Haan, Iyad A. Kanj, Stefan Szeider (2014). Subexponential Time Complexity of CSP with Global Constraints.

Günther Raidl, Thomas Baumhauer, Bin Hu (2014). Speeding up Logic-Based Benders' Decomposition by a Metaheuristic for a Bi-Level Capacitated Vehicle Routing Problem.

Stefan Szeider (2014). Small Unsatisfiable Subsets in Constraint Satisfaction.

Athenstädt, Jan Christoph, Hartmann, Tanja, Martin Nöllenburg (2014). Simultaneous Embeddability of Two Partitions.

Barth, Lukas, Fabrikant, Sara Irina, Kobourov, Stephen G., Lubiw, Anna, Martin Nöllenburg, Okamoto, Yoshio, Pupyrev, Sergey, Squarcella, Claudio, Ueckerdt, Torsten, Wolff, Alexander (2014). Semantic Word Cloud Representations: Hardness and Approximation Algorithms.

Jankun-Kelly, T. J., Dwyer, Tim, Holten, Danny, Hurter, Christophe, Martin Nöllenburg, Weaver, Chris, Xu, Kai (2014). Scalability Considerations for Multivariate Graph Visualization.

Bacher, Christopher, Krenek, Thorsten, Günther Raidl (2014). Reducing the Number of Simulations in Operation Strategy Optimization for Hybrid Electric Vehicles.

Bläsius, Thomas, Klute, Fabian, Niedermann, Benjamin, Martin Nöllenburg (2014). PIGRA -- A Tool for Pixelated Graph Representations.

Sudeshna Kolay and Pranabendu Misra and M. S. Ramanujan and Saket Saurabh (2014). Parameterized Approximations via d-Skew-Symmetric Multicut.

Manu Basavaraju and Fedor v. Fomin and Petr A. Golovach and Pranabendu Misra and M. S. Ramanujan and Saket Saurabh (2014). Parameterized Algorithms to Preserve Connectivity.

Manu Basavaraju and Fahad Panolan and Ashutosh Rai and M. S. Ramanujan and Saket Saurabh (2014). On the Kernelization Complexity of String Problems.

Klemz, Boris, Mchedlidze, Tamara, Martin Nöllenburg (2014). Minimum Tree Supports for Hypergraphs and Low-Concurrency Euler Diagrams.

Robert Ganian (2014). Lower bounds on the complexity of MSO1 model-checking.

Gaspers, Serge, Stefan Szeider (2014). Guarantees and limits of preprocessing in constraint satisfaction and reasoning.

Stefan Szeider (2014). Fixed-Parameter Tractable Reductions to SAT.

Jakub Gajarský and Jan Obdrzálek and Sebastian Ordyniak and Felix Reidl and Peter Rossmanith and Fernando Sanchez Villaamil and Somnath Sikdar (2014). Finite Integer Index of Pathwidth and Treewidth.

Daniel Lokshtanov and N. S. Narayanaswamy and Venkatesh Raman and M. S. Ramanujan and Saket Saurabh (2014). Faster Parameterized Algorithms Using Linear Programming.

Jakub Gajarský and Petr Hlinený and Jan Obdrzálek and Sebastian Ordyniak (2014). Faster Existential FO Model Checking on Posets.

Robert Ganian (2014). Digraph width measures in parameterized algorithmics.

Günther Raidl (2014). Boosting an Exact Logic-Based Benders Decomposition Approach by Variable Neighborhood Search.

Christian Kloimüllner, Petrina Papazek, Bin Hu, Günther Raidl (2014). Balancing Bicycle Sharing Systems: An Approach for the Dynamic Case.

PDF Cite Project DOI

Papazek, Petrina, Kloimüllner, Christian, Hu, Bin, Günther Raidl (2014). Balancing Bicycle Sharing Systems: An Analysis of Path Relinking and Recombination within a GRASP Hybrid.

PDF Cite Project DOI

Martin Kronegger (2014). Backdoors to Planning.

Benjamin Biesinger, Bin Hu, Günther Raidl (2014). An Evolutionary Algorithm for the Leader-Follower Facility Location Problem with Proportional Customer Behavior.

PDF Cite Project

Stefan Misković, Zorica Stanimirović, Igor Grujicic (2014). An Efficient Variable Neighborhood Search Solving a Robust Dynamic Facility Location Problem in Emergency Service Network.

Frederico Dusberger, Günther Raidl (2014). A Variable Neighborhood Search Using Very Large Neighborhood Structures for the 3-Staged 2-Dimensional Cutting Stock Problem.

Sebastian Ordyniak and Alexandru Popa (2014). A Parameterized Study of Maximum Generalized Pattern Matching Problems.

Grujicic, Igor, Günther Raidl, Schöbel, Andreas, Besau, Gerhard (2014). A Metaheuristic Approach for Integrated Timetable based Design of Railway Infrastructure.

Thomas Petelin (2013). Two-Phase Local Search for the Bi-objective Connected Facility Location Problem.

Roman Karl (2013). The Rooted Delay-Constrained Steiner Tree Problem with Uncertain Delays.

Andreas Pinter (2013). Balancing Bike Sharing Systems.

Inführ, Johannes (2013). Optimization Challenges of the Future Federated Internet.

Christopher Bacher (2013). Metaheuristic Optimization of Electro-Hybrid Powertrains Using Machine Learning Techniques.

Markus Putzenlechner (2013). Analyse und Implementierung von Fallzusammenführungen diagnosebezogener Fallgruppen aus Sicht eines Krankenhausinformationssystems.

Claus-Dieter Volko (2013). Selective Graph Coloring Problem.

Thomas Schnabl (2013). Critical Links Detection using CUDA.

Peter Jahrmann (2013). Metaheuristics for the Regenerator Location Problem.

Athenstädt, Jan Christoph, Görke, Robert, Krug, Marcus, Martin Nöllenburg (2013). Visualizing Large Hierarchically Clustered Graphs with a Landscape Metaphor.

Johannes Inführ, David Stezenbach, Matthias Hartmann, Kurt Tutschku, Günther Raidl (2013). Using Optimized Virtual Network Embedding for Network Dimensioning.

Biedl, Therese, Bläsius, Thomas, Niedermann, Benjamin, Martin Nöllenburg, Prutkin, Roman, Rutter, Ignaz (2013). Using ILP/SAT to determine pathwidth, visibility representations, and other grid-based graph drawings.

Neeldhara Misra, Sebastian Ordyniak, Venkatesh Raman, Stefan Szeider (2013). Upper and Lower Bounds for Weak Backdoor Set Detection.

Gemsa, Andreas, Niedermann, Benjamin, Martin Nöllenburg (2013). Trajectory-Based Dynamic Map Labeling.

Stefan Szeider (2013). The Parameterized Complexity of Constraint Satisfaction and Reasoning.

Stefan Szeider (2013). The Complexity of Repairing, Adjusting, and Aggregating of Extensions in Abstract Argumentation.

Stefan Szeider (2013). Strong Backdoors to Bounded Treewidth SAT.

Markus Leitner, Mario Ruthmair, Günther Raidl (2013). Stabilizing Branch-and-Price for Constrained Tree Problems.

Johannes Inführ, Günther Raidl (2013). Solving the Virtual Network Mapping Problem with Construction Heuristics, Local Search and Variable Neighborhood Descent.

Sebastian Ordyniak, Stefan Szeider (2013). Satisfiability of acyclic and almost acyclic CNF formulas.

Moritz Müller, Stefan Szeider (2013). Revisiting Space in Proof Complexity: Treewidth and Pathwidth.

Benjamin Biesinger, Christian Schauer, Bin Hu, Günther Raidl (2013). Reconstructing Cross Cut Shredded Documents with a Genetic Algorithm with Solution Archive.

PDF Cite Project

(2013). Proceedings of the 10th Metaheuristics International Conference.

Simone Bova and Franco Montagna (2013). Polynomial space hardness without disjunction property.

Löffler, Maarten, Martin Nöllenburg (2013). Planar Lombardi Drawings of Outerpaths.

Ronald De Haan, Anna Roubickova, Stefan Szeider (2013). Parameterized Complexity Results for Plan Reuse.

Sebastian Ordyniak, Stefan Szeider (2013). Parameterized Complexity Results for Exact Bayesian Network Structure Learning.

Christer Bäckström, Peter Jonsson and Sebastian Ordyniak, Stefan Szeider (2013). Parameterized Complexity and Kernel Bounds for Hard Planning Problems.

(2013). Parameterized and Exact Computation - 8th International Symposium, IPEC 2013, Sophia Antipolis, France, September 4-6, 2013, Revised Selected Papers.

Eppstein, David, Löffler, Maarten, Mumford, Elena, Martin Nöllenburg (2013). Optimal 3D Angular Resolution for Low-Degree Graphs.

Purchase, Helen C., Hamer, John, Martin Nöllenburg, Kobourov, Stephen G. (2013). On The Usability of Lombardi Graph Drawings.

Iyad Kanj, Stefan Szeider (2013). On the Subexponential Time Complexity of CSP.

Stefan Szeider (2013). Model Counting for Formulas of Bounded Clique-Width.

Ronald De Haan, Iyad A. Kanj, Stefan Szeider (2013). Local Backbones.

Daniel Lokshtanov and Neeldhara Misra and Geevarghese Philip and M. S. Ramanujan and Saket Saurabh (2013). Hardness of r-dominating set on Graphs of Diameter (r + 1).

Johannes Inführ, Günther Raidl (2013). GRASP and Variable Neighborhood Search for the Virtual Network Mapping Problem.

Jiehua Chen (2013). Generic expression hardness results for primitive positive formula comparison.

Jason Crampton and Robert Crowston and Gregory Gutin and Mark Jones and M. S. Ramanujan (2013). Fixed-Parameter Tractability of Workflow Satisfiability in the Presence of Seniority Constraints.

Robert Ganian (2013). Expanding the Expressive Power of Monadic Second-Order Logic on Restricted Graph Classes.

Benjamin Biesinger, Christian Schauer, Bin Hu, Günther Raidl (2013). Enhancing a Genetic Algorithm with a Solution Archive to Reconstruct Cross Cut Shredded Text Documents.

Martin Nöllenburg, Prutkin, Roman, Rutter, Ignaz (2013). Edge-weighted contact representations of planar graphs.

Duncan, Christian A., Eppstein, David, Goodrich, Michael T., Kobourov, Stephen G., Martin Nöllenburg (2013). Drawing Trees with Perfect Angular Resolution and Polynomial Area.

Mchedlidze, Tamara, Martin Nöllenburg, Rutter, Ignaz (2013). Drawing Planar Graphs with a Prescribed Inner Face.

Simon Dominik Fink, Haverkort, Herman, Martin Nöllenburg, Roberts, Maxwell J., Schuhmann, Julian, Wolff, Alexander (2013). Drawing Metro Maps using Bézier Curves.

Kobourov, Stephen, Martin Nöllenburg, Teillaud, Monique (2013). Drawing Graphs and Maps with Curves (Dagstuhl Seminar 13151).

Michel Boyer, Sif El Harti, Robert Ganian, Tomas Gavenciak, Gena Hahn and Carsten Moldenauer, Ignaz Rutter, Benoit Theriault, Martin Vatshelle (2013). Cops-and-robbers: remarks and problems.

Peter Jahrmann, Günther Raidl (2013). Clique and Independent Set Based GRASP Approaches for the Regenerator Location Problem.

Kämper, Jan-Hinrich, Kobourov, Stephen G., Martin Nöllenburg (2013). Circular-Arc Cartograms.

Stefan Szeider (2013). Capturing Structure in Hard Combinatorial Problems.

Robert Ganian (2013). Better Algorithms for Satisfiability Problems for Formulas of Bounded Rank-width.

Günther Raidl, Bin Hu, Marian Rainer-Harbach, Petrina Papazek (2013). Balancing Bicycle Sharing Systems: Improving a VNS by Efficiently Determining Optimal Loading Operations.

PDF Cite Project

Marian Rainer-Harbach, Petrina Papazek, Bin Hu, Günther Raidl (2013). Balancing Bicycle Sharing Systems: A Variable Neighborhood Search Approach.

PDF Cite Project

Andreas Pfandler, Stefan Rümmele, Stefan Szeider (2013). Backdoors to Abduction.

Andreas Schöbel, Günther Raidl, Igor Grujicic, Gerhard Besau, Gottfried Schuster (2013). An Optimization Model for Integrated Timetable Based Design of Railway Infrastructure.

Robert Ganian (2013). A unified approach to polynomial algorithms on graphs of bounded (bi-)rank-width.

Michael Pimmer, Günther Raidl (2013). A Timeslot-Filling Based Heuristic Approach to Construct High-School Timetables.

Pranabendu Misra and Venkatesh Raman and M. S. Ramanujan and Saket Saurabh (2013). A Polynomial Kernel for Feedback Arc Set on Bipartite Tournaments.

Papazek, Petrina, Günther Raidl, Rainer-Harbach, Marian, Hu, Bin (2013). A PILOT/VND/GRASP Hybrid for the Static Balancing of Public Bicycle Sharing Systems.

PDF Cite Project

Petrina Papazek, Günther Raidl, Marian Rainer-Harbach, Bin Hu (2013). A PILOT/VND/GRASP Hybrid for Balancing Bicycle Sharing Systems.

Bin Hu, Werner Ölz, Günther Raidl (2013). A Mixed Integer Model for the Stamina-Aware Sightseeing Tour Problem.

Petrica C. Pop, Bin Hu, Günther Raidl (2013). A Memetic Algorithm with Two Distinct Solution Representations for the Partition Graph Coloring Problem.

Petrica C. Pop, Bin Hu, Günther Raidl (2013). A Memetic Algorithm for the Partition Graph Coloring Problem.

Philipp Gebhard (2012). The Vehicle Routing Problem with Compartments.

Frederico Dusberger (2012). Improving the Protein Identification Performance in High-Resolution Mass Spectrometry Data.

Ivan Ivezić (2012). Extending the Gecode Framework with Interval Constraint Programming.

Martin Sturm (2012). Solving Multimodal Resource Constrained Project Scheduling Problems.

Ruthmair, Mario (2012). On Solving Constrained Tree Problems and an Adaptive Layers Framework.

Gerhard Hiermann (2012). Metaheuristics for a Multimodal Home-Health Care Scheduling Problem.

Sandro Pirkwieser (2012). Hybrid Metaheuristics and Matheuristics for Problems in Bioinformatics and Transportation.

Benjamin Biesinger (2012). Enhancing an Evolutionary Algorithm with a Solution Archive to Reconstruct Cross Cut Shredded Text Documents.

PDF Cite Project

Robert Ganian (2012). When Trees Grow Low: Shrubs and Fast MSO1.

Christian Schauer, Günther Raidl (2012). Variable Neighborhood Search and GRASP for Three-Layer Hierarchical Ring Network Design.

Markus Leitner, Günther Raidl (2012). Variable Neighborhood and Greedy Randomized Adaptive Search for Capacitated Connected Facility Location.

Eun Jung Kim and Sebastian Ordyniak (2012). Valued-Based Argumentation for Tree-like Value Graphs.

Christer Bäckström, Jiehua Chen, Peter Jonsson, Sebastian Ordyniak, Stefan Szeider (2012). The Complexity of Planning Revisited - A Parameterized Analysis.

Serge Gaspers, Stefan Szeider (2012). Strong Backdoors to Nested Satisfiability.

Clemens Nothegger, Alfred Mayer, Andreas Chwatal, Günther Raidl (2012). Solving the Post Enrolment Course Timetabling Problem by Ant Colony Optimization.

Daniel Lokshtanov and M. S. Ramanujan (2012). Parameterized Tractability of Multiway Cut with Parity Constraints.

Gregory Gutin, Eun Jung Kim, Arezou Soleimanfallah, Stefan Szeider, Anders Yeo (2012). Parameterized Complexity Results for General Factors in Bipartite Graphs with an Application to Constraint Programming.

Pranabendu Misra and Venkatesh Raman and M. S. Ramanujan and Saket Saurabh (2012). Parameterized Algorithms for Even Cycle Transversal.

Jiehua Chen (2012). On the Expression Complexity of Equivalence and Isomorphism of Primitive Positive Formulas.

Mario Ruthmair, Günther Raidl (2012). On Solving the Rooted Delay- and Delay-Variation-Constrained Steiner Tree Problem.

Van 'T Hof, Pim, Kami\ŉski, Marcin and Paulusma, Daniël, Stefan Szeider (2012). On graph contractions and induced minors.

N. S. Narayanaswamy and Venkatesh Raman and M. S. Ramanujan and Saket Saurabh (2012). LP can be a cure for Parameterized Problems.

Duncan, Christian A., Eppstein, David, Goodrich, Michael T., Kobourov, Stephen G., Martin Nöllenburg (2012). Lombardi Drawings of Graphs.

Simone Bova (2012). Lewis Dichotomies in Many-Valued Logics.

Fedor v. Fomin, Serge Gaspers, Petr A. Golovach, Karol Suchan, Stefan Szeider, Martin Vatshelle, Yngve Villanger (2012). k-Gap Interval Graphs.

Sandro Pirkwieser, Günther Raidl, Jens Gottlieb (2012). Improved Packing and Routing of Vehicles with Compartments.

Andrea Rendl, Matthias Prandtstetter, Gerhard Hiermann and Jakob Puchinger, Günther Raidl (2012). Hybrid Heuristics for Multimodal Homecare Scheduling.

Simone Bova and Diego Valota (2012). Finite RDP-algebras: duality, coproducts and logic.

Mathieson, Luke, Stefan Szeider (2012). Editing graphs to satisfy degree constraints: a parameterized approach.

Buchin, Kevin, Buchin, Maike, Byrka, Jaroslaw, Martin Nöllenburg, Okamoto, Yoshio, Silveira, Rodrigo, Wolff, Alexander (2012). Drawing (Complete) Binary Tanglegrams.

Serge Gaspers, Eun Jung Kim, Sebastian Ordyniak, Saket Saurabh, Stefan Szeider (2012). Don't Be Strict in Local Search!.

Ronald De Haan (2012). Description Logic Based Reasoning on Programming Languages.

Atienza, Nieves, De Castro, Natalia, Cortés, Carmen, Garrido, M. Ángeles, Grima, Clara I., Hernández, Gregorio, Márquez, Alberto, Moreno, Auxiliadora, Martin Nöllenburg, Portillo, José Ramón, Reyes, Pedro, Valenzuela, Jesús, Villar, Maria Trinidad, Wolff, Alexander (2012). Cover Contact Graphs.

Friedrich Slivovsky, Stefan Szeider (2012). Computing Resolution-Path Dependencies in Linear Time.

(2012). Computational Models of Argument - Proceedings of COMMA 2012, Vienna, Austria, September 10-12, 2012.

Serge Gaspers, Stefan Szeider (2012). Backdoors to Satisfaction.

Serge Gaspers, Stefan Szeider (2012). Backdoors to Acyclic SAT.

Thorsten Krenek, Mario Ruthmair, Günther Raidl, Michael Planer (2012). Applying (Hybrid) Metaheuristics to Fuel Consumption Optimization of Hybrid Electric Vehicles.

Bin Hu, Günther Raidl (2012). An Evolutionary Algorithm with Solution Archives and Bounding Extension for the Generalized Minimum Spanning Tree Problem.

PDF Cite Project

Bin Hu, Günther Raidl (2012). An Evolutionary Algorithm with Solution Archive for the Generalized Minimum Spanning Tree Problem.

PDF Cite Project

Chun, Jinhee, Kaothanthong, Natsuda, Kasai, Ryosei, Korman, Matias, Tokuyama, Takeshi, Martin Nöllenburg (2012). Algorithms for Computing the Maximum Weight Region Decomposable into Elementary Shapes.

Wolfgang Dvorák, Stefan Szeider, Stefan Woltran (2012). Abstract Argumentation via Monadic Second Order Logic.

Martin Schwengerer, Sandro Pirkwieser, Günther Raidl (2012). A Variable Neighborhood Search Approach for the Two-Echelon Location-Routing Problem.

Martin Berlakovich, Mario Ruthmair, Günther Raidl (2012). A Multilevel Heuristic for the Rooted Delay-Constrained Minimum Spanning Tree Problem.

Mario Ruthmair, Günther Raidl (2012). A Memetic Algorithm and a Solution Archive for the Rooted Delay-Constrained Minimum Spanning Tree Problem.

Gernot Fritz (2011). Heuristic Methods for the Hop Constrained Survivable Network Design Problem.

Christian Gruber (2011). Ein Lösungsarchiv mit Branch-and-Bound-Erweiterung für das Generalized Minimum Spanning Tree Problem.

PDF Cite Project

Thomas Seidl (2011). A Multilevel Refinement Approach to the Rooted Delay-Constrained Steiner Tree Problem.

Markus Sinnl (2011). Branch-and-Price for the Steiner Tree Problem with Revenues, Budget and Hop Constraints.

Thorsten Krenek (2011). Verbrauchsminimierung eines Hybridfahrzeuges im Neuen Europäischen Fahrzyklus.

Karl-Michael Edlinger (2011). Optimierung der periodischen Tourenplanung in der Müllentsorgung.

Thomas Winkler (2011). Anwendung von kombinatorischen Optimierungsmethoden zur Rekonstruktion von in Streifen geschnittenen Papierdokumenten.

Markus Leitner, Mario Ruthmair, Günther Raidl (2011). Stabilized Branch-and-Price for the Rooted Delay-Constrained Steiner Tree Problem.

Markus Leitner, Mario Ruthmair, Günther Raidl (2011). Stabilized Column Generation for the Rooted Delay-Constrained Steiner Tree Problem.

Markus Leitner, Günther Raidl (2011). Variable Neighborhood Search for Capacitated Connected Facility Location.

Mario Ruthmair, Andreas Hubmer, Günther Raidl (2011). Using a Solution Archive to Enhance Metaheuristics for the Rooted Delay-Constrained Minimum Spanning Tree Problem.

Robert Ganian (2011). Twin-Cover: Beyond Vertex Cover in Parameterized Algorithmics.

Stefan Szeider (2011). Tractable cases of the extended global cardinality constraint.

Serge Gaspers, Stefan Szeider (2011). The Parameterized Complexity of Local Consistency.

Stefan Szeider (2011). The parameterized complexity of k-flip local search for SAT and MAX SAT.

Sandro Pirkwieser, Günther Raidl, Jens Gottlieb (2011). Tackling the Loading Aspect of the Vehicle Routing Problem with Compartments.

Andreas Chwatal, Günther Raidl (2011). Solving the Minimum Label Spanning Tree Problem by Mathematical Programming Techniques.

Alon, Noga, Gutin, Gregory, Kim, Eun Jung, Stefan Szeider, Yeo, Anders (2011). Solving MAX-r-SAT above a tight lower bound.

Gemsa, Andreas, Martin Nöllenburg, Rutter, Ignaz (2011). Sliding Labels for Dynamic Point Labeling.

Sebastian Ordyniak, Daniël Paulusma, Stefan Szeider (2011). Satisfiability of Acyclic and almost Acyclic CNF Formulas (II).

Venkatesh Raman and M. S. Ramanujan and Saket Saurabh (2011). Paths, Flowers and Vertex Cover.

Stefan Szeider (2011). Parameterized Proof Complexity.

Fellows, Michael R., Fomin, Fedor V., Lokshtanov, Daniel and Rosamond, Frances, Saurabh, Saket, Stefan Szeider (2011). On the complexity of some colorful problems parameterized by treewidth.

Markus Leitner, Mario Ruthmair, Günther Raidl (2011). On Stabilized Branch-and-Price for Constrained Tree Problems.

Gemsa, Andreas, Martin Nöllenburg, Pajor, Thomas, Rutter, Ignaz (2011). On d-regular Schematization of Embedded Paths.

Robert Ganian (2011). New Results on the Complexity of the Max- and Min-Rep Problems.

Stefan Szeider (2011). Monadic Second Order Logic on Graphs with Local Cardinality Constraints.

Stefan Szeider (2011). Limits of Preprocessing.

Stefan Szeider (2011). Kernels for Global Constraints.

Johannes Inführ, Günther Raidl (2011). Introducing the Virtual Network Mapping Problem with Delay, Routing and Location Constraints.

Christian Blum, Jakob Puchinger, Günther Raidl, Andrea Roli (2011). Hybrid Metaheuristics in Combinatorial Optimization: A Survey.

Martin Nöllenburg, Wolff, Alexander (2011). Drawing and Labeling High-Quality Metro Maps by Mixed-Integer Programming.

Kao, Mong-Jen, Katz, Bastian, Krug, Marcus, Lee, D. T., Martin Nöllenburg, Rutter, Ignaz, Wagner, Dorothea (2011). Connecting Two Trees with Optimal Routing Cost.

Robert Ganian (2011). Clique-width: When Hard Does Not Mean Impossible.

Markus Leitner, Günther Raidl (2011). Branch-and-Cut-and-Price for Capacitated Connected Facility Location.

Gemsa, Andreas, Haunert, Jan-Henrik, Martin Nöllenburg (2011). Boundary-Labeling Algorithms for Panorama Images.

Gemsa, Andreas, Martin Nöllenburg, Pajor, Thomas, Rutter, Ignaz (2011). Automatic Generation of Route Sketches.

Sebastian Ordyniak, Stefan Szeider (2011). Augmenting Tractable Fragments of Abstract Argumentation.

Eun Jung Kim, Sebastian Ordyniak, Stefan Szeider (2011). Algorithms and Complexity Results for Persuasive Argumentation.

Stefan Szeider (2011). A probabilistic approach to problems parameterized above or below tight bounds.

Mario Ruthmair, Günther Raidl (2011). A Layered Graph Model and an Adaptive Layers Framework to Solve Delay-Constrained Minimum Tree Problems.

Andreas M. Chwatal, Corina Thöni, Günther Raidl (2011). A Branch-and-Cut-and-Price Algorithm for a Fingerprint-Template Compression Application.

Michael Pimmer (2010). A Timeslot-Based Heuristic Approach to Construct High-School Timetables.

Mika Sonnleitner (2010). Ein neues Lösungsarchiv für das Generalized Minimum Spanning Tree-Problem.

PDF Cite Project

Karin Oberlechner (2010). Solving the k-Node Minimum Label Spanning Arborescence Problem with Exact and Heuristic Methods.

Martin Berlakovich (2010). Multilevel Heuristiken für das Rooted Delay-Constrained Minimum Spanning Tree Problem.

J. Inführ (2010). Automatic Generation of 2-AntWars Players with Genetic Programming.

Markus Leitner (2010). Solving Two Network Design Problems by Mixed Integer Programming and Hybrid Optimization Methods.

C. Schauer (2010). Reconstructing Cross-Cut Shredded Documents by means of Evolutionary Algorithms.

Andreas Chwatal (2010). On the Minimum Label Spanning Tree Problem: Solution Methods and Applications.

Anna Pagacz (2010). Heuristic methods for solving two Generalized Network Problems.

Corinna Thöni (2010). Compressing Fingerprint Templates by Solving the k-Node Minimum Label Spanning Arborescence Problem by Branch-and-Price.

Martin Nöllenburg (2010). Visualisierung von Netzen: Algorithmen, Anwendungen und Komplexität.

Sandro Pirkwieser, Günther Raidl (2010). Variable Neighborhood Search Coupled with ILP-based Large Neighborhood Searches for the (Periodic) Location-Routing Problem.

Mario Ruthmair, Günther Raidl (2010). Variable Neighborhood Search and Ant Colony Optimization for the Rooted Delay-Constrained Minimum Spanning Tree Problem.

Martin Suntinger, Hannes Obweger, Josef Schiefer and Philip Limbeck, Günther Raidl (2010). Trend-Based Similarity Search in Time-Series Data.

Robert Ganian (2010). Thread Graphs, Linear Rank-Width and Their Algorithmic Applications.

(2010). Theory and Applications of Satisfiability Testing - SAT 2010, 13th International Conference, SAT 2010, Edinburgh, UK, July 11-14, 2010. Proceedings.

Jakob Puchinger, Günther Raidl, Ulrich Pferschy (2010). The Multidimensional Knapsack Problem: Structure and Algorithms.

Bin Hu, Markus Leitner, Günther Raidl (2010). The Generalized Minimum Edge Biconnected Network Problem: Efficient Neighborhood Structures for Variable Neighborhood Search.

Stefano Aguzzoli and Simone Bova (2010). The free n-generated BL-algebra.

Simone Bova and Tommaso Flaminio (2010). The coherence of Łukasiewicz assessments is NP-complete.

Markus Leitner, Günther Raidl (2010). Strong Lower Bounds for a Survivable Network Design Problem.

Andreas M. Chwatal, Günther Raidl (2010). Solving the Minimum Label Spanning Tree Problem by Ant Colony Optimization.

Hannes Obweger, Martin Suntinger, Günther Raidl (2010). Similarity Searching in Sequences of Complex Events.

Löffler, Maarten, Martin Nöllenburg (2010). Shooting Bricks with Orthogonal Laser Beams: A First Step towards Internal/External Map Labeling.

Stefano Aguzzoli and Simone Bova (2010). Schauder Hats for the Two-Variable Fragment of BL.

Dvorák, Stefan Szeider (2010). Reasoning in Argumentation Frameworks of Bounded Clique-Width.

Delling, Daniel, Gemsa, Andreas, Martin Nöllenburg, Pajor, Thomas (2010). Path Schematization for Route Sketches.

Been, Ken, Martin Nöllenburg, Poon, Sheung-Hung, Wolff, Alexander (2010). Optimizing Active Ranges for Consistent Dynamic Map Labeling.

Abhimanyu M. Ambalath and Radheshyam Balasundaram and Chintan Rao H. and Venkata Koppula and Neeldhara Misra and Geevarghese Philip and M. S. Ramanujan (2010). On the Kernelization Complexity of Colorful Motifs.

Robert Ganian (2010). On parse trees and Myhill-Nerode-type tools for handling graphs of bounded rank-width.

Stefan Szeider (2010). On Contracting Graphs to Fixed Pattern Graphs.

Robert Ganian (2010). New Results on the Complexity of Oriented Colouring on Restricted Digraph Classes.

Sandro Pirkwieser, Günther Raidl (2010). Multilevel Variable Neighborhood Search for Periodic Routing Problems.

Sandro Pirkwieser, Günther Raidl (2010). Matheuristics for the Periodic Vehicle Routing Problem with Time Windows.

(2010). Hybrid Metaheuristics, 7th Int. Workshop, HM 2010.

Andreas Chwatal, Günther Raidl (2010). Fitting Multi-Planet Transit Models to Photometric Time-Data Series by Evolution Strategies.

Günther Raidl, Bin Hu (2010). Enhancing Genetic Algorithms by a Trie-Based Complete Solution Archive.

PDF Cite Project

Martin Nöllenburg, Polishchuk, Valentin, Sysikaski, Mikko (2010). Dynamic One-Sided Boundary Labeling.

Marko Samer, Stefan Szeider (2010). Constraint satisfaction with bounded treewidth revisited.

Bekos, Michael, Kaufmann, Michael, Martin Nöllenburg, Symvonis, Antonios (2010). Boundary Labeling with Octilinear Leaders.

Robert Ganian (2010). Are There Any Good Digraph Width Measures?.

Martin Nöllenburg (2010). An Improved Algorithm for the Metro-Line Crossing Minimization Problem.

Samer, Marko, Stefan Szeider (2010). Algorithms for propositional model counting.

Sebastian Ordyniak, Stefan Szeider (2010). Algorithms and Complexity Results for Exact Bayesian Structure Learning.

Anna Pagacz, Bin Hu, Günther Raidl (2010). A Memetic Algorithm with Population Management for the Generalized Minimum Vertex-Biconnected Network Problem.

Christian Schauer, Matthias Prandtstetter, Günther Raidl (2010). A Memetic Algorithm for Reconstructing Cross-Cut Shredded Text Documents.

Christian Blum, Jakob Puchinger, Günther Raidl (2010). A Brief Survey on Hybrid Metaheuristics.

Matthias Prandtstetter (2009). Hybrid Optimization Methods for Warehouse Logistics and the Reconstruction of Destroyed Paper Documents.

Markus Wolf (2009). Ein Lösungsarchiv-unterstützter evolutionärer Algorithmus für das Generalized Minimum Spanning Tree-Problem.

PDF Cite Project

Martin Gruber (2009). Exact and Heuristic Approaches for Solving the Bounded Diameter Minimum Spanning Tree Problem.

Andreas M. Chwatal, Nina Musil, Günther Raidl (2009). Solving a Multi-Constrained Network Design Problem by Lagrangean Decomposition and Column Generation.

Jakob Walla (2009). Exakte und heuristische Optimierungsmethoden zur Lösung von Video Server Load Re-Balancing.

Thomas Misar (2009). Ein hybrides Verfahren basierend auf Variabler Nachbarschaftssuche und Dynamischer Programmierung zur Tourenfindung in einem Ersatzteillager mit domänenspezifischen Nebenbedingungen.

Markus Leitner, Günther Raidl, Ulrich Pferschy (2009). Accelerating Column Generation for a Survivable Network Design Problem.

Hannes Obweger (2009). Similarity Searching in Complex Business Events and Sequences thereof.

Martin Suntinger (2009). Event Based Similarity Search and its Applications in Business Analytics.

Martin Nöllenburg (2009). Network Visualization: Algorithms, Applications, and Complexity.

Andrej Sramko (2009). Enhancing a Genetic Algorithm by a Complete Solution Archive Based on a Trie Data Structure.

Robert Ganian (2009). The Parameterized Complexity of Oriented Colouring.

Simone Bova and Franco Montagna (2009). The consequence relation in the logic of commutative GBL-algebras is PSPACE-complete.

Martin~Gruber, Günther Raidl (2009). Solving the Euclidean Bounded Diameter Minimum Spanning Tree Problem by Clustering-Based (Meta-)Heuristics.

Andreas M. Chwatal, Günther Raidl, Karin Oberlechner (2009). Solving an Extended Minimum Label Spanning Tree Problem to Compress Fingerprint Templates.

Jakob Walla, Mario Ruthmair, Günther Raidl (2009). Solving a Video-Server Load Re-Balancing Problem by Mixed Integer Programming and Hybrid Variable Neighborhood Search.

Simone Bova (2009). Soft Constraints Processing over Divisible Residuated Lattices.

Robert Ganian (2009). On Digraph Width Measures in Parameterized Algorithmics.

Sandro Pirkwieser, Günther Raidl (2009). Multiple Variable Neighborhood Search Enriched with ILP Techniques for the Periodic Vehicle Routing Problem with Time Windows.

Jakob Puchinger, Günther Raidl, Sandro Pirkwieser (2009). MetaBoosting: Enhancing Integer Programming Techniques by Metaheuristics.

Matthias Prandtstetter, Günther Raidl (2009). Meta-Heuristics for Reconstructing Cross Cut Shredded Text Documents.

Stefan Szeider (2009). Matched Formulas and Backdoor Sets.

Christian Blum, Jakob Puchinger, Günther Raidl, Andrea Roli (2009). Hybrid Metaheuristics.

(2009). GECCO~2009: Proceedings of the 11th Annual Conference on Genetic and Evolutionary Computation.

Andreas M. Chwatal, Günther Raidl (2009). Fitting Rectangular Signals to Time Series Data by Metaheuristic Algorithms.

Andreas M. Chwatal, Günther Raidl (2009). Fitting Multi-Planet Transit Models to CoRoT Time-Data Series by Evolutionary Algorithms.

Martin Gruber, Günther Raidl (2009). Exploiting Hierarchical Clustering for Finding Bounded Diameter Minimum Spanning Trees on Euclidean Instances.

Martin Nöllenburg, Völker, Markus, Wolff, Alexander, Holten, Danny (2009). Drawing Binary Tanglegrams: An Experimental Evaluation.

Buchin, Kevin, Buchin, Maike, Byrka, Jaroslaw, Martin Nöllenburg, Okamoto, Yoshio, Silveira, Rodrigo I., Wolff, Alexander (2009). Drawing (Complete) Binary Tanglegrams: Hardness, Approximation, Fixed-Parameter Tractability.

Stefan Szeider (2009). Covering graphs with few complete bipartite subgraphs.

Günther Raidl (2009). Cooperative Hybrids for Combinatorial Optimization.

Chun, Jinhee, Korman, Matias, Martin Nöllenburg, Tokuyama, Takeshi (2009). Consistent Digital Rays.

Ulrike Ritzinger, Matthias Prandtstetter, Günther Raidl (2009). Computing Optimized Stock (Re-)Placements in Last-In, First-Out Warehouses.

Markus Leitner, Günther Raidl (2009). Combining Lagrangian Decomposition with Very Large Scale Neighborhoood Search for Capacitated Connected Facility Location.

Markus Leitner, Günther Raidl (2009). Combining Lagrangian Decomposition with Very Large Scale Neighborhood Search for Capacitated Connected Facility Location.

Martin~Gruber, Günther Raidl (2009). Cluster-Based (Meta-)Heuristics for the Euclidean Bounded Diameter Minimum Spanning Tree Problem.

Fellows, Michael R., Rosamond, Frances A., Stefan Szeider (2009). Clique-width is NP-complete.

Sandro Pirkwieser, Günther Raidl (2009). Boosting a Variable Neighborhood Search for the Periodic Vehicle Routing Problem with Time Windows by ILP Techniques.

Robert Ganian (2009). Better Polynomial Algorithms on Graphs of Bounded Rank-Width.

Samer, Marko, Stefan Szeider (2009). Backdoor sets of quantified Boolean formulas.

Stefano Aguzzoli and Simone Bova and Vincenzo Marra (2009). Applications of Finite Duality to Locally Finite Varieties of BL-Algebras.

Benkert, Marc, Haverkort, Herman, Kroll, Moritz, Martin Nöllenburg (2009). Algorithms for Multi-Criteria Boundary Labeling.

Bin Hu, Günther Raidl (2009). A Memetic Algorithm for the Generalized Minimum Vertex-Biconnected Network Problem.

Markus Leitner, Günther Raidl (2009). A Lagrangian Decomposition Based Heuristic for Capacitated Connected Facility Location.

Mario Ruthmair, Günther Raidl (2009). A Kruskal-Based Heuristic for the Rooted Delay-Constrained Minimum Spanning Tree Problem.

Matthias Prandtstetter, Günther Raidl, Thomas Misar (2009). A Hybrid Algorithm for Computing Tours in a Spare Parts Warehouse.

Sandro Pirkwieser, Günther Raidl (2009). A Column Generation Approach for the Periodic Vehicle Routing Problem with Time Windows.

Martin Gruber, Günther Raidl (2009). (Meta-)Heuristic Separation of Jump Cuts in a Branch&Cut Approach for the Bounded Diameter Minimum Spanning Tree Problem.

Bin Hu (2008). Hybrid Metaheuristics for Generalized Network Design Problems.

Ulrike Ritzinger (2008). Generierung von Ein- und Umlagervorschlägen in Lagern mit einer Last-In First-Out Strategie und kundenspezifischen Auslagerpr\f̈erenzen.

Nina Musil (2008). Design eines sicherheits-, zeit- und kostenkritischen Kommunikationsnetzwerkes mittels Lagrange Relaxierung und Spaltengenerierung.

Anna Katarzyna Potocka (2008). Webbasierte Darstellung großer Datenmengen als Pivot-Tabelle mithilfe ressourcenoptimierter Aggregationsverfahren.

Markus Knausz (2008). Parallel Variable Neighborhood Search for the Car Sequencing Problem.

Franz Berger (2008). Ein hybrides Verfahren zur automatischen Rekonstruktion von handzerrissenen Dokumentenseiten mittels geometrischer Informationen.

Ferdinand Zaubzer (2008). Lagrangian Relax-and-Cut and Hybrid methods for the Bounded Diameter and the Hop Constrained Minimum Spanning Tree Problems.

Wolfgang Morandell (2008). Evaluation and Reconstruction of Strip-Shredded Text Documents.

Olivia Dietzel (2008). Combinatorial Optimization for the Compression of Biometric Templates.

Christoph Bonitz (2008). An Incremental Dynamic Programming Approach for Multidimensional Allocation Problems.

Stephan Zaubzer (2008). A Complete Archive Genetic Algorithm for the Multidimensional Knapsack Problem.

Markus Leitner, Günther Raidl (2008). Variable Neighborhood Search for a Prize Collecting Capacity Constrained Connected Facility Location Problem.

Luke Mathieson, Stefan Szeider (2008). The Parameterized Complexity of Regular Subgraph Problems and Generalizations.

Bin Hu, Günther Raidl (2008). Solving the Railway Traveling Salesman Problem via a Transformation into the Classical Traveling Salesman Problem.

Peter Schüller (2008). Reconstructing Borders of Manually Torn Paper Scheets Using Integer Linear Programming.

Simone Bova and Franco Montagna (2008). Proof search in Hájek's basic logic.

Stefan Szeider (2008). Parameterized SAT.

Stefan Szeider (2008). Parameterized Graph Editing with Chosen Vertex Degrees.

Stefan Szeider (2008). Not So Easy Problems For Tree Decomposable Graphs (invited talk).

Martin Nöllenburg, Merrick, Damian, Wolff, Alexander, Benkert, Marc (2008). Morphing Polylines: A Step Towards Continuous Generalization.

Markus Leitner, Günther Raidl (2008). Lagrangian Decomposition, Metaheuristics, and Hybrid Approaches for the Design of the Last Mile in Fiber Optic Networks.

Martin Gruber, Günther Raidl (2008). Heuristic Cut Separation in a Branch&Cut Approach for the Bounded Diameter Minimum Spanning Tree Problem.

Gutin, Gregory, Stefan Szeider, Yeo, Anders (2008). Fixed-parameter complexity of minimum profile problems.

Georg Gottlob, Stefan Szeider (2008). Fixed-parameter algorithms for artificial intelligence, constraint satisfaction, and database problems.

Sandro Pirkwieser, Günther Raidl (2008). Finding Consensus Trees by Evolutionary, Variable Neighborhood Search, and Hybrid Algorithms.

Sandro Pirkwieser, Ruben Ruiz-Torrubiano, Günther Raidl (2008). Exact Methods and Metaheuristic Approaches for Deriving High Quality Fully Resolved Consensus Trees.

Bin Hu, Günther Raidl (2008). Effective Neighborhood Structures for the Generalized Traveling Salesman Problem.

Bin Hu, Markus Leitner, Günther Raidl (2008). Combining Variable Neighborhood Search with Integer Linear Programming for the Generalized Minimum Spanning Tree Problem.

Matthias Prandtstetter, Günther Raidl (2008). Combining Forces to Reconstruct Strip Shredded Text Documents.

Günther Raidl, Jakob Puchinger (2008). Combining (Integer) Linear Programming Techniques and Metaheuristics for Combinatorial Optimization.

Jakob Puchinger, Günther Raidl (2008). Bringing Order into the Neighborhoods: Relaxation Guided Variable Neighborhood Search.

Marko Samer, Stefan Szeider (2008). Backdoor Trees.

Robert Ganian, Petr Hlinený (2008). Automata approach to graphs of bounded rank-width.

Matthias Prandtstetter, Günther Raidl (2008). An Integer Linear Programming Approach and a Hybrid Variable Neighborhood Search for the Car Sequencing Problem.

Benkert, Marc, Haverkort, Herman, Kroll, Moritz, Martin Nöllenburg (2008). Algorithms for Multi-Criteria One-Sided Boundary Labeling.

Sandro Pirkwieser, Günther Raidl (2008). A Variable Neighborhood Search for the Periodic Vehicle Routing Problem with Time Windows.

Günther Raidl, Martin Gruber (2008). A Lagrangian Relax-and-Cut Approach for the Bounded Diameter Minimum Spanning Tree Problem.

Sandro Pirkwieser, Günther Raidl, Jakob Puchinger (2008). A Lagrangian Decomposition/Evolutionary Algorithm Hybrid for the Knapsack Constrained Maximum Spanning Tree Problem.

Martin Gruber, Günther Raidl (2008). (Meta-)Heuristic Separation of Jump Cuts for the Bounded Diameter Minimum Spanning Tree Problem.

Andreas Braumann (2007). Map-Matching und Wegsuche in einem geografischen Informationssystem.

Peter Putz (2007). Subgradient Optimization Based Lagrangian Relaxation and Relax-and-Cut Approaches for the Bounded Diameter Minimum Spanning Tree Problem.

Philipp Neuner (2007). Algorithmic Approaches to the String Barcoding Problem.

Nedim Mujezinovic (2007). Improved Protein Identification After Fast Elimination of Non-Interpretable Peptide MS/MS Spectra and Noise Reduction.

Thomas Bucsics (2007). Metaheuristic Approaches for Designing Survivable Fiber-Optic Networks.

Benkert, Marc, Martin Nöllenburg (2007). Improved Algorithms for Length-Minimal One-Sided Boundary Labeling.

Stefan Szeider (2007). Without Loss of Generality - Symmetric Reasoning for Resolution Systems (Invited Talk).

Markus Leitner, Bin Hu, Günther Raidl (2007). Variable Neighborhood Search for the Generalized Minimum Edge Biconnected Network Problem.

Gregory Gutin, Arash Rafiey, Stefan Szeider (2007). The Linear Arrangement Problem Parameterized Above Guaranteed Value.

Naomi Nishimura, Prabhakar Ragde, Stefan Szeider (2007). Solving #SAT using Vertex Covers.

Merrick, Damian, Martin Nöllenburg, Wolff, Alexander, Benkert, Marc (2007). Morphing Polygonal Lines: A Step Towards Continuous Generalization.

Jakob Puchinger, Günther Raidl (2007). Models and Algorithms for Three-Stage Two-Dimensional Bin Packing.

Benkert, Marc, Martin Nöllenburg, Uno, Takeaki, Wolff, Alexander (2007). Minimizing Intra-Edge Crossings in Wiring Diagrams and Public Transportation Maps.

Martin Nöllenburg (2007). Geographic Visualization.

Günther Raidl, Andreas Chwatal (2007). Fingerprint Template Compression by Solving a Minimum Label k-Node Subtree Problem.

Andreas M. Chwatal, Günther Raidl (2007). Determining Orbital Elements of Extrasolar Planets by Evolution Strategies.

Jennifer Hetzl, Andrea M. Foerster, Günther Raidl, Ortrun Mittelsten Scheid (2007). CyMATE: A New Tool for Methylation Analysis of Plant Genomic DNA after Bisulfite Sequencing.

Andreas Chwatal, Günther Raidl, Olivia Dietzel (2007). Compressing Fingerprint Templates by Solving an Extended Minimum Label Spanning Tree Problem.

Sandro Pirkwieser, Günther Raidl, Jakob Puchinger (2007). Combining Lagrangian Decomposition with an Evolutionary Algorithm for the Knapsack Constrained Maximum Spanning Tree Problem.

Daniel Wagner, Günther Raidl, Ulrich Pferschy, Petra Mutzel, Peter Bachhiesl (2007). A Multi-Commodity Flow Approach for the Design of the Last Mile in Real-World Fiber Optic Networks.

Daniel Wanger, Ulrich Pferschy, Petra Mutzel, Günther Raidl, P.Bachhiesl (2007). A Directed Cut Model for the Design of the Last Mile in Real-World Fiber Optic Networks.

Robert Beibl (2006). Cluster Planarity Testing for the Case of Not Necessarily Connected Clusters.

Sandro Pirkwieser (2006). A Lagrangian Decomposition Approach Combined with Metaheuristics for the Knapsack Constrained Maximum Spanning Tree Problem.

Markus Leitner (2006). Solving Two Generalized Network Design Problems with Exact and Heuristic Methods.

Bin Hu, Günther Raidl (2006). Variable Neighborhood Descent with Self-Adaptive Neighborhood-Ordering.

Jakob Puchinger, Günther Raidl, Ulrich Pferschy (2006). The Core Concept for the Multidimensional Knapsack Problem.

Michael R. Fellows, Stefan Szeider, Graham Wrightson (2006). On Finding Short Resolution Refutations and Small Unsatisfiable Subsets.

Martin Gruber, Jano Van Hemert, Günther Raidl (2006). Neighborhood Searches for the Bounded Diameter Minimum Spanning Tree Problem Embedded in a VNS, EA, and ACO.

(2006). Evolutionary Computation in Combinatorial Optimization -- EvoCOP~2006.

Anna Pagacz, Günther Raidl, Stanislaw Zawiślak (2006). Evolutionary Approach to Constrained Minimum Spanning Tree Problem.

Jakob Puchinger (2006). Combining Metaheuristics and Integer Programming for Solving Cutting and Packing Problems.

Michael R. Fellows, Frances A. Rosamond, Stefan Szeider (2006). Clique-width Minimization is NP-hard.

Nedim Mujezinovic, Günther Raidl, James R. A. Hutchins, Jan-Michael Peters, Karl Mechtler, Frank Eisenhaber (2006). Cleaning of Raw Peptide MS/MS Spectra: Improved Protein Identification Following Deconvolution of Multiply Charged Peaks, Isotope Clusters, and Removal of Background Noise.

Günther Raidl, Gabriele Koller, Bryant A. Julstrom (2006). Biased Mutation Operators for Subgraph-Selection Problems.

Andreas Chwatal (2006). Bestimmung der Bahnelemente von extrasolaren Planeten aufgrund von Radialgeschwindigkeitsmessdaten mittels evolutionärer Algorithmen.

Boris Kopinitsch (2006). An Ant Colony Optimisation Algorithm for the Bounded Diameter Minimum Spanning Tree Problem.

Günther Raidl (2006). A Unified View on Hybrid Metaheuristics.

Shlomo Hoory, Stefan Szeider (2006). A note on unsatisfiable k-CNF formulas with few occurrences per variable.

Martin Nöllenburg, Wolff, Alexander (2006). A Mixed-Integer Program for Drawing High-Quality Metro Maps.

Veronika Gamper (2005). Multiple Structural RNA Alignment with Affine Gap Costs Based on Lagrangian Relaxation.

Matthias Prandtstetter (2005). Exact and Heuristic Methods for Solving the Car Sequencing Problem.

Daniel Wagner (2005). Eine generische Bibliothek für Metaheuristiken und ihre Anwendung auf das Quadratic Assignment Problem.

David Fischinger (2005). Dynamische Reihenfolgeoptimierung mittels Simulation und Meta-Heuristiken.

Martin Nöllenburg (2005). Automated Drawing of Metro Maps.

Grégoire Verlut (2005). An Application of Dijkstra's Algorithm for a (On-Board) Route (Re-)Planning Module.

Daniel Lichtenberger (2005). An Extended Local Branching Framework and its Application to the Multidimensional Knapsack Problem.

Andreas Heigl (2005). Option Pricing by Means of Genetic Programming.

Martin Gruber, Günther Raidl (2005). Variable Neighborhood Search for the Bounded Diameter Minimum Spanning Tree Problem.

Stefan Szeider (2005). The Complexity of Resolution with Generalized Symmetry Rules.

Jakob Puchinger, Günther Raidl (2005). Relaxation Guided Variable Neighborhood Search.

(2005). Proceedings of the Genetic and Evolutionary Computation Conference, GECCO-2005.

(2005). Proceedings of the 2005 IEEE Congress on Evolutionary Computation.

Herbert Fleischner, Stefan Szeider (2005). On Edge-Colored Graphs Covered by Properly Colored Cycles.

Stefan Szeider (2005). Generalizations of matched CNF formulas.

Günther Raidl (2005). Evolutionary Computation: An Overview and Recent Trends.

(2005). Evolutionary Computation in Combinatorial Optimization -- EvoCOP~2005.

Günther Raidl, Jens Gottlieb (2005). Empirical Analysis of Locality, Heritability and Heuristic Bias in Evolutionary Algorithms: A Case Study for the Multidimensional Knapsack Problem.

Jakob Puchinger, Günther Raidl, Martin Gruber (2005). Cooperating Memetic and Branch-and-Cut Algorithms for Solving the Multidimensional Knapsack Problem.

Hoory, Shlomo, Stefan Szeider (2005). Computing unsatisfiable k-SAT instances with few occurrences per variable.

Bin Hu, Markus Leitner, Günther Raidl (2005). Computing Generalized Minimum Spanning Trees with Variable Neighborhood Search.

Jakob Puchinger, Günther Raidl (2005). Combining Metaheuristics and Exact Algorithms in Combinatorial Optimization: A Survey and Classification.

Stefan Szeider (2005). Backdoor Sets for DLL Subsolvers.

Matthias Prandtstetter, Günther Raidl (2005). A Variable Neighborhood Search Approach for Solving the Car Sequencing Problem.

Martin Gruber, Günther Raidl (2005). A New 0--1 ILP Approach for the Bounded Diameter Minimum Spanning Tree Problem.

Jäkel, Jens, Martin Nöllenburg (2004). Validation in the Cluster Analysis of Gene Expression Data.

G"unther Gruber (2004). Ein Genetischer Algorithmus für das Optimum Communication Spanning Tree Problem.

Stefan Leopold (2004). An Alignment Graph based Evolutionary Algorithm for the Multiple Sequence Alignment Problem.

Stefan Szeider (2004). The Parameterized Complexity of SAT Backdoors.

(2004). Special Issue on Evolutionary Computation in Combinatorial Optimization.

Jakob Puchinger, Günther Raidl, Gabriele Koller (2004). Solving a Real-World Glass Cutting Problem.

Stefan Szeider (2004). On Theorems Equivalent with Kotzig's Result on Graphs with Unique 1-Factors.

Stefan Szeider (2004). On fixed-parameter tractable parameterizations of SAT.

Stefan Szeider (2004). Minimal unsatisfiable formulas with bounded clause-variable difference are fixed-parameter tractable.

(2004). Evolutionary Computation in Combinatorial Optimization -- EvoCOP~2004.

Naomi Nishimura, Prabhakar Ragde, Stefan Szeider (2004). Detecting Backdoor Sets with Respect to Horn and Binary Clauses.

G.W.~Klau, I.~Ljubić, A.~Moser, P.~Mutzel, P.~Neuner and U.~Pferschy, Günther Raidl, R.~Weiskircher (2004). Combining a Memetic Algorithm with Integer Programming to Solve the Prize-Collecting Steiner Tree Problem.

(2004). Applications of Evolutionary Computing: EvoWorkshops 2004.

Günther Raidl, H. Feltl (2004). An Improved Hybrid Genetic Algorithm for the Generalized Assignment Problem.

Gabriele Koller, Günther Raidl (2004). An Evolutionary Algorithm for the Maximum Weight Trace Formulation of the Multiple Sequence Alignment Problem.

Jakob Puchinger, Günther Raidl (2004). An Evolutionary Algorithm for Column Generation in Integer Programming: an Effective Approach for 2D Bin Packing.

Sandor Alexander Kersting (2003). Ein evolutionärer Algorithmus zur L\s̈ung des Vertex-Biconnectivity Augmentation Problems.

Jakob Puchinger (2003). Verfahren zur Lösung eines Glasverschnittproblems.

Janosch Fauster (2003). Neue heuristische Lösungsans\ẗze f\" ̈das Multiple Sequence Alignment Problem.

Harald Feltl (2003). Ein Genetischer Algorithmus für das Generalized Assignment Problem.

Günther Raidl (2003). Hybrid Evolutionary Algorithms for Combinatorial Optimization.

Stefan Szeider (2003). Homomorphisms of Conjunctive Normal Forms.

Günther Raidl, B. A. Julstrom (2003). Greedy Heuristics and an Evolutionary Algorithm for the Bounded-Diameter Minimum Spanning Tree Problem.

Stefan Szeider (2003). Finding paths in graphs avoiding forbidden transitions.

Günther Raidl, B. A. Julstrom (2003). Edge-Sets: An Effective Evolutionary Coding of Spanning Trees.

(2003). Applications of Evolutionary Computing: EvoWorkshops 2003.

B. A. Julstrom, Günther Raidl (2003). A Permutation-Coded Evolutionary Algorithm for the Bounded-Diameter Minimum Spanning Tree Problem.

I. Ljubić, Günther Raidl (2003). A Memetic Algorithm for Minimum-Cost Vertex-Biconnectivity Augmentation of Graphs.

Fleischner, Herbert, Kullmann, Oliver, Stefan Szeider (2002). Polynomial-time recognition of minimal unsatisfiable formulas with fixed clause-variable difference.

Günther Raidl, Gabriele Kodydek, Bryant Julstrom (2002). On Weight-Biased Mutation for Graph Problems.

M. Schreyer, Günther Raidl (2002). Letting Ants Labeling Point Features.

B. A. Julstrom, Günther Raidl (2002). Initialization is Robust in Evolutionary Algorithms that Encode Spanning Trees as Sets of Edges.

Günther Raidl, I. Ljubić (2002). Evolutionary Local Search for the Edge-Biconnectivity Augmentation Problem.

(2002). Applications of Evolutionary Computing: EvoWorkshops 2002.

S. Kersting, Günther Raidl, I. Ljubić (2002). A Memetic Algorithm for Vertex-Biconnectivity Augmentation.

B. A. Julstrom, Günther Raidl (2001). Weight-Biased Edge-Crossover in Evolutionary Algorithms for Two Graph Problems.

J. Gottlieb, B. A. Julstrom, Günther Raidl (2001). Prüfer Numbers: A Poor Representation of Spanning Trees for Evolutionary Search.

Stefan Szeider (2001). NP-Completeness of Refutability by Literal-Once Resolution.

Stefan Szeider (2001). Conjunctive Normal Forms with Bounded Deficiency.

(2001). Applications of Evolutionary Computing: EvoWorkshops 2001.

I. Ljubić, Günther Raidl (2001). An Evolutionary Algorithm with Stochastic Hill-Climbing for the Edge-Biconnectivity Augmentation Problem.

Jens Gottlieb, Günther Raidl (2000). The Effects of Locality on the Dynamics of Decoder-Based Evolutionary Search.

Günther Raidl (2000). An Efficient Evolutionary Algorithm for the Degree-Constrained Minimum Spanning Tree Problem.

Günther Raidl, Bryant A. Julstrom (2000). A Weighted Coding in a Genetic Algorithm for the Degree-Constrained Minimum Spanning Tree Problem.

Günther Raidl, C. Drexel (2000). A Predecessor Coding in an Evolutionary Algorithm for the Capacitated Minimum Spanning Tree Problem.

I. Ljubić, Günther Raidl, J. Kratica (2000). A Hybrid GA for the Edge-Biconnectivity Augmentation Problem.

Günther Raidl (1999). Weight-Codings in a Genetic Algorithm for the Multiconstraint Knapsack Problem.

Günther Raidl (1999). The Multiple Container Packing Problem: A Genetic Algorithm Approach with Weighted Codings.

Günther Raidl, Jens Gottlieb (1999). On the Importance of Phenotypic Duplicate Elimination in Decoder-Based Evolutionary Algorithms.

Jens Gottlieb, Günther Raidl (1999). Characterizing Locality in Decoder-Based EAs for the Multidimensional Knapsack Problem.

Günther Raidl (1999). An Evolutionary Approach to Point-Feature Label Placement.

Günther Raidl (1999). A Weight-Coded Genetic Algorithm for the Multiple Container Packing Problem.

Ingeborg Tastl, Günther Raidl (1998). Transforming an Analytically Defined Color Space to Match Psychophysically Gained Color Distances.

(1998). Proceedings of the International Conference on Imaging Science, Systems, and Technology.

Günther Raidl, Gabriele Kodydek (1998). Genetic Algorithms for the Multiple Container Packing Problem.

Günther Raidl, Gabriele Kodydek (1998). Evolutionary Optimized Tensor Product Bernstein Polynomials versus Backpropagation Networks.

Günther Raidl, Christian Wurm (1998). Approximation with Evolutionary Optimized Tensor Product Bernstein Polynomials.

Günther Raidl (1998). An Improved Genetic Algorithm for the Multiconstrained 0--1 Knapsack Problem.

Günther Raidl (1998). A Hybrid GP Approach for Numerically Robust Symbolic Regression.

Günther Raidl (1998). A Genetic Algorithm for Labeling Point Features.

Günther Raidl (1994). Progressives, adaptives Ray-Tracing von Bildern mit hoher zeitlicher Kohärenz.

Frohner, Nikolaus, Gmys, Jan, Melab, Nourdine,, Günther Raidl, Talbi, El-Ghazali (1970). Parallel Beam Search for Combinatorial Optimization.

Akanksha Agrawal, R. Krithika, Daniel Lokshtanov, Amer E. Mouawad, M. S. Ramanujan (1970). On the Parameterized Complexity of Simultaneous Deletion Problems.

Eduard Eiben, Danny Hermelin, M. S. Ramanujan (1970). Lossy Kernels for Hitting Subgraphs.

Fedor v. Fomin, Petr A. Golovach, Danil Sagunov, Kirill Simonov (1970). Algorithmic Extensions of Dirac's Theorem.

PDF Cite Project DOI