Publications
Here is a list of recent publications of former and current members of the Algorithms and Complexity group. A list including older publications can be found here. Technical reports can be found here.
2020 and to appear
15 results| 2020 | |
| [15] | An Iterative Time-Bucket Refinement Algorithm for a High-Resolution Resource-Constrained Project Scheduling Problem International Transactions in Operational Research, jan 2020. |
| [14] | A* Search for Prize-Collecting Job Sequencing with One Common and Multiple Secondary Resources Annals of Operations Research, 2020. Note: previous technical report version at https://www.ac.tuwien.ac.at/files/tr/ac-tr-19-002.pdf |
| [13] | Placing Labels in Road Maps: Algorithms and Complexity Algorithmica, 2020. |
| [12] | Anytime Algorithms for the Longest Common Palindromic Subsequence Problem Computers & Operations Research, volume 114, pages 104827, 2020, Elsevier. |
| [11] | Solving Integer Linear Programs by Exploiting Variable-Constraint Interactions: a Survey MDPI Algorithms, 2020. Note: to appear |
| [10] | Using Decomposition-Parameters for QBF: Mind the Prefix! Journal of Computer and System Sciences, 2020. Note: to appear |
| [9] | Parameterized Algorithms for Book Embedding Problems J. Graph Algorithms Appl., 2020. Note: to appear |
| [8] | A Beam Search Approach to the Traveling Tournament Problem Evolutionary Computation in Combinatorial Optimization – 20th European Conference, EvoCOP 2020, Held as Part of EvoStar 2020 (Luís Paquete, Christine Zarges, eds.), 2020, Springer. Note: to appear |
| [7] | Geometric Planar Networks on Bichromatic Points Algorithms and Discrete Applied Mathematics (CALDAM'20) (Manoj Changat, Sandip Das, eds.), volume 12016 of LNCS, pages 79–91, 2020, Springer. |
| [6] | Computing Optimal Hypertree Decompositions Proceedings of ALENEX 2020, the 22nd Workshop on Algorithm Engineering and Experiments (Guy Blelloch, Irene Finocchi, eds.), pages 1–11, 2020, Society for Industrial and Applied Mathematics (SIAM). |
| [5] | On the Parameterized Complexity of Clustering Incomplete Data into Subspaces of Small Dimension Proceeding of AAAI-20, the Thirty-Fourth AAAI Conference on Artificial Intelligence, February 7–12, 2020, New York, 2020. Note: to appear |
| [4] | An Efficient Algorithm for Counting Markov Equivalent DAGs Proceeding of AAAI-20, the Thirty-Fourth AAAI Conference on Artificial Intelligence, February 7–12, 2020, New York, 2020. Note: to appear |
| [3] | Parameterized Complexity of Envy-Free Resource Allocation in Social Networks Proceeding of AAAI-20, the Thirty-Fourth AAAI Conference on Artificial Intelligence, February 7–12, 2020, New York, 2020. Note: to appear |
| [2] | On Covering Segments with Unit Intervals 37th Symposium on Theoretical Aspects of Computer Science, STACS 2020, 2020, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik. Note: to appear |
| [1] | mar 2020, Master's thesis, TU Wien, Institute of Logic and Computation. Note: supervised by G. Raidl and A. Chwatal |
2019
63 results| 2019 | |
| [63] | Metabopolis: scalable network layout for biological pathway diagrams in urban map style BMC Bioinformatics, volume 20, pages 187, 2019. |
| [62] | Exact Approaches for Network Design Problems with Relays INFORMS Journal on Computing, volume 31, number 1, pages 171–192, 2019. |
| [61] | Photonic-integrated circuits with non-planar topologies realized by 3D-printed waveguide overpasses Optics Express, volume 27, number 12, pages 17402–17425, 2019. |
| [60] | Minimizing crossings in constrained two-sided circular graph layouts J. Computational Geometry, volume 10, number 2, pages 45–69, 2019. |
| [59] | Lombardi Drawings of Knots and Links J. Computational Geometry, volume 10, number 1, pages 444–476, 2019. |
| [58] | Job Sequencing with One Common and Multiple Secondary Resources: An A*/Beam Search Based Anytime Algorithm Artificial Intelligence, volume 277, number 103173, 2019. |
| [57] | Short Plane Supports for Spatial Hypergraphs J. Graph Algorithms Appl., volume 23, number 3, pages 463–498, 2019. |
| [56] | On the Readability of Leaders in Boundary Labeling Information Visualization, volume 18, number 1, pages 110–132, 2019. |
| [55] | External Labeling Techniques: A Taxonomy and Survey Computer Graphics Forum, volume 38, number 3, pages 833–860, 2019. |
| [54] | Planar Drawings of Fixed-Mobile Bigraphs Theoretical Computer Science, volume 795, pages 408–419, 2019. |
| [53] | Guidelines for Experimental Algorithmics: A Case Study in Network Analysis Algorithms, volume 12, number 7, pages 127:1–127:37, 2019. |
| [52] | Dependency Learning for QBF Journal Artificial Intelligence Research, volume 65, pages 180–208, 2019. |
| [51] | Long-Distance Q-Resolution with Dependency Schemes Journal of Automated Reasoning, volume 63, number 1, pages 127–155, 2019. |
| [50] | On the Parameterized Complexity of (k,s)-SAT Information Processing Letters, volume 143, pages 34–36, 2019. |
| [49] | A SAT Approach to Branchwidth ACM Transactions on Computational Logic, volume 20, number 3, pages 15:1–15:24, 2019. |
| [48] | On the Complexity Landscape of Connected f-Factor Problems Algorithmica, 2019. |
| [47] | Parameterized Complexity of Asynchronous Border Minimization Algorithmica, volume 81, number 1, pages 201–223, 2019. |
| [46] | Shrub-Depth: Capturing Height of Dense Graphs Logical Methods in Computer Science, 2019. |
| [45] | Counting linear extensions: Parameterizations by treewidth Algorithmica, 2019. |
| [44] | Compendium of Parameterized Problems at Higher Levels of the Polynomial Hierarchy MDPI Algorithms, volume 12, number 9, pages 1–28, 2019. |
| [43] | VNS and PBIG as Optimization Cores in a Cooperative Optimization Approach for Distributing Service Points Chapter in Extended Abstracts of the 17th International Conference on Computer Aided Systems Theory (EUROCAST 2019) (Alexis Quesada-Arencibia, others, eds.), pages 70–71, feb 2019. |
| [42] | Metaheuristic Hybrids Chapter in Handbook of Metaheuristics (Michel Gendreau, Jean Yves Potvin, eds.), pages 385–417, 2019, Springer. Note: previous technical report version at https://www.ac.tuwien.ac.at/files/pub/raidl-19.pdf |
| [41] | Decision Diagram Based Limited Discrepancy Search for a Job Sequencing Problem Chapter in Extended Abstracts of the 17th International Conference on Computer Aided Systems Theory (EUROCAST 2019) (Alexis Quesada-Arencibia, others, eds.), pages 94–95, 2019. |
| [40] | Casual Employee Scheduling with Constraint Programming and Ant Colony Optimization Chapter in Extended Abstracts of the 17th International Conference on Computer Aided Systems Theory (EUROCAST 2019) (Alexis Quesada-Arencibia, others, eds.), pages 78–79, 2019. |
| [39] | A Memetic Algorithm for Competitive Facility Location Problems Chapter in Business and Consumer Analytics: New Ideas, pages 637–660, 2019, Springer. |
| [38] | Strategies for Iteratively Refining Layered Graph Models Hybrid Metaheuristics: 11th International Workshop, HM 2019 (M. J. Blesa Aguilera, C. Blum, H. Gambini Santos, P. Pinacho-Davidson, J. Godoy del Campo, eds.), volume 11299 of LNCS, pages 46–62, 2019, Springer. |
| [37] | Computing Stable Demers Cartograms Graph Drawing and Network Visualization (GD'19) (Daniel Archambault, Csaba D. Tóth, eds.), volume 11904 of LNCS, pages 46–60, 2019, Springer. |
| [36] | A SAT Approach for Finding Sup-Transition-Minors Learning and Intelligent Optimization. LION 2019, volume 11968 of LNCS, pages 325–341, 2019, Springer. |
| [35] | Exploiting Similar Behavior of Users in a Cooperative Optimization Approach for Distributing Service Points in Mobility Applications Machine Learning, Optimization, and Data Science – 5th International Conference, LOD 2019 (Giuseppe Nicosia, Panos Pardalos, Renato Umeton, Giovanni Giuffrida, Vincenzo Sciacca, eds.), volume 11943 of LNCS, pages 738–750, 2019, Springer. |
| [34] | A Cooperative Optimization Approach for Distributing Service Points in Mobility Applications Evolutionary Computation in Combinatorial Optimization (Arnaud Liefooghe, Luís Paquete, eds.), volume 11452 of LNCS, pages 1–16, 2019, Springer. |
| [33] | A Biased Random Key Genetic Algorithm with Rollout Evaluations for the Resource Constraint Job Scheduling Problem Proceedings of AI 2019: Advances in Artificial Intelligence (Jixue Liu, James Bailey, eds.), volume 11919 of LNCS, pages 549–560, 2019, Springer. |
| [32] | Decision Diagram Based Limited Discrepancy Search for a Job Sequencing Problem Computer Aided Systems Theory – EUROCAST 2019 (Roberto Moreno-Díaz, Franz Pichler, Alexis Quesada-Arencibia, eds.), 2019, Springer. Note: to appear |
| [31] | Maximizing Ink in Partial Edge Drawings of k-plane Graphs Graph Drawing and Network Visualization (GD'19) (Daniel Archambault, Csaba D. Tóth, eds.), volume 11904 of LNCS, pages 323–336, 2019, Springer. |
| [30] | Efficient Segment Folding is Hard Canadian Conference on Computational Geometry (CCCG'19), pages 177–183, 2019. |
| [29] | Exploring Semi-Automatic Map Labeling Advances in Geographic Information Systems (SIGSPATIAL'19), pages 13–22, 2019, ACM. |
| [28] | Merging Quality Estimation for Binary Decision Diagrams with Binary Classifiers Machine Learning, Optimization, and Data Science – 5th International Conference, LOD 2019 (Giuseppe Nicosia, Panos Pardalos, Renato Umeton, Giovanni Giuffrida, Vincenzo Sciacca, eds.), volume 11943 of LNCS, pages 445–457, 2019, Springer. |
| [27] | Casual Employee Scheduling with Constraint Programming and Metaheuristics Computer Aided Systems Theory – EUROCAST 2019 (Roberto Moreno-Díaz, Franz Pichler, Alexis Quesada-Arencibia, eds.), 2019, Springer. Note: to appear |
| [26] | Towards Improving Merging Heuristics for Binary Decision Diagrams Proceedings of LION 13 – 13th International Conference on Learning and Intelligent Optimization, volume 11968 of LNCS, pages 30–45, 2019, Springer. |
| [25] | On Strict (Outer-)Confluent Graphs Graph Drawing and Network Visualization (GD'19) (Daniel Archambault, Csaba D. Tóth, eds.), volume 11904 of LNCS, pages 147–161, 2019, Springer. |
| [24] | A Heuristic Approach for Solving the Longest Common Square Subsequence Problem Proceedings of EUROCAST 2019 – 17th International Conference on Computer Aided Systems Theory (Roberto Moreno-Díaz, Franz Pichler, Alexis Quesada-Arencibia, eds.), 2019, Springer. Note: to appear |
| [23] | A Heuristic Approach for Solving the Longest Common Square Subsequence Problem Extended Abstracts of the Seventeenth International Conference on Computer Aided Systems Theory (EUROCAST 2019), 2019. Note: accepted for presenting |
| [22] | Exact and Heuristic Approaches for the Longest Common Palindromic Subsequence Problem Proceedings of LION 12 – 12th International Conference on Learning and Intelligent Optimization, volume 11353 of LNCS, pages 199–214, 2019, Springer. |
| [21] | Mixed Linear Layouts: Complexity, Heuristics, and Experiments Graph Drawing and Network Visualization (GD'19) (Daniel Archambault, Csaba D. Tóth, eds.), volume 11904 of LNCS, pages 460–467, 2019, Springer. |
| [20] | Parameterized Algorithms for Book Embedding Problems Graph Drawing and Network Visualization (GD'19) (Daniel Archambault, Csaba D. Tóth, eds.), volume 11904 of LNCS, pages 365–378, 2019, Springer. |
| [19] | Group Activity Selection with Few Agent Types 27th Annual European Symposium on Algorithms, ESA 2019, September 9-11, 2019, Munich/Garching, Germany (Michael A. Bender, Ola Svensson, Grzegorz Herman, eds.), pages 48:1–48:16, 2019. |
| [18] | Proof Complexity of Fragments of Long-Distance Q-resolution Proceedings of SAT 2019, the 22nd International Conference on Theory and Applications of Satisfiability Testing, July 7–12, 2019, Lisbon, Portugal (Mikoláš Janota, Inês Lynce, eds.), volume 11628 of Lecture Notes in Computer Science, pages 319–335, 2019, Springer Verlag. |
| [17] | Combining Resolution-Path Dependencies with Dependency Learning Proceedings of SAT 2019, the 22nd International Conference on Theory and Applications of Satisfiability Testing, July 7–12, 2019, Lisbon, Portugal (Mikoláš Janota, Inês Lynce, eds.), volume 11628 of Lecture Notes in Computer Science, pages 306–318, 2019, Springer Verlag. |
| [16] | A Join-Based Hybrid Parameter for Constraint Satisfaction Proceedings of CP 2019, the 25th International Conference on Principles and Practice of Constraint Programming (Thomas Schiex, Simon de Givry, eds.), volume 11802 of Lecture Notes in Computer Science, pages 195–212, 2019, Springer Verlag. |
| [15] | The Power of Cut-Based Parameters for Computing Edge Disjoint Paths Graph-Theoretic Concepts in Computer Science - 45th International Workshop, WG 2019, Vall de Núria, Spain, June 19-21, 2019, Revised Papers (Ignasi Sau, Dimitrios M. Thilikos, eds.), pages 190–204, 2019. |
| [14] | SAT-Encodings for Treecut Width and Treedepth Proceedings of ALENEX 2019, the 21st Workshop on Algorithm Engineering and Experiments (Stephen G. Kobourov, Henning Meyerhenke, eds.), pages 117–129, 2019, Society for Industrial and Applied Mathematics (SIAM). |
| [13] | On Strict (Outer-)Confluent Graphs Proceedings of GD 2019, the 27th International Symposium on Graph Drawing and Network Visualization, 2019. Note: To appear |
| [12] | Solving integer quadratic programming via explicit and structural restrictions The Thirty-Third AAAI Conference on Artificial Intelligence, AAAI 2019, Honolulu, Hawaii, USA, January 27 - February 1, 2019 (Pascal Van Hentenryck, Zhi-Hua Zhou, eds.), pages 1477–1484, 2019. |
| [11] | The Parameterized Complexity of Cascading Portfolio Scheduling Proceedings of NeurIPS 2019, the Thirty-third Conference on Neural Information Processing Systems, 2019. Note: To appear |
| [10] | Measuring what Matters: A Hybrid Approach to Dynamic Programming with Treewidth 44th International Symposium on Mathematical Foundations of Computer Science, MFCS 2019, August 26-30, 2019, Aachen, Germany (Peter Rossmanith, Pinar Heggernes, Joost-Pieter Katoen, eds.), pages 42:1–42:15, 2019. |
| [9] | Integer Programming and Incidence Treedepth? Proceedings of IPCO 2019, The 20th Conference on Integer Programming and Combinatorial Optimization, 2019. Note: To appear |
| [8] | Parameterized Algorithms for Book Embedding Problems Proceedings of GD 2019, the 27th International Symposium on Graph Drawing and Network Visualization, 2019. Note: To appear |
| [7] | Algorithmic Approaches for Optimization Problems in Bike Sharing and Security Control mar 2019, PhD thesis, Institute of Logic and Computation, TU Wien. Note: supervised by Günther R. Raidl |
| [6] | Patient Scheduling in Particle Therapy mar 2019, PhD thesis, Institute of Logic and Computation, TU Wien. Note: supervised by G. R. Raidl |
| [5] | A Variable Neighborhood Search for the Job Sequencing with One Common and Multiple Secondary Resources Problem dec 2019, Master's thesis, TU Wien, Institute of Logic and Computation. Note: supervised by G. Raidl and M. Horn |
| [4] | Perfect Pseudo Matchings on Snarks may 2019, Master's thesis, TU Wien, Institute of Logic and Computation. Note: supervised by G. Raidl |
| [3] | Solving a Weighted Set Covering Problem for Improving Algorithms for Cutting Stock Problems with Setup Costs by Solution Merging apr 2019, Master's thesis, TU Wien, Institute of Logic and Computation. Note: supervised by G. Raidl |
| [2] | Automated Calculation of Optimal Adjustment Parameters for Myoelectric Hand Prostheses mar 2019, Master's thesis, TU Wien, Institute of Logic and Computation. Note: supervised by G. Raidl |
| [1] | A Heuristic Approach to Aircraft Trajectory Optimization with Constraints mar 2019, Master's thesis, TU Wien, Institute of Logic and Computation. Note: supervised by G. Raidl |
2018
46 results2017
57 results2016
70 results| 2016 | |
| [70] | Hybrid Metaheuristics – Powerful Tools for Optimization 2016, Springer. |
| [69] | Proc. 24th International Symposium on Graph Drawing and Network Visualization (GD'16) (Yifan Hu, Martin Nöllenburg, eds.), volume 9801 of LNCS, 2016, Springer International Publishing. |
| [68] | A Multi-Commodity Flow Based Model for Multi Layer Hierarchical Ring Network Design Electronic Notes in Discrete Mathematics, volume 52, pages 189–196, 2016. Note: INOC 2015 – 7th International Network Optimization Conference |
| [67] | New Developments in Metaheuristics and their Applications – Selected Extended Contributions from the 10th Metaheuristics International Conference (MIC 2013) Journal of Heuristics, volume 22, number 4, pages 359–363, 2016. |
| [66] | On Self-Approaching and Increasing-Chord Drawings of 3-Connected Planar Graphs J. Computational Geometry, volume 7, number 1, pages 47–69, 2016. |
| [65] | Extending Convex Partial Drawings of Graphs Algorithmica, volume 76, number 1, pages 47–67, 2016. |
| [64] | Mixed Map Labeling J. Spatial Information Science, volume 13, pages 3–32, 2016. |
| [63] | A Memetic Algorithm for the Virtual Network Mapping Problem Journal of Heuristics, volume 22, number 4, pages 475–505, 2016. Note: previous technical report version at https://www.ac.tuwien.ac.at/files/pub/infuehr-14.pdf |
| [62] | Evaluation of Labeling Strategies for Rotating Maps ACM J. Experimental Algorithmics, volume 21, number 1, pages 1.4:1–1.4:21, 2016. |
| [61] | Consistent Labeling of Rotating Maps J. Computational Geometry, volume 7, number 1, pages 308–331, 2016. |
| [60] | Strict Confluent Drawing J. Computational Geometry, volume 7, number 1, pages 22–46, 2016. |
| [59] | Computational Performance Evaluation of Two Integer Linear Programming Models for the Minimum Common String Partition Problem Optimization Letters, volume 10, number 1, pages 189–205, 2016. Note: previous technical report version at https://www.ac.tuwien.ac.at/files/pub/blum-15.pdf |
| [58] | An Integer L-shaped Method for the Generalized Vehicle Routing Problem with Stochastic Demands Electronic Notes in Discrete Mathematics, volume 52, pages 245–252, 2016. Note: INOC 2015 – 7th International Network Optimization Conference |
| [57] | Models and Algorithms for Competitive Facility Location Problems with Different Customer Behavior Annals of Mathematics and Artificial Intelligence, volume 76, number 1, pages 93–119, 2016, Springer. Note: previous technical report version at https://www.ac.tuwien.ac.at/files/pub/biesinger-14b.pdf |
| [56] | Adjacency-Preserving Spatial Treemaps J. Computational Geometry, volume 7, number 1, pages 100-122, 2016. |
| [55] | Quantifier reordering for QBF Journal of Automated Reasoning, volume 56, number 4, pages 459–477, 2016. |
| [54] | Soundness of Q-resolution with dependency schemes Theoretical Computer Science, volume 612, pages 83–101, 2016. |
| [53] | Model Counting for CNF Formulas of Bounded Modular Treewidth Algorithmica, volume 76, number 1, pages 168–194, 2016. |
| [52] | A Parameterized Study of Maximum Generalized Pattern Matching Problems Algorithmica, volume 75, number 1, pages 1–26, 2016. |
| [51] | Complexity and monotonicity results for domination games Theor. Comput. Sci., volume 628, pages 1–29, 2016. |
| [50] | Tree-depth and vertex-minors Eur. J. Comb., volume 56, pages 46–56, 2016. |
| [49] | Backdoors to q-Horn Algorithmica, volume 74, number 1, pages 540–557, 2016. |
| [48] | Meta-Kernelization with Structural Parameters Journal of Computer and System Sciences, volume 82, number 2, pages 333–346, 2016. |
| [47] | FO Model Checking of Interval Graphs Logical Methods in Computer Science, volume 11, number 4, 2016. |
| [46] | Are There Any Good Digraph Measures? Journal of Combinatorial Theory, Series B, volume 116, pages 250–286, 2016. |
| [45] | Directed elimination games Discrete Applied Mathematics, volume 199, pages 187–198, 2016. |
| [44] | Quantified Conjunctive Queries on Partially Ordered Sets Theoretical Computer Science, volume 618, pages 72–84, 2016. |
| [43] | Model Checking Existential Logic on Partially Ordered Sets ACM Transactions on Computational Logic, volume 17, number 2, 2016. |
| [42] | Partially Polynomial Kernels for Set Cover and Test Cover SIAM J. Discrete Math., volume 30, number 3, pages 1401–1423, 2016. |
| [41] | Time-Bucket Relaxation Based Mixed Integer Programming Models for Scheduling Problems: A Promising Starting Point for Matheuristics Proceedings of Matheuristics 2016: 6th International Workshop on Model-Based Metaheuristics (T. Stützle, V. Maniezzo, eds.), pages 104–107, 2016. |
| [40] | Districting and Routing for Security Control Hybrid Metaheuristics: 10th International Workshop, HM 2016 (Maria J. Blesa, Christian Blum, Angelo Cangelosi, Vicenzo Cutello, Alessandro Di Nuovo, Mario Pavone, El-Ghazali Talbi, eds.), volume 9668 of LNCS, pages 87–103, 2016, Springer. |
| [39] | Software Visualization via Hierarchic Micro/Macro Layouts Information Visualization Theory and Applications (IVAPP'16) (Lars Linsen, Alexandru C. Telea, eds.), pages 153–160, 2016, SciTePress. |
| [38] | An Algorithmic Framework for Labeling Road Maps Geographic Information Science (GIScience '16) (Jennifer A. Miller, David O'Sullivan, Nancy Wiegand, eds.), volume 9927 of LNCS, pages 308–322, 2016, Springer International Publishing. |
| [37] | Particle Therapy Patient Scheduling: First Heuristic Approaches PATAT 2016: Proceedings of the 11th International Conference of the Practice and Theory of Automated Timetabling, pages 223–244, 2016. |
| [36] | Finding Uniquely Hamiltonian Graphs of Minimum Degree Three with Small Crossing Numbers Hybrid Metaheuristics: 10th International Workshop, HM 2016 (Maria J. Blesa, Christian Blum, Angelo Cangelosi, Vicenzo Cutello, Alessandro Di Nuovo, Mario Pavone, El-Ghazali Talbi, eds.), volume 9668 of LNCS, pages 1–16, 2016, Springer. |
| [35] | Temporal Map Labeling: A New Unified Framework with Experiments Advances in Geographic Information Systems (SIGSPATIAL'16), pages 23:1–23:10, 2016. |
| [34] | A Faster Parameterized Algorithm for Group Feedback Edge Set Graph-Theoretic Concepts in Computer Science - 42nd International Workshop, WG 2016, Istanbul, Turkey, June 22-24, 2016, Revised Selected Papers, pages 269–281, 2016. |
| [33] | A Parameterized Algorithm for Mixed-Cut LATIN 2016: Theoretical Informatics - 12th Latin American Symposium, Ensenada, Mexico, April 11-15, 2016, Proceedings, pages 672–685, 2016. |
| [32] | Strong Parameterized Deletion: Bipartite Graphs 36th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2016, December 13-15, 2016, Chennai, India, pages 21:1–21:14, 2016. |
| [31] | Long Distance Q-Resolution with Dependency Schemes Theory and Applications of Satisfiability Testing - SAT 2016 - 19th International Conference, Bordeaux, France, July 5-8, 2016, Proceedings (Nadia Creignou, Daniel Le Berre, eds.), volume 9710 of Lecture Notes in Computer Science, pages 500–518, 2016, Springer Verlag. |
| [30] | Backdoors for Linear Temporal Logic 11th International Symposium on Parameterized and Exact Computation (IPEC 2016) (Jiong Guo, Danny Hermelin, eds.), volume 63 of Leibniz International Proceedings in Informatics (LIPIcs), pages 23:1–23:17, 2016, Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik. |
| [29] | A SAT Approach to Branchwidth Theory and Applications of Satisfiability Testing - SAT 2016 - 19th International Conference, Bordeaux, France, July 5-8, 2016, Proceedings (Nadia Creignou, Daniel Le Berre, eds.), volume 9710 of Lecture Notes in Computer Science, pages 179–195, 2016, Springer Verlag. |
| [28] | Edge-Editing to a Dense and a Sparse Graph Class LATIN 2016: Theoretical Informatics - 12th Latin American Symposium, Ensenada, Mexico, April 11-15, 2016, Proceedings (Evangelos Kranakis, Gonzalo Navarro, Edgar Chávez, eds.), volume 9644 of Lecture Notes in Computer Science, pages 562–575, 2016, Springer Verlag. |
| [27] | Backdoors to Tractable Valued CSP Principles and Practice of Constraint Programming - 22nd International Conference, CP 2016, Toulouse, France, September 5-9, 2016, Proceedings (Michel Rueher, ed.), volume 9892 of Lecture Notes in Computer Science, pages 233–250, 2016, Springer Verlag. |
| [26] | Discovering Archipelagos of Tractability for Constraint Satisfaction and Counting Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2016, Arlington, VA, USA, January 10-12, 2016, pages 1670–1681, 2016. |
| [25] | The Complexity Landscape of Decompositional Parameters for ILP Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence (Dale Schuurmans, Michael P. Wellman, eds.), pages 710–716, 2016, AAAI Press. |
| [24] | Polynomial-Time Construction of Optimal MPI Derived Datatype Trees 2016 IEEE International Parallel and Distributed Processing Symposium, IPDPS 2016, Chicago, IL, USA, May 23-27, 2016, pages 638–647, 2016, IEEE Computer Society. |
| [23] | On Existential MSO and its Relation to ETH 41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016) (Piotr Faliszewski, Anca Muscholl, Rolf Niedermeier, eds.), volume 58 of Leibniz International Proceedings in Informatics (LIPIcs), pages 42:1–42:14, 2016, Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik. |
| [22] | A New Perspective on FO Model Checking of Dense Graph Classes Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science, LICS '16, New York, NY, USA, July 5-8, 2016, pages 176–184, 2016. |
| [21] | On the Complexity Landscape of Connected f-factor Problems Mathematical Foundations of Computer Science 2016 - 41st International Symposium, MFCS 2016 (Piotr Faliszewski, Anca Muscholl, Rolf Niedermeier, eds.), pages 41:1–41:14, 2016, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik. |
| [20] | Succinctness of Languages for Judgment Aggregation Proceedings of KR 2016, the Fifteenth International Conference on Principles of Knowledge Representation and Reasoning, Cape Town, South Africa, April 25-29, 2016 (Chitta Baral, James P. Delgrande, Frank Wolter, eds.), pages 176–186, 2016, AAAI Press. |
| [19] | Counting Linear Extensions: Parameterizations by Treewidth 24th European Symposium of Algorithms, ESA 2016, volume 57 of LIPIcs, pages 39:1–39:18, 2016, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik. |
| [18] | Using Decomposition-Parameters for QBF: Mind the Prefix! Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence (Dale Schuurmans, Michael P. Wellman, eds.), pages 964–970, 2016, AAAI Press. |
| [17] | A Single-Exponential Fixed-Parameter Algorithm for Distance-Hereditary Vertex Deletion Mathematical Foundations of Computer Science 2016 - 41st International Symposium, MFCS 2016 (Piotr Faliszewski, Anca Muscholl, Rolf Niedermeier, eds.), volume 58 of LIPIcs, pages 34:1–34:14, 2016, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik. |
| [16] | Parameterized Complexity Results for Symbolic Model Checking of Temporal Logics Proceedings of KR 2016, the Fifteenth International Conference on Principles of Knowledge Representation and Reasoning, Cape Town, South Africa, April 25-29, 2016 (Chitta Baral, James P. Delgrande, Frank Wolter, eds.), pages 453–462, 2016, AAAI Press. |
| [15] | Parameterized Complexity Results for the Kemeny Rule in Judgment Aggregation Proceedings of the 22nd European Conference on Artificial Intelligence (ECAI 2016) (Gal A. Kaminka, Maria Fox, Paolo Bouquet, Eyke Hüllermeier, Virginia Dignum, Frank Dignum, Frank van Harmelen, eds.), volume 285 of Frontiers in Artificial Intelligence and Applications, pages 1502–1510, 2016. |
| [14] | Parameterized Complexity Results for the Kemeny Rule in Judgment Aggregation Proceedings of ComSoc 2016, the Sixth International Workshop on Computational Social Choice, 2016. |
| [13] | Knowledge Compilation Meets Communication Complexity Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence (IJCAI), 9-15 July, 2016, New York, NY, USA, pages 1008–1014, 2016. |
| [12] | SDDs Are Exponentially More Succinct than OBDDs Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence, February 12-17, 2016, Phoenix, Arizona, USA, pages 929–935, 2016. |
| [11] | SOBRA - Shielding Optimization for BRAchytherapy Combinatorial Algorithms - 27th International Workshop, IWOCA 2016, Helsinki, Finland, August 17-19, 2016, Proceedings (Veli Mäkinen, Simon J. Puglisi, Leena Salmela, eds.), volume 9843 of Lecture Notes in Computer Science, pages 309–320, 2016, Springer Verlag. |
| [10] | Clique-Width and Directed Width Measures for Answer-Set Programming ECAI 2016 - 22nd European Conference on Artificial Intelligence, 29 August-2 September 2016, The Hague, The Netherlands - Including Prestigious Applications of Artificial Intelligence (PAIS 2016) (Gal A. Kaminka, Maria Fox, Paolo Bouquet, Eyke Hüllermeier, Virginia Dignum, Frank Dignum, Frank van Harmelen, eds.), volume 285 of Frontiers in Artificial Intelligence and Applications, pages 1105–1113, 2016, IOS Press. |
| [9] | Stable Matching with Uncertain Linear Preferences Proceedings of SAGT 2016, the 9th International Symposium on Algorithmic Game Theory (Martin Gairing, Rahul Savani, eds.), volume 9928 of Lecture Notes in Computer Science, pages 195–206, 2016, Springer Verlag. |
| [8] | Complete Solution Archives for Evolutionary Combinatorial Optimization: Application to a Competitive Facility Location and Stochastic Vehicle Routing Problem Apr 2016, PhD thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms. Note: supervised by G. R. Raidl and B. Hu |
| [7] | Parameterized Complexity in the Polynomial Hierarchy 2016, PhD thesis, Technische Universität Wien. |
| [6] | Metaheuristics for the Districting and Routing Problem for Security Control May 2016, Master's thesis, TU Wien, Institute of Computer Graphics and Algorithms. Note: supervised by G. Raidl, B. Biesinger, and C. Kloimüllner |
| [5] | Column Generation at Strip Level for the k-Staged Two-Dimensional Cutting Stock Problem Mar 2016, Master's thesis, TU Wien, Institute of Computer Graphics and Algorithms. Note: supervised by G. Raidl and F. Dusberger |
| [4] | A Branch-and-Bound Approach for the Constrained k-Staged 2-Dimensional Cutting Stock Problem Jan 2016, Master's thesis, TU Wien, Institute of Computer Graphics and Algorithms. Note: supervised by G. Raidl and F. Dusberger |
| [3] | Visibility Based Obstacle Placing – Automated Obstacle Placing Based on Circularity Jan 2016, Master's thesis, TU Wien, Institute of Computer Graphics and Algorithms. Note: supervised by G. Raidl and R. Schaffranek |
| [2] | Positive and Negative Results for Parameterized Compilability 2016, Technical report AC-TR-16-003, Algorithms and Complexity Group, TU Wien. |
| [1] | Complexity Results for Manipulation, Bribery and Control of the Kemeny Procedure in Judgment Aggregation August 2016, Technical report 1608.02406, arXiv.org. |
2015
74 results| 2015 | |
| [74] | Backdoors to Tractable Answer Set Programming Artificial Intelligence, volume 220, pages 64–103, March 2015. |
| [73] | Numerische Optimierung elektrifizierter Antriebsstränge Motortechnische Zeitschrift (MTZ), volume 03, pages 66–74, Mar 2015, Springer. |
| [72] | Numerical Optimisation of Electro-Hybrid Powertrains MTZ Worldwide, volume 03, pages 46–52, Mar 2015, Springer. |
| [71] | PILOT, GRASP, and VNS Approaches for the Static Balancing of Bicycle Sharing Systems Journal of Global Optimization, volume 63, number 3, pages 597-629, 2015, Springer. |
| [70] | Decomposition Based Hybrid Metaheuristics European Journal of Operational Research, volume 244, pages 66-76, 2015. Note: previous technical report version at https://www.ac.tuwien.ac.at/files/pub/raidl-15.pdf |
| [69] | Metaheuristics for Solving a Multimodal Home-Healthcare Scheduling Problem Central European Journal of Operations Research, volume 23, number 1, pages 89-113, 2015. Note: previous technical report version at https://www.ac.tuwien.ac.at/files/pub/hiermann-13.pdf |
| [68] | Multi-Row Boundary-Labeling Algorithms for Panorama Images ACM Trans. Spatial Algorithms and Systems, volume 1, number 1, pages 1:1–1:30, 2015. |
| [67] | A Hybrid Genetic Algorithm with Solution Archive for the Discrete (r|p)-Centroid Problem Journal of Heuristics, volume 21, number 3, pages 391-431, 2015, Springer US. Note: previous technical report version at https://www.ac.tuwien.ac.at/files/pub/biesinger-14.pdf |
| [66] | Empirical Evaluation for Graph Drawing (Dagstuhl Seminar 15052) Dagstuhl Reports, volume 5, number 1, pages 243–258, 2015. |
| [65] | Many-to-One Boundary Labeling with Backbones J. Graph Algorithms Appl., volume 19, number 3, pages 779–816, 2015. |
| [64] | Computing secure sets in graphs using answer set programming Journal of Logic and Computation, 2015. |
| [63] | Parameterized and subexponential-time complexity of satisfiability problems and applications Theoretical Computer Science, volume 607, pages 282–295, 2015. |
| [62] | A SAT Approach to Clique-Width ACM Transactions on Computational Logic, volume 16, number 3, pages 24, 2015. |
| [61] | Faster Parameterized Algorithms for Deletion to Split Graphs Algorithmica, volume 71, number 4, pages 989–1006, 2015. |
| [60] | On finding optimal polytrees Theoretical Computer Science, volume 592, pages 49–58, 2015. |
| [59] | Improving Vertex Cover as a Graph Parameter Discrete Mathematics & Theoretical Computer Science, volume 17, number 2, pages 77–100, 2015. |
| [58] | Backdoors to Normality for Disjunctive Logic Programs ACM Transactions on Computational Logic, volume 17, number 1, 2015. |
| [57] | On the Subexponential-Time Complexity of CSP Journal Artificial Intelligence Research, volume 52, pages 203–234, 2015. |
| [56] | The complexity of equivalence, entailment, and minimization in existential positive logic Journal of Computer and System Sciences, volume 81, number 2, pages 443–457, 2015. |
| [55] | A complete parameterized complexity analysis of bounded planning Journal of Computer and System Sciences, volume 81, number 7, pages 1311–1332, 2015. |
| [54] | Heuristic Approaches for the Probabilistic Traveling Salesman Problem Chapter in Extended Abstracts of the Fifthteenth International Conference on Computer Aided Systems Theory (EUROCAST 2015) (A. Quesada-Arencibia, others, eds.), pages 99 – 100, 2015. |
| [53] | A New Type of Metamodel for Longitudinal Dynamics Optimization of Hybrid Electric Vehicles Chapter in Extended Abstracts of the Fifthteenth International Conference on Computer Aided Systems Theory (EUROCAST 2015) (A. Quesada-Arencibia, others, eds.), pages 119–120, 2015. |
| [52] | Machine Characterizations for Parameterized Complexity Classes Beyond Para-NP SOFSEM 2015: Theory and Practice of Computer Science - 41st International Conference on Current Trends in Theory and Practice of Computer Science, Pec pod Sn\ve\vzkou, Czech Republic, January 24-29, 2015. Proceedings, volume 8939 of Lecture Notes in Computer Science, pages 217–229, January 2015, Springer Verlag. |
| [51] | Metaheuristics for the Two-Dimensional Container Pre-Marshalling Problem Conference Proceedings of Learning and Intelligent Optimization Conference (LION 9), volume 8994 of LNCS, pages 186-201, 2015, Springer. |
| [50] | On the Comparison of Decoding Strategies for a Memetic Algorithm for the Multi-Layer Hierarchical Ring Network Design Problem Computer Aided Systems Theory – EUROCAST 2015, volume 9520 of LNCS, pages 279-285, 2015, Springer. |
| [49] | Partitioning Graph Drawings and Triangulated Simple Polygons into Greedily Routable Regions Algorithms and Computation (ISAAC'15) (Khaled Elbassioni, Kazuhisa Makino, eds.), volume 9472 of LNCS, pages 637–649, 2015, Springer Berlin Heidelberg. |
| [48] | Drawing Large Graphs by Multilevel Maxent-Stress Optimization Graph Drawing (GD'15) (Emilio Di Giacomo, Anna Lubiw, eds.), volume 9411 of LNCS, pages 30–43, 2015, Springer International Publishing. |
| [47] | Towards Realistic Flow Control in Power Grid Operation Energy Informatics (EI'15) (Sebastian Gottwalt, Lukas König, Hartmut Schmeck, eds.), volume 9424 of LNCS, pages 192–199, 2015, Springer International Publishing. |
| [46] | CPU Versus GPU Parallelization of an Ant Colony Optimization for the Longest Common Subsequence Problem Computer Aided Systems Theory – EUROCAST 2015, volume 9520 of LNCS, pages 401–408, 2015, Springer. |
| [45] | Mixed Map Labeling Algorithms and Complexity (CIAC'15) (V. Th. Paschos, Peter Widmayer, eds.), volume 9079 of LNCS, pages 339–351, 2015, Springer International Publishing. |
| [44] | Operating Power Grids with Few Flow Control Buses Future Energy Systems (e-Energy'15), pages 289–294, 2015, ACM. |
| [43] | On Solving the Most Strings With Few Bad Columns Problem: An ILP Model and Heuristics Proceedings of the 2015 International Symposium on Innovations in Intelligent Systems and Applications (INISTA) (David Camacho, others, eds.), pages 1-8, 2015, IEEE Xplore. |
| [42] | Combinatorial Properties of Triangle-Free Rectangle Arrangements and the Squarability Problem Graph Drawing (GD'15) (Emilio Di Giacomo, Anna Lubiw, eds.), volume 9411 of LNCS, pages 231–244, 2015, Springer International Publishing. |
| [41] | On Minimizing Crossings in Storyline Visualizations Graph Drawing (GD'15) (Emilio Di Giacomo, Anna Lubiw, eds.), volume 9411 of LNCS, pages 192–198, 2015, Springer International Publishing. |
| [40] | Recognizing Weighted Disk Contact Graphs Graph Drawing (GD'15) (Emilio Di Giacomo, Anna Lubiw, eds.), volume 9411 of LNCS, pages 433–446, 2015, Springer International Publishing. |
| [39] | A Cluster-First Route-Second Approach for Balancing Bicycle Sharing Systems Extended Abstracts of the Fifthteenth International Conference on Computer Aided Systems Theory (EUROCAST 2015) (Alexis Quesada-Arencibia, José Carlos Rodriguez, Roberto Moreno-Díaz jr., Roberto Moreno-Díaz, eds.), pages 125–126, 2015. |
| [38] | A New Solution Representation for the Firefighter Problem Evolutionary Computation in Combinatorial Optimization – EvoCOP 2015 (Gabriela Ochoa, Francisco Chicano, eds.), volume 9026 of LNCS, pages 25–35, 2015, Springer. |
| [37] | Label Placement in Road Maps Algorithms and Complexity (CIAC'15) (V. Th. Paschos, Peter Widmayer, eds.), volume 9079 of LNCS, pages 221–234, 2015, Springer International Publishing. |
| [36] | A Value-Correction Construction Heuristic for the Two-Dimensional Cutting Stock Problem with Variable Sheet Size Extended Abstracts of the Fifthteenth International Conference on Computer Aided Systems Theory (EUROCAST 2015) (Alexis Quesada-Arencibia, José Carlos Rodriguez, Roberto Moreno-Díaz jr., Roberto Moreno-Díaz, eds.), pages 109–110, 2015. |
| [35] | A Scalable Approach for the K-Staged Two-Dimensional Cutting Stock Problem with Variable Sheet Size Computer Aided Systems Theory – EUROCAST 2015, volume 9520 of LNCS, pages 384–392, 2015, Springer. |
| [34] | Solving the 3-Staged 2-Dimensional Cutting Stock Problem by Dynamic Programming and Variable Neighborhood Search The 3rd International Conference on Variable Neighborhood Search (VNS'14), volume 47 of Electronic Notes in Discrete Mathematics, pages 133–140, 2015, Elsevier. |
| [33] | Heuristic Approaches for the Probabilistic Traveling Salesman Problem Computer Aided Systems Theory – EUROCAST 2015 (Roberto Moreno-Díaz, Franz Pichler, Alexis Quesada-Arencibia, eds.), volume 9520 of LNCS, pages 342–349, 2015, Springer International Publishing Switzerland. |
| [32] | A Genetic Algorithm for the Capacity and Distance Constrained Plant Location Problem Proceedings of the 11th Metaheuristics International Conference, pages 89/1–89/9, 2015. |
| [31] | A Variable Neighborhood Search for the Generalized Vehicle Routing Problem with Stochastic Demands Evolutionary Computation in Combinatorial Optimization – EvoCOP 2015 (Gabriela Ochoa, Francisco Chicano, eds.), volume 9026 of LNCS, pages 48–60, 2015, Springer. |
| [30] | On the Readability of Boundary Labeling Graph Drawing (GD'15) (Emilio Di Giacomo, Anna Lubiw, eds.), volume 9411 of LNCS, pages 515–527, 2015, Springer International Publishing. |
| [29] | A New Type of Metamodel for Longitudinal Dynamics Optimization of Hybrid Electric Vehicles Computer Aided Systems Theory – EUROCAST 2015 (Roberto Moreno-Díaz, others, eds.), volume 9520 of LNCS, pages 425–432, 2015, Springer International Publishing Switzerland. |
| [28] | Towards Realistic Pedestrian Route Planning Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS'15) (Giuseppe F. Italiano, Marie Schmidt, eds.), volume 48 of OpenAccess Series in Informatics (OASIcs), pages 1–15, 2015, Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik. |
| [27] | Improving the Efficiency of Dynamic Programming on Tree Decompositions via Machine Learning Proceedings of IJCAI 2015, the 24th International Joint Conference on Artificial Intelligence, July 25–31, 2015, Buenos Aires, Argentina (Qiang Yang, Michael Wooldridge, eds.), pages 275–282, 2015. |
| [26] | On the Parameterized Complexity of Girth and Connectivity Problems on Linear Matroids Algorithms and Data Structures - 14th International Symposium, WADS 2015, Victoria, BC, Canada, August 5-7, 2015. Proceedings, pages 566–577, 2015. |
| [25] | Linear Time Parameterized Algorithms for Subset Feedback Vertex Set Automata, Languages, and Programming - 42nd International Colloquium, ICALP 2015, Kyoto, Japan, July 6-10, 2015, Proceedings, Part I, pages 935–946, 2015. |
| [24] | Reconfiguration on Sparse Graphs Algorithms and Data Structures - 14th International Symposium, WADS 2015, Victoria, BC, Canada, August 5-7, 2015. Proceedings, pages 506–517, 2015. |
| [23] | Variable-Deletion Backdoors to Planning Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence, January 25-30, 2015, Austin, Texas, USA. (Blai Bonet, Sven Koenig, eds.), pages 3305–3312, 2015, AAAI Press. |
| [22] | Community Structure Inspired Algorithms for SAT and #SAT 18th International Conference on Theory and Applications of Satisfiability Testing (SAT 2015), September 24-27, 2015, Austin, Texas (Marijn Heule, Sean Weaver, eds.), pages 223-237, 2015, Springer Verlag. |
| [21] | Parameterized Complexity of Asynchronous Border Minimization Theory and Applications of Models of Computation - 12th Annual Conference, TAMC 2015, Singapore, May 18-20, 2015, Proceedings (Rahul Jain, Sanjay Jain, Frank Stephan, eds.), volume 9076 of Lecture Notes in Computer Science, pages 428–440, 2015, Springer Verlag. |
| [20] | Algorithmic Applications of Tree-Cut Width Mathematical Foundations of Computer Science 2015 - 40th International Symposium, MFCS 2015, Milan, Italy, August 24-28, 2015, Proceedings, Part II, volume 9235 of Lecture Notes in Computer Science, pages 348–360, 2015, Springer Verlag. |
| [19] | Parameterized Algorithms for Parity Games Mathematical Foundations of Computer Science 2015 - 40th International Symposium, MFCS 2015, Milan, Italy, August 24-28, 2015, Proceedings, Part II (Giuseppe F. Italiano, Giovanni Pighizzini, Donald Sannella, eds.), volume 9235 of Lecture Notes in Computer Science, pages 336–347, 2015, Springer Verlag. |
| [18] | FO Model Checking on Posets of Bounded Width IEEE 56th Annual Symposium on Foundations of Computer Science, FOCS 2015, Berkeley, CA, USA, 17-20 October, 2015, pages 963–974, 2015. |
| [17] | Solving d-SAT via Backdoors to Small Treewidth Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2015, San Diego, CA, USA, January 4-6, 2015, pages 630–641, 2015. |
| [16] | Parameterized Complexity Results for Agenda Safety in Judgment Aggregation Proceedings of AAMAS 2015, the 14th International Conference on Autonomous Agents and Multiagent Systems (Gerhard Weiss, Pinar Yolum, Rafael H. Bordini, Edith Elkind, eds.), pages 127–136, 2015, IFAAMAS/ACM. |
| [15] | Complexity of the Winner Determination Problem in Judgment Aggregation: Kemeny, Slater, Tideman, Young Proceedings of AAMAS 2015, the 14th International Conference on Autonomous Agents and Multiagent Systems, 2015, IFAAMAS/ACM. |
| [14] | Meta-Kernelization using Well-Structured Modulators Parameterized and Exact Computation - 10th International Symposium, IPEC 2014, Patras, Greece, September 16-18, 2015. Revised Selected Papers (Thore Husfeldt, Iyad A. Kanj, eds.), volume 43 of LIPIcs, pages 114–126, 2015. |
| [13] | Solving Problems on Graphs of High Rank-Width Algorithms and Data Structures Symposium (WADS 2015), August 5-7, 2015, University of Victoria, BC, Canada, pages 314–326, 2015, Springer Verlag. |
| [12] | On the Complexity of Rainbow Coloring Problems Combinatorial Algorithms - 26th International Workshop, IWOCA 2015, Verona, Italy, October 5-7, 2015, Revised Selected Papers (Zsuzsanna Lipták, William F. Smyth, eds.), pages 209–220, 2015. |
| [11] | A Dichotomy Result for Ramsey Quantifiers Proceedings of WoLLIC 2015, the 22nd International Workshop on Logic, Language, Information, and Computation, 2015, Springer Verlag. |
| [10] | Fixed-parameter Tractable Reductions to SAT for Planning Proceedings of IJCAI 2015, the 24th International Joint Conference on Artificial Intelligence, July 25–31, 2015, Buenos Aires, Argentina, 2015. |
| [9] | On Compiling Structured CNFs to OBDDs Computer Science - Theory and Applications - 10th International Computer Science Symposium in Russia, CSR 2015, Listvyanka, Russia, July 13-17, 2015, Proceedings, pages 80–93, 2015. |
| [8] | First-Order Queries on Finite Abelian Groups 24th EACSL Annual Conference on Computer Science Logic, CSL 2015, September 7-10, 2015, Berlin, Germany, pages 41–59, 2015. |
| [7] | On Compiling CNFs into Structured Deterministic DNNFs Theory and Applications of Satisfiability Testing - SAT 2015 - 18th International Conference, Austin, TX, USA, September 24-27, 2015, Proceedings, pages 199–214, 2015. |
| [6] | Metric Dimension of Bounded Width Graphs Mathematical Foundations of Computer Science 2015 - 40th International Symposium, MFCS 2015, Milan, Italy, August 24-28, 2015, Proceedings, Part II, pages 115–126, 2015. |
| [5] | Solving the Travelling Thief Problem with an Evolutionary Algorithm Sep 2015, Master's thesis, TU Wien, Institute of Computer Graphics and Algorithms. Note: supervised by G. Raidl and B. Hu |
| [4] | Electric Vehicles Recharge Scheduling with Logic-Based Benders Decomposition Jul 2015, Master's thesis, TU Wien, Institute of Computer Graphics and Algorithms. Note: supervised by G. Raidl and M. Riedler |
| [3] | Optimization Approaches for Recreational Bicycle Tour Planning Apr 2015, Master's thesis, TU Wien, Institute of Computer Graphics and Algorithms. Note: supervised by M. Prandtstetter and G. Raidl |
| [2] | Solving the Multi-Objective Steiner Tree Problem with Resources Jan 2015, Master's thesis, TU Wien, Institute of Computer Graphics and Algorithms. Note: supervised by M. Leitner, M. Ruthmair, and G. Raidl |
| [1] | An Overview of Non-Uniform Parameterized Complexity 2015, Technical report TR15-130, Electronic Colloquium on Computational Complexity (ECCC). |
2014
51 results2013
79 results| 2013 | |
| [79] | Proceedings of the 10th Metaheuristics International Conference (Hoong Chuin Lau, Günther R. Raidl, Patrick van Hentenryck, eds.), 2013. |
| [78] | Parameterized and Exact Computation - 8th International Symposium, IPEC 2013, Sophia Antipolis, France, September 4-6, 2013, Revised Selected Papers (Gregory Gutin, Stefan Szeider, eds.), volume 8246 of Lecture Notes in Computer Science, 2013, Springer Verlag. Note: ISBN 978-3-319-03897-1 |
| [77] | Edge-weighted contact representations of planar graphs J. Graph Algorithms Appl., volume 17, number 4, pages 441–473, 2013. |
| [76] | Stabilizing Branch-and-Price for Constrained Tree Problems Networks, volume 61, number 2, pages 150–170, 2013. Note: previous technical report version at https://www.ac.tuwien.ac.at/files/pub/leitner-11e.pdf |
| [75] | Drawing Graphs and Maps with Curves (Dagstuhl Seminar 13151) Dagstuhl Reports, volume 3, number 4, pages 34–68, 2013. |
| [74] | Optimal 3D Angular Resolution for Low-Degree Graphs J. Graph Algorithms Appl., volume 17, number 3, pages 173–200, 2013. |
| [73] | Drawing Trees with Perfect Angular Resolution and Polynomial Area Discrete and Computational Geometry, volume 49, number 2, pages 157–182, 2013. |
| [72] | Parameterized Complexity Results for Exact Bayesian Network Structure Learning Journal Artificial Intelligence Research, volume 46, pages 263-302, 2013. |
| [71] | Satisfiability of acyclic and almost acyclic CNF formulas Theoretical Computer Science, volume 481, pages 85-99, 2013. |
| [70] | A Polynomial Kernel for Feedback Arc Set on Bipartite Tournaments Theory Comput. Syst., volume 53, number 4, pages 609–620, 2013. |
| [69] | Cops-and-robbers: remarks and problems Journal of Combinatorial Mathematics and Combinatorial Computing, volume 85, pages 141–159, 2013. |
| [68] | A unified approach to polynomial algorithms on graphs of bounded (bi-)rank-width Eur. J. Comb., volume 34, number 3, pages 680–701, 2013. |
| [67] | Better Algorithms for Satisfiability Problems for Formulas of Bounded Rank-width Fundam. Inform., volume 123, number 1, pages 59–76, 2013. |
| [66] | Polynomial space hardness without disjunction property Theor. Comput. Sci., volume 467, pages 1–11, 2013. |
| [65] | Generic expression hardness results for primitive positive formula comparison Inf. Comput., volume 222, pages 108–120, 2013. |
| [64] | A Timeslot-Filling Based Heuristic Approach to Construct High-School Timetables Chapter in Advances in Metaheuristics (Luca Di Gaspero, Andrea Schaerf, Thomas Stützle, eds.), volume 53 of Operations Research/Computer Science Interfaces Series, pages 143–158, 2013, Springer. |
| [63] | An Optimization Model for Integrated Timetable Based Design of Railway Infrastructure Proceedings of the 5th International Seminar on Railway Operations Modelling and Analysis – RailCopenhagen 2013, pages 765–774, 2013, IAROR. |
| [62] | Balancing Bicycle Sharing Systems: A Variable Neighborhood Search Approach Evolutionary Computation in Combinatorial Optimisation – 13th European Conference, EvoCOP 2013 (M. Middendorf, C. Blum, eds.), volume 7832 of LNCS, pages 121-132, 2013, Springer. |
| [61] | Balancing Bicycle Sharing Systems: Improving a VNS by Efficiently Determining Optimal Loading Operations Hybrid Metaheuristics, 8th Int. Workshop, HM 2013 (M. J. Blesa, others, eds.), volume 7919 of LNCS, pages 130–143, 2013, Springer. |
| [60] | A Memetic Algorithm with Two Distinct Solution Representations for the Partition Graph Coloring Problem Computer Aided Systems Theory – EUROCAST 2013 (Roberto Moreno-Díaz, Franz Pichler, Alexis Quesada-Arencibia, eds.), volume 8111 of LNCS, pages 219–226, 2013, Springer. |
| [59] | A Memetic Algorithm for the Partition Graph Coloring Problem Extended Abstracts of the 14th International Conference on Computer Aided Systems Theory, pages 167–169, 2013. |
| [58] | On The Usability of Lombardi Graph Drawings Graph Drawing (GD'12) (Walter Didimo, Maurizio Patrignani, eds.), volume 7704 of LNCS, pages 451–462, 2013, Springer Berlin Heidelberg. |
| [57] | A PILOT/VND/GRASP Hybrid for the Static Balancing of Public Bicycle Sharing Systems Computer Aided Systems Theory – EUROCAST 2013 (Roberto Moreno-Díaz, Franz Pichler, Alexis Quesada-Arencibia, eds.), volume 8111 of LNCS, pages 372–379, 2013, Springer. |
| [56] | A PILOT/VND/GRASP Hybrid for Balancing Bicycle Sharing Systems Extended Abstracts of the 14th International Conference on Computer Aided Systems Theory, pages 223–225, 2013. |
| [55] | Edge-weighted contact representations of planar graphs Graph Drawing (GD'12) (Walter Didimo, Maurizio Patrignani, eds.), volume 7704 of LNCS, pages 224–235, 2013, Springer Berlin Heidelberg. |
| [54] | Euclidean Greedy Drawings of Trees Algorithms (ESA'13) (H. L. Bodlaender, G. F. Italiano, eds.), volume 8125 of LNCS, pages 767–778, 2013, Springer Berlin Heidelberg. |
| [53] | Drawing Planar Graphs with a Prescribed Inner Face Graph Drawing (GD'13) (Stephen Wismath, Alexander Wolff, eds.), volume 8242 of LNCS, pages 316–327, 2013, Springer Berlin Heidelberg. |
| [52] | Planar Lombardi Drawings of Outerpaths Graph Drawing (GD'12) (Walter Didimo, Maurizio Patrignani, eds.), volume 7704 of LNCS, pages 561–562, 2013, Springer Berlin Heidelberg. Note: Poster abstract |
| [51] | Circular-Arc Cartograms IEEE Pacific Visualization Symposium (PacificVis'13), pages 1–8, 2013, IEEE. |
| [50] | Clique and Independent Set Based GRASP Approaches for the Regenerator Location Problem Proceedings of the 10th Metaheuristics International Conference (H.C. Lau, P. Van Hentenryck, G.R. Raidl, eds.), pages 30/1–30/10, 2013. |
| [49] | A Memetic Algorithm for the Virtual Network Mapping Problem Proceedings of the 10th Metaheuristics International Conference (H.C. Lau, P. Van Hentenryck, G.R. Raidl, eds.), pages 28/1–28/10, 2013. |
| [48] | GRASP and Variable Neighborhood Search for the Virtual Network Mapping Problem Hybrid Metaheuristics, 8th Int. Workshop, HM 2013 (M. J. Blesa, others, eds.), volume 7919 of LNCS, pages 159–173, 2013, Springer. |
| [47] | Solving the Virtual Network Mapping Problem with Construction Heuristics, Local Search and Variable Neighborhood Descent Evolutionary Computation in Combinatorial Optimisation – 13th European Conference, EvoCOP 2013 (M. Middendorf, C. Blum, eds.), volume 7832 of LNCS, pages 250-261, 2013, Springer. |
| [46] | Using Optimized Virtual Network Embedding for Network Dimensioning Proceedings of Networked Systems 2013, pages 118–125, 2013, IEEE. |
| [45] | A Mixed Integer Model for the Stamina-Aware Sightseeing Tour Problem Extended Abstracts of the 14th International Conference on Computer Aided Systems Theory, pages 200–202, 2013. |
| [44] | Trajectory-Based Dynamic Map Labeling Algorithms and Computation (ISAAC'13) (Leizhen Cai, Siu-Wing Cheng, Tak-Wah Lam, eds.), volume 8283 of LNCS, pages 413–423, 2013, Springer Berlin Heidelberg. |
| [43] | Drawing Metro Maps using Bézier Curves Graph Drawing (GD'12) (Walter Didimo, Maurizio Patrignani, eds.), volume 7704 of LNCS, pages 463–474, 2013, Springer Berlin Heidelberg. |
| [42] | Strict Confluent Drawing Graph Drawing (GD'13) (Stephen Wismath, Alexander Wolff, eds.), volume 8242 of LNCS, pages 352–363, 2013, Springer Berlin Heidelberg. |
| [41] | Enhancing a Genetic Algorithm with a Solution Archive to Reconstruct Cross Cut Shredded Text Documents Computer Aided Systems Theory – EUROCAST 2013 (Roberto Moreno-Díaz, Franz Pichler, Alexis Quesada-Arencibia, eds.), volume 8111 of LNCS, pages 380–387, 2013, Springer. |
| [40] | Reconstructing Cross Cut Shredded Documents with a Genetic Algorithm with Solution Archive Extended Abstracts of the 14th International Conference on Computer Aided Systems Theory, pages 226–228, 2013. |
| [39] | Progress on Partial Edge Drawings Graph Drawing (GD'12) (Walter Didimo, Maurizio Patrignani, eds.), volume 7704 of LNCS, pages 67–78, 2013, Springer Berlin Heidelberg. |
| [38] | Many-to-One Boundary Labeling with Backbones Graph Drawing (GD'13) (Stephen Wismath, Alexander Wolff, eds.), volume 8242 of LNCS, pages 244–255, 2013, Springer Berlin Heidelberg. |
| [37] | Using ILP/SAT to determine pathwidth, visibility representations, and other grid-based graph drawings Graph Drawing (GD'13) (Stephen Wismath, Alexander Wolff, eds.), volume 8242 of LNCS, pages 460–471, 2013, Springer Berlin Heidelberg. |
| [36] | Visualizing Large Hierarchically Clustered Graphs with a Landscape Metaphor Graph Drawing (GD'12) (Walter Didimo, Maurizio Patrignani, eds.), volume 7704 of LNCS, pages 553–554, 2013, Springer Berlin Heidelberg. Note: Poster abstract |
| [35] | Capturing Structure in Hard Combinatorial Problems 2013 IEEE 25th International Conference on Tools with Artificial Intelligence, Herndon, VA, USA, November 4-6, 2013, pages 897-898, 2013. Note: invited keynote talk |
| [34] | The Parameterized Complexity of Constraint Satisfaction and Reasoning Applications of Declarative Programming and Knowledge Management - 19th International Conference, INAP 2011, and 25th Workshop on Logic Programming, WLP 2011, Vienna, Austria, September 28-30, 2011, Revised Selected Papers (Hans Tompits, Salvador Abreu, Johannes Oetsch, Jörg Pührer, Dietmar Seipel, Masanobu Umeda, Armin Wolf, eds.), volume 7773 of Lecture Notes in Computer Science, pages 27-37, 2013, Springer Verlag. |
| [33] | Model Counting for Formulas of Bounded Clique-Width Algorithms and Computation - 24th International Symposium, ISAAC 2013, Hong Kong, China, December 16-18, 2013, Proceedings (Leizhen Cai, Siu-Wing Cheng, Tak Wah Lam, eds.), volume 8283 of Lecture Notes in Computer Science, pages 677-687, 2013, Springer Verlag. |
| [32] | Backdoors to Abduction Proceedings of IJCAI 2013, the 23th International Joint Conference on Artificial Intelligence, August 3-9, 2013, Beijing, China, 2013. |
| [31] | Model Counting for CNF Formulas of Bounded Modular Treewidth 30th International Symposium on Theoretical Aspects of Computer Science, STACS 2013, February 27 - March 2, 2013, Kiel, Germany (Natacha Portier, Thomas Wilke, eds.), volume 20 of LIPIcs, pages 55-66, 2013, Leibniz-Zentrum fuer Informatik. |
| [30] | Revisiting Space in Proof Complexity: Treewidth and Pathwidth Mathematical Foundations of Computer Science 2013 - 38th International Symposium, MFCS 2013, Klosterneuburg, Austria, August 26-30, 2013. Proceedings (Krishnendu Chatterjee, Jiri Sgall, eds.), volume 8087 of Lecture Notes in Computer Science, pages 704-716, 2013, Springer Verlag. |
| [29] | Upper and Lower Bounds for Weak Backdoor Set Detection Theory and Applications of Satisfiability Testing - SAT 2013 - 16th International Conference, Helsinki, Finland, July 8-12, 2013. Proceedings (Matti Järvisalo, Allen Van Gelder, eds.), volume 7962 of Lecture Notes in Computer Science, pages 394-402, 2013, Springer Verlag. |
| [28] | Hardness of r-dominating set on Graphs of Diameter (r + 1) Parameterized and Exact Computation - 8th International Symposium, IPEC 2013, Sophia Antipolis, France, September 4-6, 2013, Revised Selected Papers, pages 255–267, 2013. |
| [27] | The Complexity of Repairing, Adjusting, and Aggregating of Extensions in Abstract Argumentation Theory and Applications of Formal Argumentation - Second International Workshop, TAFA 2013, Beijing, China, August 3-5, 2013, Revised Selected papers (Elizabeth Black, Sanjay Modgil, Nir Oren, eds.), volume 8306 of Lecture Notes in Computer Science, pages 158-175, 2013, Springer Verlag. |
| [26] | On the Subexponential Time Complexity of CSP Proceedings of AAAI 2013, the 27th AAAI Conference on Artificial Intelligence, July 14-18, 2013, Bellevue, Washington, USA (Marie des Jardins, Michael L. Littman, eds.), pages 459-465, 2013, The AAAI Press. |
| [25] | Parameterized Complexity of Directed Steiner Tree on Sparse Graphs Algorithms - ESA 2013 - 21st Annual European Symposium, Sophia Antipolis, France, September 2-4, 2013. Proceedings, pages 671–682, 2013. |
| [24] | A SAT Approach to Clique-Width Theory and Applications of Satisfiability Testing - SAT 2013 - 16th International Conference, Helsinki, Finland, July 8-12, 2013. Proceedings (Matti Järvisalo, Allen Van Gelder, eds.), volume 7962 of Lecture Notes in Computer Science, pages 318-334, 2013, Springer Verlag. |
| [23] | Strong Backdoors to Bounded Treewidth SAT 54th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2013, 26-29 October, 2013, Berkeley, CA, USA, pages 489-498, 2013, IEEE Computer Society. |
| [22] | Backdoors to q-Horn 30th International Symposium on Theoretical Aspects of Computer Science, STACS 2013, February 27 - March 2, 2013, Kiel, Germany (Natacha Portier, Thomas Wilke, eds.), volume 20 of LIPIcs, pages 67-79, 2013, Leibniz-Zentrum fuer Informatik. |
| [21] | Meta-kernelization with Structural Parameters Mathematical Foundations of Computer Science 2013 - 38th International Symposium, MFCS 2013, Klosterneuburg, Austria, August 26-30, 2013. Proceedings (Krishnendu Chatterjee, Jiri Sgall, eds.), volume 8087 of Lecture Notes in Computer Science, pages 457-468, 2013, Springer Verlag. |
| [20] | Expanding the Expressive Power of Monadic Second-Order Logic on Restricted Graph Classes Combinatorial Algorithms - 24th International Workshop, IWOCA 2013, Rouen, France, July 10-12, 2013, Revised Selected Papers, volume 8288 of Lecture Notes in Computer Science, pages 164–177, 2013, Springer Verlag. |
| [19] | FO Model Checking of Interval Graphs Automata, Languages, and Programming - 40th International Colloquium, ICALP 2013, Riga, Latvia, July 8-12, 2013, Proceedings, Part II, volume 7966 of Lecture Notes in Computer Science, pages 250–262, 2013, Springer Verlag. |
| [18] | Kernelization Using Structural Parameters on Sparse Graph Classes Algorithms - ESA 2013 - 21st Annual European Symposium, Sophia Antipolis, France, September 2-4, 2013. Proceedings (Hans L. Bodlaender, Giuseppe F. Italiano, eds.), volume 8125 of Lecture Notes in Computer Science, pages 529–540, 2013, Springer Verlag. |
| [17] | Backdoors to Normality for Disjunctive Logic Programs Proceedings of AAAI 2013, the 27th AAAI Conference on Artificial Intelligence, July 14-18, 2013, Bellevue, Washington, USA (Marie des Jardins, Michael L. Littman, eds.), pages 320-337, 2013, The AAAI Press. |
| [16] | Parameterized Complexity Results for Plan Reuse Proceedings of AAAI 2013, the 27th AAAI Conference on Artificial Intelligence, July 14-18, 2013, Bellevue, Washington, USA (Marie des Jardins, Michael L. Littman, eds.), pages 224-231, 2013, The AAAI Press. |
| [15] | Local Backbones Theory and Applications of Satisfiability Testing - SAT 2013 - 16th International Conference, Helsinki, Finland, July 8-12, 2013. Proceedings (Matti Järvisalo, Allen Van Gelder, eds.), volume 7962 of Lecture Notes in Computer Science, pages 377-393, 2013, Springer Verlag. |
| [14] | Fixed-Parameter Tractability of Workflow Satisfiability in the Presence of Seniority Constraints Frontiers in Algorithmics \emphand Algorithmic Aspects in Information and Management, Third Joint International Conference, FAW-AAIM 2013, Dalian, China, June 26-28, 2013. Proceedings, pages 198–209, 2013. |
| [13] | Faster Exact Algorithms for Some Terminal Set Problems Parameterized and Exact Computation - 8th International Symposium, IPEC 2013, Sophia Antipolis, France, September 4-6, 2013, Revised Selected Papers, pages 150–162, 2013. |
| [12] | Partially Polynomial Kernels for Set Cover and Test Cover IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2013, December 12-14, 2013, Guwahati, India, pages 67–78, 2013. |
| [11] | Parameterized Complexity and Kernel Bounds for Hard Planning Problems Algorithms and Complexity, 8th International Conference, CIAC 2013, Barcelona, Spain, May 22-24, 2013. Proceedings (Paul G. Spirakis, Maria J. Serna, eds.), volume 7878 of Lecture Notes in Computer Science, pages 13-24, 2013, Springer Verlag. |
| [10] | Optimization Challenges of the Future Federated Internet Oct 2013, PhD thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms. Note: supervised by G. R. Raidl and K. Tutschku |
| [9] | Balancing Bike Sharing Systems Dec 2013, Master's thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms. Note: supervised by G. Raidl |
| [8] | Two-Phase Local Search for the Bi-objective Connected Facility Location Problem Dec 2013, Master's thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms. Note: supervised by G. Raidl and M. Leitner |
| [7] | The Rooted Delay-Constrained Steiner Tree Problem with Uncertain Delays Dec 2013, Master's thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms. Note: supervised by G. Raidl, M. Leitner, and M. Ruthmair |
| [6] | Metaheuristic Optimization of Electro-Hybrid Powertrains Using Machine Learning Techniques Aug 2013, Master's thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms. Note: supervised by G. Raidl and T. Krenek. \textbf3rd price Johann Puch Innovation Award 2013 (Magna Steyr) |
| [5] | Analyse und Implementierung von Fallzusammenführungen diagnosebezogener Fallgruppen aus Sicht eines Krankenhausinformationssystems Aug 2013, Master's thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms. Note: supervised by G. Raidl and D. Ljubic |
| [4] | Critical Links Detection using CUDA Apr 2013, Master's thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms. Note: supervised by G. Raidl and B. Hu |
| [3] | Selective Graph Coloring Problem Apr 2013, Master's thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms. Note: supervised by G. Raidl and B. Hu |
| [2] | Metaheuristics for the Regenerator Location Problem Mar 2013, Master's thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms. Note: supervised by G. Raidl |
| [1] | PILOT, GRASP, and VNS Approaches for the Static Balancing of Bicycle Sharing Systems 2013, Technical report TR 186–1–13–01, Institute of Computer Graphics and Algorithms, Vienna University of Technology. |
2012
50 results| 2012 | |
| [50] | Computational Models of Argument - Proceedings of COMMA 2012, Vienna, Austria, September 10-12, 2012 (Bart Verheij, Stefan Szeider, Stefan Woltran, eds.), volume 245 of Frontiers in Artificial Intelligence and Applications, 2012, IOS Press. Note: ISBN 978-1-61499-110-6 |
| [49] | On graph contractions and induced minors Discr. Appl. Math., volume 160, number 6, pages 799-809, 2012. |
| [48] | Solving the Post Enrolment Course Timetabling Problem by Ant Colony Optimization Annals of Operations Research, volume 194, number 1, pages 325–339, 2012. Note: previous technical report version at https://www.ac.tuwien.ac.at/files/pub/nothegger-12.pdf |
| [47] | Lombardi Drawings of Graphs J. Graph Algorithms Appl., volume 16, number 1, pages 85–108, 2012. |
| [46] | Algorithms for Computing the Maximum Weight Region Decomposable into Elementary Shapes Computer Vision and Image Understanding, volume 116, number 7, pages 803–814, 2012. |
| [45] | Drawing (Complete) Binary Tanglegrams Algorithmica, volume 62, number 1–2, pages 309–332, 2012. |
| [44] | Cover Contact Graphs J. Computational Geometry, volume 3, number 1, pages 102–131, 2012. |
| [43] | Editing graphs to satisfy degree constraints: a parameterized approach Journal of Computer and System Sciences, volume 78, number 1, pages 179-191, 2012. |
| [42] | Parameterized Complexity Results for General Factors in Bipartite Graphs with an Application to Constraint Programming Algorithmica, volume 64, number 1, pages 112-125, 2012. |
| [41] | Augmenting tractable fragments of abstract argumentation Artificial Intelligence, volume 186, pages 157-173, 2012. |
| [40] | Finite RDP-algebras: duality, coproducts and logic J. Log. Comput., volume 22, number 3, pages 417–450, 2012. |
| [39] | On the Expression Complexity of Equivalence and Isomorphism of Primitive Positive Formulas Theory Comput. Syst., volume 50, number 2, pages 329–353, 2012. |
| [38] | Lewis Dichotomies in Many-Valued Logics Studia Logica, volume 100, number 6, pages 1271–1290, 2012. |
| [37] | A Variable Neighborhood Search Approach for the Two-Echelon Location-Routing Problem Evolutionary Computation in Combinatorial Optimisation – EvoCOP 2012 (J.-K. Hao, M. Middendorf, eds.), volume 7245 of LNCS, pages 13–24, 2012, Springer, Heidelberg. |
| [36] | Variable Neighborhood Search and GRASP for Three-Layer Hierarchical Ring Network Design Parallel Problem Solving from Nature–PPSN XII (C. A. Coello Coello, others, eds.), volume 7492 of LNCS, pages 458–467, 2012, Springer. |
| [35] | On Solving the Rooted Delay- and Delay-Variation-Constrained Steiner Tree Problem Proceedings of the 2nd International Symposium on Combinatorial Optimization (A.R. Mahjoub, others, eds.), volume 7422 of LNCS, pages 225–236, 2012, Springer. |
| [34] | A Memetic Algorithm and a Solution Archive for the Rooted Delay-Constrained Minimum Spanning Tree Problem Proceedings of the 13th International Conference on Computer Aided Systems Theory: Part I (R. Moreno-Díaz, others, eds.), volume 6927 of LNCS, pages 351–358, 2012, Springer. |
| [33] | Hybrid Heuristics for Multimodal Homecare Scheduling 9th International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CPAIOR'12) (Nicolas Beldiceanu, Narendra Jussien, Éric Pinson, eds.), pages 339–355, 2012, Springer. |
| [32] | Improved Packing and Routing of Vehicles with Compartments Computer Aided Systems Theory – EUROCAST 2011: 13th International Conference, Las Palmas de Gran Canaria, Spain, February 6–11, 2011, Revised Selected Papers, Part I (R. Moreno-Díaz, others, eds.), volume 6927 of LNCS, pages 392–399, 2012, Springer. |
| [31] | Variable Neighborhood and Greedy Randomized Adaptive Search for Capacitated Connected Facility Location Proceedings of the 13th International Conference on Computer Aided Systems Theory: Part I (R. Moreno-Díaz, others, eds.), volume 6927 of LNCS, pages 295–302, 2012, Springer. |
| [30] | Applying (Hybrid) Metaheuristics to Fuel Consumption Optimization of Hybrid Electric Vehicles Applications of Evolutionary Computation – EvoApplications 2012 (C. Di Chio, others, eds.), volume 7248 of LNCS, pages 376–385, 2012, Springer, Heidelberg. |
| [29] | Automatic Generation of 2-AntWars Players with Genetic Programming Proceedings of the 13th International Conference on Computer Aided Systems Theory: Part I (R. Moreno-Díaz, F. Pichler, A. Quesada-Arencibia, eds.), volume 6927 of LNCS, pages 248–255, 2012, Springer. |
| [28] | An Evolutionary Algorithm with Solution Archive for the Generalized Minimum Spanning Tree Problem Proceedings of the 13th International Conference on Computer Aided Systems Theory: Part I (R. Moreno-Díaz, F. Pichler, A. Quesada-Arencibia, eds.), volume 6927 of LNCS, pages 287–294, 2012, Springer. |
| [27] | An Evolutionary Algorithm with Solution Archives and Bounding Extension for the Generalized Minimum Spanning Tree Problem Proceedings of the 14th Annual Conference on Genetic and Evolutionary Computation (GECCO), pages 393–400, 2012, ACM Press. |
| [26] | A Multilevel Heuristic for the Rooted Delay-Constrained Minimum Spanning Tree Problem Proceedings of the 13th International Conference on Computer Aided Systems Theory: Part I (R. Moreno-Díaz, F. Pichler, A. Quesada-Arencibia, eds.), volume 6927 of LNCS, pages 256–263, 2012, Springer. |
| [25] | Computing Resolution-Path Dependencies in Linear Time Theory and Applications of Satisfiability Testing - SAT 2012 - 15th International Conference, Trento, Italy, June 17-20, 2012. Proceedings (Alessandro Cimatti, Roberto Sebastiani, eds.), volume 7317 of Lecture Notes in Computer Science, pages 58-71, 2012, Springer Verlag. |
| [24] | LP can be a cure for Parameterized Problems 29th International Symposium on Theoretical Aspects of Computer Science, STACS 2012, February 29th - March 3rd, 2012, Paris, France, pages 338–349, 2012. |
| [23] | Parameterized Algorithms for Even Cycle Transversal Graph-Theoretic Concepts in Computer Science - 38th International Workshop, WG 2012, Jerusalem, Israel, June 26-28, 2012, Revised Selcted Papers, pages 172–183, 2012. |
| [22] | Parameterized Tractability of Multiway Cut with Parity Constraints Automata, Languages, and Programming - 39th International Colloquium, ICALP 2012, Warwick, UK, July 9-13, 2012, Proceedings, Part I, pages 750–761, 2012. |
| [21] | Valued-Based Argumentation for Tree-like Value Graphs Computational Models of Argument - Proceedings of COMMA 2012, Vienna, Austria, September 10-12, 2012 (Bart Verheij, Stefan Szeider, Stefan Woltran, eds.), volume 245 of Frontiers in Artificial Intelligence and Applications, pages 378–389, 2012, IOS Press. |
| [20] | Strong Backdoors to Nested Satisfiability Theory and Applications of Satisfiability Testing - SAT 2012 - 15th International Conference, Trento, Italy, June 17-20, 2012. Proceedings (Alessandro Cimatti, Roberto Sebastiani, eds.), volume 7317 of Lecture Notes in Computer Science, pages 72-85, 2012, Springer Verlag. |
| [19] | Backdoors to Acyclic SAT Automata, Languages, and Programming - 39th International Colloquium, ICALP 2012, Warwick, UK, July 9-13, 2012, Proceedings, Part I (Artur Czumaj, Kurt Mehlhorn, Andrew M. Pitts, Roger Wattenhofer, eds.), volume 7391 of Lecture Notes in Computer Science, pages 363-374, 2012, Springer Verlag. |
| [18] | Backdoors to Satisfaction The Multivariate Algorithmic Revolution and Beyond - Essays Dedicated to Michael R. Fellows on the Occasion of His 60th Birthday (Hans L. Bodlaender, Rod Downey, Fedor V. Fomin, Dániel Marx, eds.), volume 7370 of Lecture Notes in Computer Science, pages 287-317, 2012, Springer Verlag. |
| [17] | On Finding Optimal Polytrees Proceedings of the Twenty-Sixth AAAI Conference on Artificial Intelligence, July 22-26, 2012, Toronto, Ontario, Canada (Jörg Hoffmann, Bart Selman, eds.), 2012, AAAI Press. |
| [16] | Don't Be Strict in Local Search! Proceedings of the Twenty-Sixth AAAI Conference on Artificial Intelligence, July 22-26, 2012, Toronto, Ontario, Canada (Jörg Hoffmann, Bart Selman, eds.), 2012, AAAI Press. |
| [15] | When Trees Grow Low: Shrubs and Fast MSO1 Mathematical Foundations of Computer Science 2012 - 37th International Symposium, MFCS 2012, Bratislava, Slovakia, August 27-31, 2012. Proceedings, volume 7464 of Lecture Notes in Computer Science, pages 419–430, 2012, Springer Verlag. |
| [14] | Lower Bounds on the Complexity of MSO1 Model-Checking 29th International Symposium on Theoretical Aspects of Computer Science, STACS 2012, February 29th - March 3rd, 2012, Paris, France, volume 14 of LIPIcs, pages 326–337, 2012, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik. |
| [13] | k-Gap Interval Graphs LATIN 2012: Theoretical Informatics - 10th Latin American Symposium, Arequipa, Peru, April 16-20, 2012. Proceedings (David Fernández-Baca, ed.), volume 7256 of Lecture Notes in Computer Science, pages 350-361, 2012, Springer Verlag. |
| [12] | Abstract Argumentation via Monadic Second Order Logic Scalable Uncertainty Management - 6th International Conference, SUM 2012, Marburg, Germany, September 17-19, 2012. Proceedings (Eyke Hüllermeier, Sebastian Link, Thomas Fober, Bernhard Seeger, eds.), volume 7520 of Lecture Notes in Computer Science, pages 85-98, 2012, Springer Verlag. |
| [11] | The Complexity of Planning Revisited - A Parameterized Analysis Proceedings of the Twenty-Sixth AAAI Conference on Artificial Intelligence, July 22-26, 2012, Toronto, Ontario, Canada (Jörg Hoffmann, Bart Selman, eds.), 2012, AAAI Press. |
| [10] | On Solving Constrained Tree Problems and an Adaptive Layers Framework pages 187, May 2012, PhD thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms. Note: supervised by G. R. Raidl and U. Pferschy |
| [9] | Hybrid Metaheuristics and Matheuristics for Problems in Bioinformatics and Transportation May 2012, PhD thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms. Note: supervised by G. R. Raidl and K. F. Dörner |
| [8] | Extending the Gecode Framework with Interval Constraint Programming Oct 2012, Master's thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms. Note: supervised by G. Raidl and L. Di Gaspero |
| [7] | The Vehicle Routing Problem with Compartments Oct 2012, Master's thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms. Note: supervised by G. Raidl and S. Pirkwieser |