Full List of Publications
941 results| [941] | Lossy Kernels for Hitting Subgraphs MFCS 2017. Note: To Appear |
| [940] | On the Parameterized Complexity of Simultaneous Deletion Problems FSTTCS 2017. Note: To Appear |
| 2021 | |
| [939] | On the Readability of Abstract Set Visualizations CoRR, volume abs/2101.08155, 2021. |
| [938] | MetroSets: Visualizing Sets as Metro Maps IEEE Trans. Visualization and Computer Graphics, volume 27, number 2, pages 1257–1267, 2021. |
| [937] | Driver Shift Planning for an Online Store with Short Delivery Times Procedia Computer Science, volume 180, pages 517–524, 2021. Note: Proceedings of the 2nd International Conference on Industry 4.0 and Smart Manufacturing (ISM 2020) |
| [936] | A*-based Construction of Decision Diagrams for a Prize-Collecting Scheduling Problem Computers & Operations Research, volume 126, pages 105125, 2021. Note: previous technical report version at https://www.ac.tuwien.ac.at/files/tr/ac-tr-18-011a.pdf |
| [935] | Route Duration Prediction in a Stochastic and Dynamic Vehicle Routing Problem with Short Delivery Deadlines Procedia Computer Science, volume 180, pages 366-370, 2021. Note: Proceedings of the 2nd International Conference on Industry 4.0 and Smart Manufacturing (ISM 2020) |
| [934] | New Width Parameters for SAT and Sharp-SAT Artificial Intelligence, 2021. Note: to appear |
| [933] | On Structural Parameterizations of the Edge Disjoint Paths Problem Algorithmica, 2021. Note: to appear |
| [932] | Turbocharging Treewidth-Bounded Bayesian Network Structure Learning Proceeding of AAAI-21, the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021. Note: to appear |
| [931] | SAT-based Decision Tree Learning for Large Data Sets Proceeding of AAAI-21, the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021. Note: to appear |
| [930] | Parameterized Complexity of Small Decision Tree Learning Proceeding of AAAI-21, the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021. Note: to appear |
| [929] | The Complexity of Object Association in Multiple Object Tracking Proceeding of AAAI-21, the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021. Note: to appear |
| [928] | The Parameterized Complexity of Clustering Incomplete Data Proceeding of AAAI-21, the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021. Note: to appear |
| [927] | Approximate Evaluation of First-Order Counting Queries Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA 2021), 2021, SIAM. Note: To be published |
| [926] | Graphs with two moplexes are more than perfect Proceedings of the 11th Latin and American Algorithms, Graphs and Optimization Symposium (LAGOS 2021), 2021, Elsevier. Note: To be published |
| 2020 | |
| [925] | An Iterative Time-Bucket Refinement Algorithm for a High-Resolution Resource-Constrained Project Scheduling Problem International Transactions in Operational Research, jan 2020. |
| [924] | Multi-level Area Balancing of Clustered Graphs IEEE Trans. Visualization and Computer Graphics, 2020. |
| [923] | A Survey on Transit Map Layout – from Design, Machine, and Human Perspectives Computer Graphics Forum, volume 39, number 3, pages 619–646, 2020. |
| [922] | 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 |
| [921] | A Unified Model and Algorithms for Temporal Map Labeling Algorithmica, volume 82, pages 2709–2736, 2020. |
| [920] | Placing Labels in Road Maps: Algorithms and Complexity Algorithmica, volume 82, pages 1881–1908, 2020. |
| [919] | Route Schematization with Landmarks J. Spatial Information Science, volume 21, 2020. |
| [918] | Anytime Algorithms for the Longest Common Palindromic Subsequence Problem Computers & Operations Research, volume 114, pages 104827, 2020, Elsevier. |
| [917] | Mixed Labeling: Integrating Internal and External Labels IEEE Trans. Visualization and Computer Graphics, 2020. |
| [916] | Solving Longest Common Subsequence Problems via a Transformation to the Maximum Clique Problem Computers & Operations Research, 2020. Note: to appear, previous technical report version at https://www.ac.tuwien.ac.at/files/tr/ac-tr-20-003.pdf |
| [915] | Parameterized Algorithms for Book Embedding Problems J. Graph Algorithms Appl., volume 24, number 4, pages 603–620, 2020. |
| [914] | The Power of Cut-Based Parameters for Computing Edge Disjoint Paths Algorithmica, 2020. Note: to appear |
| [913] | Solving Integer Linear Programs by Exploiting Variable-Constraint Interactions: a Survey MDPI Algorithms, 2020. Note: to appear |
| [912] | On Structural Parameterizations of the Bounded-Degree Vertex Deletion Problem Algorithmica, 2020. Note: to appear |
| [911] | Using Decomposition-Parameters for QBF: Mind the Prefix! Journal of Computer and System Sciences, 2020. Note: to appear |
| [910] | On Existential MSO and its Relation to ETH ACM Transactions on Computation Theory, volume 12, number 4, pages 22:1–22:32, 2020. |
| [909] | An A* search algorithm for the constrained longest common subsequence problem Information Processing Letters, pages 106041, 2020. Note: previous technical report version at https://www.ac.tuwien.ac.at/files/tr/ac-tr-20-004.pdf |
| [908] | Foreword: Eighth Workshop on Graph Classes, Optimization, and Width Parameters, Toronto, Ontario, Canada Discr. Appl. Math., volume 278, pages 1–2, 2020. |
| [907] | Complexity of independency and cliquy trees Discr. Appl. Math., volume 272, pages 2–15, 2020. |
| [906] | Towards a Polynomial Kernel for Directed Feedback Vertex Set Algorithmica, 2020. Note: to appear |
| [905] | Crossing Layout in Non-planar Graphs Chapter in Beyond Planar Graphs (Seok-Hee Hong, Takeshi Tokuyama, eds.), pages 187–209, 2020, Springer Nature Singapore. |
| [904] | The Turing Test for Graph Drawing Algorithms Graph Drawing and Network Visualization (GD'20) (David Auber, Pavel Valtr, eds.), 2020, Springer. |
| [903] | Towards Data-Driven Multilinear Metro Maps Diagrammatic Representation and Inference (DIAGRAMS'20) (Ahti-Veikko Pietarinen, Peter Chapman, Leonie Bosveld de Smet, Valeria Giardino, James Corter, Sven Linker, eds.), volume 12169 of LNAI, pages 153–161, 2020, Springer. |
| [902] | Labeling Nonograms European Workshop on Computational Geometry (EuroCG'20), pages 71:1–71:8, 2020. |
| [901] | A Variable Neighborhood Search for the Job Sequencing with One Common and Multiple Secondary Resources Problem Proceedings of PPSN XVI: Parallel Problem Solving from Nature (Thomas Bäck, Mike Preuss, André Deutz, Hao Wang, Carola Doerr, Michael Emmerich, Heike Trautmann, eds.), volume 12270 of LNCS, pages 385–398, 2020, Springer. |
| [900] | 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, 2020, Springer. |
| [899] | Distributing Battery Swapping Stations for Electric Scooters in an Urban Area Optimization and Applications (Nicholas Olenev, Yuri Evtushenko, Michael Khachay, Vlasta Malkova, eds.), volume 12422 of LNCS, pages 150–165, 2020, Springer International Publishing. |
| [898] | On the Use of Decision Diagrams for Finding Repetition-Free Longest Common Subsequences Proceedings of OPTIMA 2020 – XI International Conference Optimization and Applications (Nicholas Olenev, Yuri Evtushenko, Michael Khachay, Vlasta Malkova, eds.), volume 12422 of LNCS, pages 134–149, 2020, Springer. |
| [897] | 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.), volume 12013 of LNCS, pages 344–351, 2020, Springer. |
| [896] | A Double-Horizon Approach to a Purely Dynamic and Stochastic Vehicle Routing Problem with Delivery Deadlines and Shift Flexibility Proceedings of the 13th International Conference on the Practice and Theory of Automated Timetabling - PATAT 2021: Volume I (Patrick De Causmaecker, Ender Özcan, Greet Vanden Berghe, eds.), 2020. |
| [895] | 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.), volume 12102 of LNCS, pages 67–82, 2020, Springer. |
| [894] | 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, 2020, Springer. |
| [893] | Casual Employee Scheduling with Constraint Programming and Metaheuristics Computer Aided Systems Theory – EUROCAST 2019 (Roberto Moreno-Díaz, Franz Pichler, Alexis Quesada-Arencibia, eds.), volume 12013 of LNCS, pages 279–287, 2020, Springer. |
| [892] | Extending Partial 1-Planar Drawings Automata, Languages, and Programming (ICALP'20) (Artur Czumaj, Anuj Dawar, Emanuela Merelli, eds.), volume 168 of LIPIcs, pages 43:1–43:19, 2020, Schloss Dagstuhl–Leibniz-Zentrum für Informatik. |
| [891] | Extending Nearly Complete 1-Planar Drawings in Polynomial Time Mathematical Foundations of Computer Science (MFCS'20) (Javier Esparza, Daniel Král', eds.), volume 170 of LIPIcs, pages 31:1–31:16, 2020, Schloss Dagstuhl – Leibniz-Zentrum für Informatik. |
| [890] | On Solving a Generalized Constrained Longest Common Subsequence Problem , 2020. Note: submitted to OPTIMA 2020 |
| [889] | A Beam Search for the Longest Common Subsequence Problem Guided by a Novel Approximate Expected Length Calculation Proceedings of LOD 2019 – The 5th International Conference on Machine Learning, Optimization and Data Science (Giuseppe Nicosia, Panos Pardalos, Giovanni Giuffrida, Renato Umeton, Vincenzo Sciacca, eds.), volume 11943 of LNCS, pages 154–167, 2020, Springer. |
| [888] | An Algorithmic Study of Fully Dynamic Independent Sets for Map Labeling Algorithms (ESA'20) (Fabrizio Grandoni, Peter Sanders, Grzegorz Herman, eds.), volume 173 of LIPIcs, pages 19:1–19:24, 2020, Schloss Dagstuhl – Leibniz-Zentrum für Informatik. |
| [887] | Balanced Independent and Dominating Sets on Colored Interval Graphs European Workshop on Computational Geometry (EuroCG'20), pages 66:1–66:6, 2020. |
| [886] | Parameterized Algorithms for Queue Layouts Graph Drawing and Network Visualization (GD'20) (David Auber, Pavel Valtr, eds.), 2020, Springer. |
| [885] | Layered Fan-Planar Graph Drawings Mathematical Foundations of Computer Science (MFCS'20) (Javier Esparza, Daniel Král', eds.), volume 170 of LIPIcs, pages 14:1–14:13, 2020, Schloss Dagstuhl – Leibniz-Zentrum für Informatik. |
| [884] | 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. |
| [883] | MaxSAT-Based Postprocessing for Treedepth Proceedings of CP 2020, the 26th International Conference on Principles and Practice of Constraint Programming (Helmut Simonis, ed.), volume 12333 of Lecture Notes in Computer Science, pages 478–495, 2020, Springer Verlag. |
| [882] | A Faster Algorithm for Propositional Model Counting Parameterized by Incidence Treewidth Proceedings of SAT 2020, The 23rd International Conference on Theory and Applications of Satisfiability Testing (Luca Pulina, Martina Seidl, eds.), volume 12178 of Lecture Notes in Computer Science, pages 267–276, 2020, Springer Verlag. |
| [881] | Interpolation-Based Semantic Gate Extraction and Its Applications to QBF Preprocessing Computer Aided Verification - 32nd International Conference, CAV 2020 (Shuvendu K. Lahiri, Chao Wang, eds.), volume 12224 of Lecture Notes in Computer Science, pages 508–528, 2020, Springer Verlag. |
| [880] | Short Q-Resolution Proofs with Homomorphisms Proceedings of SAT 2020, The 23rd International Conference on Theory and Applications of Satisfiability Testing (Luca Pulina, Martina Seidl, eds.), volume 12178 of Lecture Notes in Computer Science, pages 412–428, 2020, Springer Verlag. |
| [879] | Multi-linear Strategy Extraction for QBF Expansion Proofs via Local Soundness Theory and Applications of Satisfiability Testing - SAT 2020 - 23rd International Conference (Luca Pulina, Martina Seidl, eds.), volume 12178 of Lecture Notes in Computer Science, pages 429–446, 2020, Springer Verlag. |
| [878] | 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). |
| [877] | Finding the Hardest Formulas for Resolution Proceedings of CP 2020, the 26th International Conference on Principles and Practice of Constraint Programming (Helmut Simonis, ed.), volume 12333 of Lecture Notes in Computer Science, pages 514–530, 2020, Springer Verlag. Note: Best Paper Award |
| [876] | Formalizing Graph Trail Properties in Isabelle/HOL Intelligent Computer Mathematics - 13th International Conference, CICM 2020, Bertinoro, Italy, July 26-31, 2020, Proceedings (Christoph Benzmüller, Bruce R. Miller, eds.), volume 12236 of Lecture Notes in Computer Science, pages 190–205, 2020, Springer Verlag. |
| [875] | Threshold Treewidth and Hypertree Width Proceeding of IJCAI-PRICAI2020, the 29th International Joint Conference on Artificial Intelligence and the 17th Pacific Rim International Conference on Artificial Intelligence, pages 1898–1904, 2020. |
| [874] | Fixed-Parameter Tractability of Dependency QBF with Structural Parameters Proceedings of the 17th International Conference on Principles of Knowledge Representation and Reasoning, KR 2020 (Diego Calvanese, Esra Erdem, Michael Thielscher, eds.), pages 392–402, 2020. |
| [873] | 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, pages 3906–3913, 2020, AAAI Press. |
| [872] | 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 |
| [871] | The Complexity Landscape of Resource-Constrained Scheduling Proceeding of IJCAI-PRICAI2020, the 29th International Joint Conference on Artificial Intelligence and the 17th Pacific Rim International Conference on Artificial Intelligence, 2020. Note: to appear |
| [870] | Breaking Symmetries with RootClique and LexTopsort Proceedings of CP 2020, the 26th International Conference on Principles and Practice of Constraint Programming (Helmut Simonis, ed.), volume 12333 of Lecture Notes in Computer Science, pages 286–303, 2020, Springer Verlag. |
| [869] | A Time Leap Challenge for SAT-Solving Proceedings of CP 2020, the 26th International Conference on Principles and Practice of Constraint Programming (Helmut Simonis, ed.), volume 12333 of Lecture Notes in Computer Science, pages 267–285, 2020, Springer Verlag. |
| [868] | 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 |
| [867] | Extending Nearly Complete 1-Planar Drawings in Polynomial Time 45th International Symposium on Mathematical Foundations of Computer Science, MFCS 2020, 2020, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik. Note: to appear |
| [866] | Extending Partial 1-Planar Drawings 47th International Colloquium on Automata, Languages and Programming, ICALP 2020, 2020, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik. Note: to appear |
| [865] | Hard Problems on Random Graphs 47th International Colloquium on Automata, Languages, and Programming (ICALP 2020), volume 168 of Leibniz International Proceedings in Informatics (LIPIcs), pages 40:1–40:14, 2020, Schloss Dagstuhl–Leibniz-Zentrum für Informatik. |
| [864] | Maximum Shallow Clique Minors in Preferential Attachment Graphs have Polylogarithmic Size Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2020), volume 176 of LIPIcs, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. |
| [863] | First-Order Model-Checking in Random Graphs and Complex Networks 28th Annual European Symposium on Algorithms (ESA 2020), volume 173 of LIPIcs, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. |
| [862] | Stable Matchings with Diversity Constraints: Affirmative Action is beyond NP Proceeding of IJCAI-PRICAI2020, the 29th International Joint Conference on Artificial Intelligence and the 17th Pacific Rim International Conference on Artificial Intelligence, 2020. Note: to appear |
| [861] | Parameterized Algorithms for Queue Layouts Proceedings of GD 2020, the 28th International Symposium on Graph Drawing and Network Visualization, 2020. Note: To appear |
| [860] | Strong (D)QBF Dependency Schemes via Tautology-free Resolution Paths Proceedings of SAT 2020, The 23rd International Conference on Theory and Applications of Satisfiability Testing (Luca Pulina, Martina Seidl, eds.), volume 12178 of Lecture Notes in Computer Science, pages 394–411, 2020, Springer Verlag. |
| [859] | 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 |
| [858] | A Large Neighborhood Search for Distributing Service Points in Mobility Applications with Capacities and Limited Resources 09 2020, Presentation, CPAIOR2020. |
| [857] | Combinatorial Optimization Approaches for Graph Construction Problems apr 2020, PhD thesis, Institute of Logic and Computation, TU Wien. Note: supervised by Günther R. Raidl |
| [856] | Casual Employee Scheduling with Constraint Programming and Metaheuristics nov 2020, Master's thesis, TU Wien, Institute of Logic and Computation. Note: supervised by G. Raidl and N. Frohner |
| [855] | Solving a Generalized Constrained Longest Common Subsequence Problem jun 2020, Master's thesis, TU Wien, Institute of Logic and Computation. Note: supervised by G. Raidl and M. Djukanovic |
| [854] | Heuristische Optimierungsverfahren für die Koordinierung von Flughafenslots mar 2020, Master's thesis, TU Wien, Institute of Logic and Computation. Note: supervised by G. Raidl and A. Chwatal |
| 2019 | |
| [853] | Metabopolis: scalable network layout for biological pathway diagrams in urban map style BMC Bioinformatics, volume 20, pages 187, 2019. |
| [852] | Exact Approaches for Network Design Problems with Relays INFORMS Journal on Computing, volume 31, number 1, pages 171–192, 2019. |
| [851] | Photonic-integrated circuits with non-planar topologies realized by 3D-printed waveguide overpasses Optics Express, volume 27, number 12, pages 17402–17425, 2019. |
| [850] | Minimizing crossings in constrained two-sided circular graph layouts J. Computational Geometry, volume 10, number 2, pages 45–69, 2019. |
| [849] | Lombardi Drawings of Knots and Links J. Computational Geometry, volume 10, number 1, pages 444–476, 2019. |
| [848] | Job Sequencing with One Common and Multiple Secondary Resources: An A*/Beam Search Based Anytime Algorithm Artificial Intelligence, volume 277, number 103173, 2019. |
| [847] | Short Plane Supports for Spatial Hypergraphs J. Graph Algorithms Appl., volume 23, number 3, pages 463–498, 2019. |
| [846] | On the Readability of Leaders in Boundary Labeling Information Visualization, volume 18, number 1, pages 110–132, 2019. |
| [845] | External Labeling Techniques: A Taxonomy and Survey Computer Graphics Forum, volume 38, number 3, pages 833–860, 2019. |
| [844] | Planar Drawings of Fixed-Mobile Bigraphs Theoretical Computer Science, volume 795, pages 408–419, 2019. |
| [843] | Guidelines for Experimental Algorithmics: A Case Study in Network Analysis Algorithms, volume 12, number 7, pages 127:1–127:37, 2019. |
| [842] | Dependency Learning for QBF Journal Artificial Intelligence Research, volume 65, pages 180–208, 2019. |
| [841] | Long-Distance Q-Resolution with Dependency Schemes Journal of Automated Reasoning, volume 63, number 1, pages 127–155, 2019. |
| [840] | On the Parameterized Complexity of (k,s)-SAT Information Processing Letters, volume 143, pages 34–36, 2019. |
| [839] | A SAT Approach to Branchwidth ACM Transactions on Computational Logic, volume 20, number 3, pages 15:1–15:24, 2019. |
| [838] | On the Complexity Landscape of Connected f-Factor Problems Algorithmica, 2019. |
| [837] | Parameterized Complexity of Asynchronous Border Minimization Algorithmica, volume 81, number 1, pages 201–223, 2019. |
| [836] | Shrub-Depth: Capturing Height of Dense Graphs Logical Methods in Computer Science, 2019. |
| [835] | Counting linear extensions: Parameterizations by treewidth Algorithmica, 2019. |
| [834] | Compendium of Parameterized Problems at Higher Levels of the Polynomial Hierarchy MDPI Algorithms, volume 12, number 9, pages 1–28, 2019. |
| [833] | 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. |
| [832] | 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 |
| [831] | 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. |
| [830] | 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. |
| [829] | A Memetic Algorithm for Competitive Facility Location Problems Chapter in Business and Consumer Analytics: New Ideas, pages 637–660, 2019, Springer. |
| [828] | 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. |
| [827] | 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. |
| [826] | A SAT Approach for Finding Sup-Transition-Minors Learning and Intelligent Optimization. LION 2019, volume 11968 of LNCS, pages 325–341, 2019, Springer. |
| [825] | 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. |
| [824] | 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. |
| [823] | 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. |
| [822] | Efficient Segment Folding is Hard Canadian Conference on Computational Geometry (CCCG'19), pages 177–183, 2019. |
| [821] | Exploring Semi-Automatic Map Labeling Advances in Geographic Information Systems (SIGSPATIAL'19), pages 13–22, 2019, ACM. |
| [820] | Towards Improving Merging Heuristics for Binary Decision Diagrams Learning and Intelligent Optimization – 13th International Conference, LION 13 (Nikolaos F. Matsatsinis, Yannis Marinakis, Panos Pardalos, eds.), volume 11968 of LNCS, pages 30–45, 2019, Springer. |
| [819] | 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. |
| [818] | 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.), volume 12013 of LNCS, pages 429-437, 2019, Springer. |
| [817] | 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 presentation |
| [816] | Exact and Heuristic Approaches for the Longest Common Palindromic Subsequence Problem Proceedings of LION 12 – the 12th International Conference on Learning and Intelligent Optimization, volume 11353 of LNCS, pages 199–214, 2019, Springer. |
| [815] | 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. |
| [814] | 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. |
| [813] | 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. |
| [812] | 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. |
| [811] | 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. |
| [810] | 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. |
| [809] | 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. |
| [808] | 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). |
| [807] | On Strict (Outer-)Confluent Graphs Proceedings of GD 2019, the 27th International Symposium on Graph Drawing and Network Visualization, 2019. Note: To appear |
| [806] | 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. |
| [805] | The Parameterized Complexity of Cascading Portfolio Scheduling Proceedings of NeurIPS 2019, the Thirty-third Conference on Neural Information Processing Systems (Hanna M. Wallach, Hugo Larochelle, Alina Beygelzimer, Florence d'Alché-Buc, Emily B. Fox, Roman Garnett, eds.), pages 7666–7676, 2019. |
| [804] | 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. |
| [803] | Integer Programming and Incidence Treedepth? Proceedings of IPCO 2019, The 20th Conference on Integer Programming and Combinatorial Optimization, 2019. Note: To appear |
| [802] | Hardness of FO Model-Checking on Random Graphs 14th International Symposium on Parameterized and Exact Computation (IPEC 2019), volume 148 of LIPIcs, pages 11:1–11:15, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. |
| [801] | Motif Counting in Preferential Attachment Graphs 39th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2019), volume 150 of LIPIcs, pages 13:1–13:14, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. |
| [800] | The Complexity of Packing Edge-Disjoint Paths 14th International Symposium on Parameterized and Exact Computation (IPEC 2019), volume 148 of Leibniz International Proceedings in Informatics (LIPIcs), pages 10:1–10:16, 2019, Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik. |
| [799] | Parameterized Algorithms for Book Embedding Problems Proceedings of GD 2019, the 27th International Symposium on Graph Drawing and Network Visualization, 2019. Note: To appear |
| [798] | 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 |
| [797] | Patient Scheduling in Particle Therapy mar 2019, PhD thesis, Institute of Logic and Computation, TU Wien. Note: supervised by G. R. Raidl |
| [796] | 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 |
| [795] | Perfect Pseudo Matchings on Snarks may 2019, Master's thesis, TU Wien, Institute of Logic and Computation. Note: supervised by G. Raidl |
| [794] | 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 |
| [793] | 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 |
| [792] | 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 | |
| [791] | Exact approaches for the directed network design problem with relays Omega, 2018. |
| [790] | Solving a Selective Dial-a-Ride Problem with Logic-based Benders Decomposition Computers & Operations Research, volume 96, pages 30–54, 2018. |
| [789] | Drawing Large Graphs by Multilevel Maxent-Stress Optimization IEEE Trans. Visualization and Computer Graphics, volume 24, number 5, pages 1814–1827, 2018. |
| [788] | Particle Therapy Patient Scheduling with Limited Starting Time Variations of Daily Treatments International Transactions in Operational Research, 2018. |
| [787] | Scalable Set Visualizations (Dagstuhl Seminar 17332) Dagstuhl Reports, volume 7, number 8, pages 1–22, 2018. |
| [786] | Planar and poly-arc Lombardi drawings J. Computational Geometry, volume 9, number 1, pages 328–355, 2018. |
| [785] | A Genetic Algorithm in Combination with a Solution Archive for Solving the Generalized Vehicle Routing Problem with Stochastic Demands Transportation Science, volume 52, number 3, pages 673–690, 2018. Note: previous technical report available at https://www.ac.tuwien.ac.at/files/tr/ac-tr-16-001.pdf |
| [784] | The complexity landscape of decompositional parameters for ILP Artificial Intelligence, volume 257, pages 61–71, 2018. |
| [783] | Meta-kernelization using well-structured modulators Discr. Appl. Math., volume 248, pages 153–167, 2018. |
| [782] | Solving Problems on Graphs of High Rank-Width Algorithmica, volume 80, number 2, pages 742–771, 2018. |
| [781] | On the complexity of rainbow coloring problems Discr. Appl. Math., volume 246, pages 38–48, 2018. |
| [780] | A single-exponential fixed-parameter algorithm for distance-hereditary vertex deletion Journal of Computer and System Sciences, volume 97, pages 121–146, 2018. |
| [779] | Graph Visualization Chapter in Encyclopedia of Big Data Technologies (Sherif Sakr, Albert Zomaya, eds.), 2018, Springer International Publishing. |
| [778] | A Visual Comparison of Hand-Drawn and Machine-Generated Human Metabolic Pathways Eurographics Conference on Visualization (EuroVis'18) – Posters (Anna Puig, Renata Raidou, eds.), pages 57–59, 2018. |
| [777] | Semi-Automated Location Planning for Urban Bike-Sharing Systems Proceedings of the 7th Transport Research Arena (TRA 2018), pages 1–10, 2018. |
| [776] | Particle Therapy Patient Scheduling: Time Estimation for Scheduling Sets of Treatments Computer Aided Systems Theory – EUROCAST 2017, Part I, pages 364–372, 2018, Springer. |
| [775] | Multivalued Decision Diagrams for a Prize-Collecting Sequencing Problem PATAT 2018: Proceedings of the 12th International Conference of the Practice and Theory of Automated Timetabling, pages 375–397, 2018. |
| [774] | Towards Characterizing Strict Outerconfluent Graphs Graph Drawing and Network Visualization (GD'17) (Fabrizio Frati, Kwan-Liu Ma, eds.), volume 10692 of LNCS, pages 612–614, 2018, Springer. |
| [773] | Minimizing Crossings in Constrained Two-Sided Circular Graph Layouts Computational Geometry (SoCG'18) (Bettina Speckmann, Csaba D. Tóth, eds.), pages 53:1–53:14, 2018, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. |
| [772] | Experimental Evaluation of Book Drawing Algorithms Graph Drawing and Network Visualization (GD'17) (Fabrizio Frati, Kwan-Liu Ma, eds.), volume 10692 of LNCS, pages 224–238, 2018, Springer. |
| [771] | Finding Smooth Graphs with Small Independence Numbers MOD 2017: Machine Learning, Optimization, and Big Data – Third International Conference (Giovanni Giuffrida, Giuseppe Nicosia, Panos Pardalos, Renato Umeton, eds.), volume 10710 of LNCS, pages 527-539, 2018, Springer. |
| [770] | Solving a Weighted Set Covering Problem for Improving Algorithms for Cutting Stock Problems with Setup Costs by Solution Merging Computer Aided Systems Theory – EUROCAST 2017, Part I (Roberto Moreno-Díaz, Franz Pichler, Alexis Quesada-Arencibia, eds.), volume 10671 of LNCS, pages 355-363, 2018, Springer. |
| [769] | Lombardi Drawings of Knots and Links Graph Drawing and Network Visualization (GD'17) (Fabrizio Frati, Kwan-Liu Ma, eds.), volume 10692 of LNCS, pages 113–126, 2018, Springer. |
| [768] | An A* Algorithm for Solving a Prize-Collecting Sequencing Problem with One Common and Multiple Secondary Resources and Time Windows PATAT 2018: Proceedings of the 12th International Conference of the Practice and Theory of Automated Timetabling, pages 235–256, 2018. |
| [767] | Minimzing Wiggles in Storyline Visualizations Graph Drawing and Network Visualization (GD'17) (Fabrizio Frati, Kwan-Liu Ma, eds.), volume 10692 of LNCS, pages 585–587, 2018, Springer. |
| [766] | GRASP-VNS for a Periodic VRP with Time Windows to Deal with Milk Collection Computer Aided Systems Theory – EUROCAST 2017, Part I (Roberto Moreno-Díaz, Franz Pichler, Alexis Quesada-Arencibia, eds.), volume 10671 of LNCS, pages 299-306, 2018, Springer. |
| [765] | Short Plane Supports for Spatial Hypergraphs Graph Drawing and Network Visualization (GD'18) (Therese Biedl, Andreas Kerren, eds.), volume 11282 of LNCS, pages 53–66, 2018, Springer International Publishing. |
| [764] | Planar L-Drawings of Directed Graphs Graph Drawing and Network Visualization (GD'17) (Fabrizio Frati, Kwan-Liu Ma, eds.), volume 10692 of LNCS, pages 465–478, 2018, Springer. |
| [763] | Planar Drawings of Fixed-Mobile Bigraphs Graph Drawing and Network Visualization (GD'17) (Fabrizio Frati, Kwan-Liu Ma, eds.), volume 10692 of LNCS, pages 426–439, 2018, Springer. |
| [762] | Orthogonal and Smooth Orthogonal Layouts of 1-Planar Graphs with Low Edge Complexity Graph Drawing and Network Visualization (GD'18) (Therese Biedl, Andreas Kerren, eds.), volume 11282 of LNCS, pages 509–523, 2018, Springer International Publishing. |
| [761] | Polynomial-Time Validation of QCDCL Certificates Proceedings of SAT 2018, the 21st International Conference on Theory and Applications of Satisfiability Testing, Part of FLoC 2018, July 9–12, 2018, Oxford, UK (Olaf Beyersdorff, Christoph M. Wintersteiger, eds.), volume 10929 of Lecture Notes in Computer Science, pages 253–269, 2018, Springer Verlag. |
| [760] | Portfolio-Based Algorithm Selection for Circuit QBFs QBF Workshop, 2018. |
| [759] | Portfolio-Based Algorithm Selection for Circuit QBFs Proceedings of CP 2018, the 24rd International Conference on Principles and Practice of Constraint Programming (John N. Hooker, ed.), volume 11008 of Lecture Notes in Computer Science, pages 195–209, 2018, Springer Verlag. |
| [758] | On Structural Parameterizations of the Bounded-Degree Vertex Deletion Problem 35th Symposium on Theoretical Aspects of Computer Science, STACS 2018, February 28–March 3, 2018, Caen, France (Rolf Neidermeier, Brigitte Vallée, eds.), volume 96 of LIPIcs, pages 33:1–33:14, 2018, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik. |
| [757] | Sum-of-Products with Default Values: Algorithms and Complexity Results Proceedings of ICTAI 2018, the 30th IEEE International Conference on Tools with Artificial Intelligence (Lefteri H. Tsoukalas, Éric Grégoire, Miltiadis Alamaniotis, eds.), pages 733–737, 2018, IEEE. |
| [756] | Parameterized Algorithms for the Matrix Completion Problem Proceeding of ICML, the Thirty-fifth International Conference on Machine Learning, Stockholm, July 10–15, 2018, pages 1642–1651, 2018, JMLR.org. Note: ISSN: 1938-7228 |
| [755] | An SMT Approach to Fractional Hypertree Width Proceedings of CP 2018, the 24rd International Conference on Principles and Practice of Constraint Programming (John N. Hooker, ed.), volume 11008 of Lecture Notes in Computer Science, pages 109–127, 2018, Springer Verlag. |
| [754] | Small Resolution Proofs for QBF using Dependency Treewidth 35th Symposium on Theoretical Aspects of Computer Science, STACS 2018, February 28–March 3, 2018, Caen, France (Rolf Neidermeier, Brigitte Vallée, eds.), volume 96 of LIPIcs, pages 28:1–28:15, 2018, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik. |
| [753] | A Structural Approach to Activity Selection Proceedings of IJCAI 2018, the 27th International Joint Conference on Artificial Intelligence, pages 203–209, 2018, ijcai.org. |
| [752] | Unary Integer Linear Programming with Structural Restrictions Proceedings of IJCAI 2018, the 27th International Joint Conference on Artificial Intelligence, pages 1284–1290, 2018, ijcai.org. |
| [751] | Local Structure Theorems for Erdos-Rényi Graphs and Their Algorithmic Applications 44th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM 2018), volume 10706 of Lecture Notes in Computer Science, pages 125–136, 2018, Springer Verlag. |
| [750] | Portfolio Solvers for QDIMACS and QCIR 2018. Note: QBF Evaluation at SAT |
| [749] | Advances in Decomposition Approaches for Mixed Integer Linear Programming Nov 2018, PhD thesis, Institute of Logic and Computation, TU Wien. Note: supervised by G. R. Raidl |
| [748] | Methods for Intraday Scheduling in Particle Therapy nov 2018, Master's thesis, TU Wien, Institute of Logic and Computation. Note: supervised by G. Raidl and J. Maschler |
| [747] | Local Search Methods for the Particle Therapy Patient Scheduling Problem sep 2018, Master's thesis, TU Wien, Institute of Logic and Computation. Note: supervised by G. Raidl and J. Maschler |
| [746] | Monero Chross-Chain Traceability sep 2018, Master's thesis, TU Wien, Institute of Logic and Computation. Note: supervised by G. Raidl |
| [745] | Parallel Hybrid Metaheuristics for Solving the Firefighter Problem Using the GPU jun 2018, Master's thesis, TU Wien, Institute of Logic and Computation. Note: supervised by G. Raidl and C. Bacher |
| 2017 | |
| [744] | Linear-Time Parameterized Algorithms via Skew-Symmetric Multicuts ACM Trans. Algorithms, volume 13, number 4, pages 46:1–46:25, September 2017, Assoc. Comput. Mach., New York. |
| [743] | Solving the Two-State Fixed-Charge Transportation Problem with a Hybrid Genetic Algorithm Carpathian Journal of Mathematics, volume 33, number 3, pages 365–371, 2017. |
| [742] | Partitioning Graph Drawings and Triangulated Simple Polygons into Greedily Routable Regions International Journal of Computational Geometry and Applications, volume 27, number 1–2, pages 121–158, 2017. |
| [741] | Euclidean Greedy Drawings of Trees Discrete and Computational Geometry, volume 58, number 3, pages 543–579, 2017. |
| [740] | Large Neighborhood Search for the Most Strings with Few Bad Columns Problem Soft Computing, volume 21, number 17, pages 4901–4915, 2017. |
| [739] | Full-Load Route Planning for Balancing Bike Sharing Systems by Logic-Based Benders Decomposition Networks, volume 69, number 3, pages 270–289, 2017. Note: previous technical report available at https://www.ac.tuwien.ac.at/files/pub/kloimuellner-17a.pdf |
| [738] | Progress on Partial Edge Drawings J. Graph Algorithms Appl., volume 21, number 4, pages 757–786, 2017. |
| [737] | The Treewidth of Proofs Information and Computation, volume 255, pages 147–164, 2017. |
| [736] | Parameterized Complexity of Directed Steiner Tree on Sparse Graphs SIAM J. Discrete Math., volume 31, number 2, pages 1294–1327, 2017. |
| [735] | Hitting (Selected) Odd Cycles SIAM J. Discrete Math., volume 31, number 3, pages 1581–1615, 2017. |
| [734] | On the parameterized complexity of finding small unsatisfiable subsets of CNF formulas and CSP instances ACM Transactions on Computational Logic, volume 18, number 3, pages Art. 21, 46, 2017. |
| [733] | Backdoors into heterogeneous classes of SAT and CSP Journal of Computer and System Sciences, volume 85, pages 38–56, 2017. |
| [732] | Discovering Archipelagos of Tractability for Constraint Satisfaction and Counting ACM Transactions on Algorithms, volume 13, number 2, pages 29:1–29:32, 2017. |
| [731] | Kernelization using structural parameters on sparse graph classes Journal of Computer and System Sciences, volume 84, pages 219–242, 2017. |
| [730] | Parameterized Complexity Classes Beyond Para-NP Journal of Computer and System Sciences, volume 87, pages 16–57, 2017. |
| [729] | Faster exact algorithms for some terminal set problems J. Comput. Syst. Sci., volume 88, pages 195–207, 2017. |
| [728] | Metric Dimension of Bounded Tree-length Graphs SIAM J. Discrete Math., volume 31, number 2, pages 1217–1243, 2017. |
| [727] | Free Weak Nilpotent Minimum Algebras Soft Computing, volume 21(1), pages 79–95, 2017. |
| [726] | Crowdsourcing Versus the Laboratory: Towards Human-Centered Experiments Using the Crowd Chapter in Evaluation in the Crowd. Crowdsourcing and Human-Centered Experiments (Daniel Archambault, Helen Purchase, Tobias Hoßfeld, eds.), volume 10264 of LNCS, pages 6–26, 2017, Springer International Publishing. |
| [725] | Backdoor Sets for CSP Chapter in The Constraint Satisfaction Problem: Complexity and Approximability (Andrei A. Krokhin, Stanislav Zivny, eds.), volume 7 of Dagstuhl Follow-Ups, pages 137–157, 2017, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik. |
| [724] | Minimizing crossings in constrained two-sided circular graph layouts European Workshop on Computational Geometry (EuroCG'17), pages 265–268, April 2017. |
| [723] | Radial Contour Labeling with Straight Leaders IEEE Pacific Visualization Symposium (PacificVis'17), pages 295–304, 2017. |
| [722] | A Logic-Based Benders Decomposition Approach for the 3-Staged Strip Packing Problem Operations Research Proceedings 2015 — Selected Papers of the International Conference of the German, Austrian and Swiss Operations Research Societies (GOR, ÖGOR, SVOR/ASRO), University of Vienna, Austria, September 1–4, 2015 (Karl Franz Dörner, Ivana Ljubić, Georg Pflug, Gernot Tragler, eds.), pages 393–399, 2017, Springer. |
| [721] | Particle Therapy Patient Scheduling: Time Estimation to Schedule Sets of Treatments Extended Abstracts of the Sixteenth International Conference on Computer Aided Systems Theory (EUROCAST 2017) (Alexis Quesada-Arencibia, José Carlos Rodríguez, Roberto Moreno-Díaz, eds.), pages 106–107, 2017. |
| [720] | An Enhanced Iterated Greedy Metaheuristic for the Particle Therapy Patient Scheduling Problem Proceedings of the 12th Metaheuristics International Conference, pages 465–474, 2017. |
| [719] | A Linear-Time Parameterized Algorithm for Node Unique Label Cover 25th Annual European Symposium on Algorithms (ESA 2017) (Kirk Pruhs, Christian Sohler, eds.), volume 87 of Leibniz International Proceedings in Informatics (LIPIcs), pages 57:1–57:15, 2017, Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik. |
| [718] | Hierarchical Clustering and Multilevel Refinement for the Bike-Sharing Station Planning Problem Conference Proceedings of Learning and Intelligent Optimization Conference (LION 11) (Roberto Battiti, Dmitri Kvasov, Yaroslav Sergeyev, eds.), volume 10556 of LNCS, pages 1–16, 2017, Springer. |
| [717] | Solving a Weighted Set Covering Problem for Improving Algorithms for Cutting Stock Problems with Setup Costs by Solution Merging Extended Abstracts of the Sixteenth International Conference on Computer Aided Systems Theory (EUROCAST 2017) (Alexis Quesada-Arencibia, José Carlos Rodríguez, Roberto Moreno-Díaz, eds.), pages 104–105, 2017. |
| [716] | Efficient Consideration of Soft Time Windows in a Large Neighborhood Search for the Districting and Routing Problem for Security Control Evolutionary Computation in Combinatorial Optimization. EvoCOP 2017 (Bin Hu, Manuel López-Ibáñez, eds.), volume 10197 of LNCS, pages 91–107, 2017, Springer. |
| [715] | Job Sequencing with One Common and Multiple Secondary Resources: A Problem Motivated from Particle Therapy for Cancer Treatment MOD 2017: Machine Learning, Optimization, and Big Data – Third International Conference (Giovanni Giuffrida, Giuseppe Nicosia, Panos Pardalos, Renato Umeton, eds.), volume 10710 of LNCS, pages 506–518, 2017, Springer. |
| [714] | GRASP and VNS for a Periodic VRP with Time Windows to Deal with Milk Collection Extended Abstracts of the Sixteenth International Conference on Computer Aided Systems Theory – EUROCAST 2017 (Roberto Moreno-Díaz, Franz Pichler, Alexis Quesada-Arencibia, eds.), 2017. |
| [713] | A Scalable Approach for the K-Staged Two-Dimensional Cutting Stock Problem Operations Research Proceedings 2015 — Selected Papers of the International Conference of the German, Austrian and Swiss Operations Research Societies (GOR, ÖGOR, SVOR/ASRO), University of Vienna, Austria, September 1–4, 2015 (Karl Franz Dörner, Ivana Ljubić, Georg Pflug, Gernot Tragler, eds.), pages 385–391, 2017, Springer. |
| [712] | Rigging Nearly Acyclic Tournaments Is Fixed-Parameter Tractable Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, February 4-9, 2017, San Francisco, California, USA, pages 3929–3935, 2017. |
| [711] | Dependency learning for QBF Theory and Applications of Satisfiability Testing - SAT 2017 - 20th International Conference, Melbourne, VIC, Australia, August 28 - September 1, 2017, Proceedings (Serge Gaspers, Toby Walsh, eds.), volume 10491 of Lecture Notes in Computer Science, pages 298–313, 2017, Springer Verlag. |
| [710] | Linear Representation of Transversal Matroids and Gammoids parameterized by rank Computing and Combinatorics: 23rd International Conference, COCOON 2017, Hong Kong, China, August 3-5, 2017, Proceedings (Yixin Cao, Jianer Chen, eds.), pages 420–432, 2017, Springer Verlag. |
| [709] | Lossy kernelization Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2017, Montreal, QC, Canada, June 19-23, 2017, pages 224–237, 2017. |
| [708] | A SAT Approach to Branchwidth Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, IJCAI 2017, Melbourne, Australia, August 19-25, 2017 (Carles Sierra, ed.), pages 4894–4898, 2017, ijcai.org. Note: Sister Conference Best Paper Track |
| [707] | SAT-Encodings for Special Treewidth and Pathwidth Theory and Applications of Satisfiability Testing - SAT 2017 - 20th International Conference, Melbourne, VIC, Australia, August 28 - September 1, 2017, Proceedings (Serge Gaspers, Toby Walsh, eds.), volume 10491 of Lecture Notes in Computer Science, pages 429–445, 2017, Springer Verlag. |
| [706] | New Width Parameters for Model Counting Theory and Applications of Satisfiability Testing - SAT 2017 - 20th International Conference, Melbourne, VIC, Australia, August 28 - September 1, 2017, Proceedings (Serge Gaspers, Toby Walsh, eds.), volume 10491 of Lecture Notes in Computer Science, pages 38–52, 2017, Springer Verlag. |
| [705] | Backdoor Treewidth for SAT Theory and Applications of Satisfiability Testing - SAT 2017 - 20th International Conference, Melbourne, VIC, Australia, August 28 - September 1, 2017, Proceedings (Serge Gaspers, Toby Walsh, eds.), volume 10491 of Lecture Notes in Computer Science, pages 20–37, 2017, Springer Verlag. |
| [704] | Combining Treewidth and Backdoors for CSP 34th Symposium on Theoretical Aspects of Computer Science (STACS 2017) (Heribert Vollmer, Brigitte Vallée, eds.), volume 66 of Leibniz International Proceedings in Informatics (LIPIcs), pages 36:1–36:17, 2017, Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik. |
| [703] | On Structural Parameterizations of the Edge Disjoint Paths Problem 28th International Symposium on Algorithms and Computation, ISAAC 2017, December 9-12, 2017, Phuket, Thailand (Yoshio Okamoto, Takeshi Tokuyama, eds.), volume 92 of LIPIcs, pages 36:1–36:13, 2017, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik. |
| [702] | Path-Contractions, Edge Deletions and Connectivity Preservation 25th Annual European Symposium on Algorithms (ESA 2017) (Kirk Pruhs, Christian Sohler, eds.), volume 87 of Leibniz International Proceedings in Informatics (LIPIcs), pages 47:1–47:13, 2017, Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik. |
| [701] | Backdoor Trees for Answer Set Programming Proceedings of the 10th Workshop on Answer Set Programming and Other Computing Paradigms co-located with the 14th International Conference on Logic Programming and Nonmonotonic Reasoning, ASPOCP@LPNMR 2017, Espoo, Finland, July 3, 2017. (Bart Bogaerts, Amelia Harrison, eds.), volume 1868 of CEUR Workshop Proceedings, 2017, CEUR-WS.org. |
| [700] | SAT-Based Local Improvement for Finding Tree Decompositions of Small Width Theory and Applications of Satisfiability Testing - SAT 2017 - 20th International Conference, Melbourne, VIC, Australia, August 28 - September 1, 2017, Proceedings (Serge Gaspers, Toby Walsh, eds.), volume 10491 of Lecture Notes in Computer Science, pages 401–411, 2017, Springer Verlag. |
| [699] | Solving Integer Linear Programs with a Small Number of Global Variables and Constraints Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, IJCAI 2017, Melbourne, Australia, August 19-25, 2017 (Carles Sierra, ed.), pages 607–613, 2017, ijcai.org. |
| [698] | Complexity Results for Aggregating Judgments using Scoring or Distance-Based Procedures Proceedings of AAMAS 2017, the 16th International Conference on Autonomous Agents and Multiagent Systems, 2017, IFAAMAS/ACM. |
| [697] | Complexity Results for Manipulation, Bribery and Control of the Kemeny Judgment Aggregation Procedure Proceedings of AAMAS 2017, the 16th International Conference on Autonomous Agents and Multiagent Systems, 2017, IFAAMAS/ACM. |
| [696] | Going Beyond Primal Treewidth for (M)ILP Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, February 4-9, 2017, San Francisco, California, USA., pages 815–821, 2017. |
| [695] | Saving Critical Nodes with Firefighters is FPT 44th International Colloquium on Automata, Languages, and Programming (ICALP 2017) (Ioannis Chatzigiannakis, Piotr Indyk, Fabian Kuhn, Anca Muscholl, eds.), volume 80 of Leibniz International Proceedings in Informatics (LIPIcs), pages 135:1–135:13, 2017, Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik. |
| [694] | Circuit Treewidth, Sentential Decision, and Query Compilation Proceedings of the 36th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, PODS 2017, Chicago, IL, USA, May 14-19, 2017 (Emanuel Sallinger, Jan Van den Bussche, Floris Geerts, eds.), pages 233–246, 2017, Assoc. Comput. Mach., New York. |
| [693] | Herbrand Property: Finite Quasi-Herbrand Models and Lifting Chandra-Merlin Theorem to Quantified Conjunctive Queries Proceedings of the Thirty-Second ACM/IEEE Symposium on Logic in Computer Science (LICS) June 20-23, 2017, Reykjavik, Iceland, 2017. |
| [692] | How many variables are needed to express an existential positive query? Proceeding of the Twentieth International Conference on Database Theory (ICDT), March 21-24, 2017, Venice, Italy, 2017. Note: Best Paper Award |
| [691] | Towards a Polynomial Kernel for Directed Feedback Vertex Set 42nd International Symposium on Mathematical Foundations of Computer Science, MFCS 2017, August 21-25, 2017 - Aalborg, Denmark (Kim G. Larsen, Hans L. Bodlaender, Jean-François Raskin, eds.), volume 83 of LIPIcs, pages 36:1–36:15, 2017, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik. |
| [690] | Pareto Optimal Allocation under Uncertain Preferences Proceedings of AAMAS 2017, the 16th International Conference on Autonomous Agents and Multiagent Systems, 2017, IFAAMAS/ACM. Note: Extended Abstract |
| [689] | Stable Matching with Uncertain Pairwise Preferences Proceedings of AAMAS 2017, the 16th International Conference on Autonomous Agents and Multiagent Systems, 2017, IFAAMAS/ACM. |
| [688] | An Iterative Time-Bucket Refinement Algorithm for High Resolution Scheduling Problems oct 2017, Master's thesis, TU Wien, Institute of Computer Graphics and Algorithms. Note: supervised by G. Raidl, M. Riedler, and J. Maschler |
| 2016 | |
| [687] | Hybrid Metaheuristics – Powerful Tools for Optimization 2016, Springer. |
| [686] | 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. |
| [685] | 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 |
| [684] | 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. |
| [683] | On Self-Approaching and Increasing-Chord Drawings of 3-Connected Planar Graphs J. Computational Geometry, volume 7, number 1, pages 47–69, 2016. |
| [682] | Extending Convex Partial Drawings of Graphs Algorithmica, volume 76, number 1, pages 47–67, 2016. |
| [681] | Mixed Map Labeling J. Spatial Information Science, volume 13, pages 3–32, 2016. |
| [680] | 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 |
| [679] | Evaluation of Labeling Strategies for Rotating Maps ACM J. Experimental Algorithmics, volume 21, number 1, pages 1.4:1–1.4:21, 2016. |
| [678] | Consistent Labeling of Rotating Maps J. Computational Geometry, volume 7, number 1, pages 308–331, 2016. |
| [677] | Strict Confluent Drawing J. Computational Geometry, volume 7, number 1, pages 22–46, 2016. |
| [676] | 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 |
| [675] | 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 |
| [674] | 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 |
| [673] | Adjacency-Preserving Spatial Treemaps J. Computational Geometry, volume 7, number 1, pages 100-122, 2016. |
| [672] | Quantifier reordering for QBF Journal of Automated Reasoning, volume 56, number 4, pages 459–477, 2016. |
| [671] | Soundness of Q-resolution with dependency schemes Theoretical Computer Science, volume 612, pages 83–101, 2016. |
| [670] | Model Counting for CNF Formulas of Bounded Modular Treewidth Algorithmica, volume 76, number 1, pages 168–194, 2016. |
| [669] | A Parameterized Study of Maximum Generalized Pattern Matching Problems Algorithmica, volume 75, number 1, pages 1–26, 2016. |
| [668] | Complexity and monotonicity results for domination games Theor. Comput. Sci., volume 628, pages 1–29, 2016. |
| [667] | Tree-depth and vertex-minors Eur. J. Comb., volume 56, pages 46–56, 2016. |
| [666] | Backdoors to q-Horn Algorithmica, volume 74, number 1, pages 540–557, 2016. |
| [665] | Meta-Kernelization with Structural Parameters Journal of Computer and System Sciences, volume 82, number 2, pages 333–346, 2016. |
| [664] | FO Model Checking of Interval Graphs Logical Methods in Computer Science, volume 11, number 4, 2016. |
| [663] | Are There Any Good Digraph Measures? Journal of Combinatorial Theory, Series B, volume 116, pages 250–286, 2016. |
| [662] | Directed elimination games Discrete Applied Mathematics, volume 199, pages 187–198, 2016. |
| [661] | Quantified Conjunctive Queries on Partially Ordered Sets Theoretical Computer Science, volume 618, pages 72–84, 2016. |
| [660] | Model Checking Existential Logic on Partially Ordered Sets ACM Transactions on Computational Logic, volume 17, number 2, 2016. |
| [659] | Partially Polynomial Kernels for Set Cover and Test Cover SIAM J. Discrete Math., volume 30, number 3, pages 1401–1423, 2016. |
| [658] | 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. |
| [657] | 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. |
| [656] | 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. |
| [655] | 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. |
| [654] | 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. |
| [653] | 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. |
| [652] | Temporal Map Labeling: A New Unified Framework with Experiments Advances in Geographic Information Systems (SIGSPATIAL'16), pages 23:1–23:10, 2016. |
| [651] | 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. |
| [650] | 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. |
| [649] | 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. |
| [648] | 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. |
| [647] | 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. |
| [646] | 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. |
| [645] | 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. |
| [644] | 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. |
| [643] | 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. |
| [642] | 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. |
| [641] | 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. |
| [640] | 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. |
| [639] | 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. |
| [638] | 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. |
| [637] | 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. |
| [636] | 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. |
| [635] | 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. |
| [634] | 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. |
| [633] | 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. |
| [632] | 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. |
| [631] | Parameterized Complexity Results for the Kemeny Rule in Judgment Aggregation Proceedings of ComSoc 2016, the Sixth International Workshop on Computational Social Choice, 2016. |
| [630] | 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. |
| [629] | 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. |
| [628] | 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. |
| [627] | 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. |
| [626] | 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. |
| [625] | 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 |
| [624] | Parameterized Complexity in the Polynomial Hierarchy 2016, PhD thesis, Technische Universität Wien. |
| [623] | 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 |
| [622] | 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 |
| [621] | 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 |
| [620] | 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 |
| [619] | Positive and Negative Results for Parameterized Compilability 2016, Technical report AC-TR-16-003, Algorithms and Complexity Group, TU Wien. |
| [618] | Complexity Results for Manipulation, Bribery and Control of the Kemeny Procedure in Judgment Aggregation August 2016, Technical report 1608.02406, arXiv.org. |
| 2015 | |
| [617] | Backdoors to Tractable Answer Set Programming Artificial Intelligence, volume 220, pages 64–103, March 2015. |
| [616] | Numerische Optimierung elektrifizierter Antriebsstränge Motortechnische Zeitschrift (MTZ), volume 03, pages 66–74, Mar 2015, Springer. |
| [615] | Numerical Optimisation of Electro-Hybrid Powertrains MTZ Worldwide, volume 03, pages 46–52, Mar 2015, Springer. |
| [614] | 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. |
| [613] | 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 |
| [612] | 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 |
| [611] | Multi-Row Boundary-Labeling Algorithms for Panorama Images ACM Trans. Spatial Algorithms and Systems, volume 1, number 1, pages 1:1–1:30, 2015. |
| [610] | 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 |
| [609] | Empirical Evaluation for Graph Drawing (Dagstuhl Seminar 15052) Dagstuhl Reports, volume 5, number 1, pages 243–258, 2015. |
| [608] | Many-to-One Boundary Labeling with Backbones J. Graph Algorithms Appl., volume 19, number 3, pages 779–816, 2015. |
| [607] | Computing secure sets in graphs using answer set programming Journal of Logic and Computation, 2015. |
| [606] | Parameterized and subexponential-time complexity of satisfiability problems and applications Theoretical Computer Science, volume 607, pages 282–295, 2015. |
| [605] | A SAT Approach to Clique-Width ACM Transactions on Computational Logic, volume 16, number 3, pages 24, 2015. |
| [604] | Faster Parameterized Algorithms for Deletion to Split Graphs Algorithmica, volume 71, number 4, pages 989–1006, 2015. |
| [603] | On finding optimal polytrees Theoretical Computer Science, volume 592, pages 49–58, 2015. |
| [602] | Improving Vertex Cover as a Graph Parameter Discrete Mathematics & Theoretical Computer Science, volume 17, number 2, pages 77–100, 2015. |
| [601] | Backdoors to Normality for Disjunctive Logic Programs ACM Transactions on Computational Logic, volume 17, number 1, 2015. |
| [600] | On the Subexponential-Time Complexity of CSP Journal Artificial Intelligence Research, volume 52, pages 203–234, 2015. |
| [599] | 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. |
| [598] | A complete parameterized complexity analysis of bounded planning Journal of Computer and System Sciences, volume 81, number 7, pages 1311–1332, 2015. |
| [597] | 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. |
| [596] | 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. |
| [595] | 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. |
| [594] | 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. |
| [593] | 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. |
| [592] | 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. |
| [591] | 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. |
| [590] | 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. |
| [589] | 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. |
| [588] | 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. |
| [587] | Operating Power Grids with Few Flow Control Buses Future Energy Systems (e-Energy'15), pages 289–294, 2015, ACM. |
| [586] | 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. |
| [585] | 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. |
| [584] | 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. |
| [583] | 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. |
| [582] | 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. |
| [581] | 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. |
| [580] | 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. |
| [579] | 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. |
| [578] | 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. |
| [577] | 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. |
| [576] | 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. |
| [575] | 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. |
| [574] | 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. |
| [573] | 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. |
| [572] | 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. |
| [571] | 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. |
| [570] | 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. |
| [569] | 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. |
| [568] | 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. |
| [567] | 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. |
| [566] | 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. |
| [565] | 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. |
| [564] | 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. |
| [563] | 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. |
| [562] | 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. |
| [561] | 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. |
| [560] | 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. |
| [559] | 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. |
| [558] | 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. |
| [557] | 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. |
| [556] | 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. |
| [555] | 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. |
| [554] | A Dichotomy Result for Ramsey Quantifiers Proceedings of WoLLIC 2015, the 22nd International Workshop on Logic, Language, Information, and Computation, 2015, Springer Verlag. |
| [553] | 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. |
| [552] | 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. |
| [551] | 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. |
| [550] | 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. |
| [549] | 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. |
| [548] | 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 |
| [547] | 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 |
| [546] | 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 |
| [545] | 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 |
| [544] | An Overview of Non-Uniform Parameterized Complexity 2015, Technical report TR15-130, Electronic Colloquium on Computational Complexity (ECCC). |
| 2014 | |
| [543] | On d-regular schematization of embedded paths Comput. Geom. Theory Appl., volume 47, number 3A, pages 381–406, 2014. |
| [542] | Tractable answer-set programming with weight constraints: bounded treewidth is not enough Theory Pract. Log. Program., volume 14, number 2, pages 141-164, 2014. |
| [541] | Faster Parameterized Algorithms Using Linear Programming ACM Transactions on Algorithms, volume 11, number 2, pages 15:1–15:31, 2014. |
| [540] | Guarantees and limits of preprocessing in constraint satisfaction and reasoning Artificial Intelligence, volume 216, pages 1-19, 2014. |
| [539] | Lower bounds on the complexity of MSO1 model-checking J. Comput. Syst. Sci., volume 80, number 1, pages 180–194, 2014. |
| [538] | Digraph width measures in parameterized algorithmics Discrete Applied Mathematics, volume 168, pages 88–107, 2014. |
| [537] | Unification and Projectivity in De Morgan and Kleene Algebras Order, volume 31, number 2, pages 159–187, 2014. |
| [536] | Scalability Considerations for Multivariate Graph Visualization Chapter in Multivariate Network Visualization (Andreas Kerren, Helen C. Purchase, Matthew O. Ward, eds.), volume 8380 of LNCS, pages 207–235, 2014, Springer International Publishing. |
| [535] | Reducing the Number of Simulations in Operation Strategy Optimization for Hybrid Electric Vehicles Chapter in Applications of Evolutionary Computation (Anna I. Esparcia-Alcázar, Antonio M. Mora, eds.), pages 553-564, 2014, Springer. |
| [534] | A survey on automated metro map layout methods Schematic Mapping Workshop, apr 2014. |
| [533] | Boosting an Exact Logic-Based Benders Decomposition Approach by Variable Neighborhood Search Proceedings of the 3rd International Conference on Variable Neighborhood Search, volume 47 of Electronic Notes in Discrete Mathematics, pages 149–156, 2014, Elsevier. |
| [532] | Speeding up Logic-Based Benders' Decomposition by a Metaheuristic for a Bi-Level Capacitated Vehicle Routing Problem Hybrid Metaheuristics, 9th Int. Workshop, HM 2014 (Maria J. Blesa, Christain Blum, Stefan Voß, eds.), volume 8457 of LNCS, pages 183–197, 2014, Springer. |
| [531] | Balancing Bicycle Sharing Systems: An Analysis of Path Relinking and Recombination within a GRASP Hybrid Parallel Problem Solving from Nature – PPSN XIII (Thomas Bartz-Beielstein, Jürgen Branke, Bogdan Filipic, Jim Smith, eds.), volume 8672 of LNCS, pages 792–801, 2014, Springer. |
| [530] | On Self-Approaching and Increasing-Chord Drawings of 3-Connected Planar Graphs Graph Drawing (GD'14) (Christian A. Duncan, Antonios Symvonis, eds.), volume 8871 of LNCS, pages 476–487, 2014, Springer Berlin Heidelberg. |
| [529] | Minimum Tree Supports for Hypergraphs and Low-Concurrency Euler Diagrams Algorithm Theory (SWAT'14) (R. Ravi, I. L. Gørtz, eds.), volume 8503 of LNCS, pages 253–264, 2014, Springer International Publishing. |
| [528] | Balancing Bicycle Sharing Systems: An Approach for the Dynamic Case Evolutionary Computation in Combinatorial Optimization – EvoCOP 2014 (Christian Blum, Gabriela Ochoa, eds.), volume 8600 of LNCS, pages 73–84, 2014, Springer. |
| [527] | An Efficient Variable Neighborhood Search Solving a Robust Dynamic Facility Location Problem in Emergency Service Network Proceedings of the 3rd International Conference on Variable Neighborhood Search, volume 47 of Electronic Notes in Discrete Mathematics, pages 261–268, 2014, Elsevier. |
| [526] | Variable Neighbourhood Search for Integrated Timetable Design of Railway Infrastructure Proceedings of the 3rd International Conference on Variable Neighborhood Search, volume 47 of Electronic Notes in Discrete Mathematics, pages 141–148, 2014, Elsevier. |
| [525] | A Metaheuristic Approach for Integrated Timetable based Design of Railway Infrastructure Proceedings of the 3rd International Conference on Road and Rail Infrastructure CETRA 2014 (S. Lakusic, others, eds.), pages 691–696, 2014, Department of Transportation, University of Zagreb. |
| [524] | Evaluation of Labeling Strategies for Rotating Maps Experimental Algorithms (SEA'14) (Joachim Gudmundsson, J. Katajainen, eds.), volume 8504 of LNCS, pages 235–246, 2014, Springer International Publishing. |
| [523] | A Variable Neighborhood Search Using Very Large Neighborhood Structures for the 3-Staged 2-Dimensional Cutting Stock Problem Hybrid Metaheuristics, 9th Int. Workshop, HM 2014 (Maria J. Blesa, Christain Blum, Stefan Voß, eds.), volume 8457 of LNCS, pages 85–99, 2014, Springer. |
| [522] | PIGRA – A Tool for Pixelated Graph Representations Graph Drawing (GD'14) (Christian A. Duncan, Antonios Symvonis, eds.), volume 8871 of LNCS, pages 513–514, 2014, Springer Berlin Heidelberg. Note: Poster abstract |
| [521] | An Evolutionary Algorithm for the Leader-Follower Facility Location Problem with Proportional Customer Behavior Conference Proceedings of Learning and Intelligent Optimization Conference (LION 8), volume 8426 of LNCS, pages 203–217, 2014, Springer. |
| [520] | Semantic Word Cloud Representations: Hardness and Approximation Algorithms Theoretical Informatics (LATIN'14) (Alfredo Viola, ed.), volume 8392 of LNCS, pages 514–525, 2014, Springer Berlin Heidelberg. |
| [519] | Simultaneous Embeddability of Two Partitions Graph Drawing (GD'14) (Christian A. Duncan, Antonios Symvonis, eds.), volume 8871 of LNCS, pages 64–75, 2014, Springer Berlin Heidelberg. |
| [518] | Variable Dependencies and Q-Resolution Theory and Applications of Satisfiability Testing - SAT 2014 - 17th International Conference, Held as Part of the Vienna Summer of Logic, VSL 2014, Vienna, Austria, July 14-17, 2014. Proceedings (Carsten Sinz, Uwe Egly, eds.), volume 8561 of Lecture Notes in Computer Science, pages 269–284, 2014, Springer Verlag. |
| [517] | Linear Time Parameterized Algorithms via Skew-Symmetric Multicuts Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2014, Portland, Oregon, USA, January 5-7, 2014, pages 1739–1748, 2014. |
| [516] | Vertex Exponential Algorithms for Connected f-Factors 34th International Conference on Foundation of Software Technology and Theoretical Computer Science, FSTTCS 2014, December 15-17, 2014, New Delhi, India, pages 61–71, 2014. |
| [515] | A Parameterized Study of Maximum Generalized Pattern Matching Problems Parameterized and Exact Computation - 9th International Symposium, IPEC 2014, Wroclaw, Poland, September 10-12, 2014. Revised Selected Papers (Marek Cygan, Pinar Heggernes, eds.), volume 8894 of Lecture Notes in Computer Science, pages 270–281, 2014, Springer Verlag. |
| [514] | Backdoors to Planning Proceedings of the Twenty-Eighth AAAI Conference on Artificial Intelligence, July 27 -31, 2014, Québec City, Québec, Canada. (Carla E. Brodley, Peter Stone, eds.), pages 2300–2307, 2014, AAAI Press. |
| [513] | Parameterized Approximations via d-Skew-Symmetric Multicut Mathematical Foundations of Computer Science 2014 - 39th International Symposium, MFCS 2014, Budapest, Hungary, August 25-29, 2014. Proceedings, Part II, pages 457–468, 2014. |
| [512] | Parameterized and Subexponential-Time Complexity of Satisfiability Problems and Applications Combinatorial Optimization and Applications - 8th International Conference, COCOA 2014, Wailea, Maui, HI, USA, December 19-21, 2014, Proceedings (Zhao Zhang, Lidong Wu, Wen Xu, Ding-Zhu Du, eds.), volume 8881 of Lecture Notes in Computer Science, pages 637–651, 2014, Springer Verlag. |
| [511] | Backdoors into Heterogeneous Classes of SAT and CSP Proceedings of the Twenty-Eighth AAAI Conference on Artificial Intelligence, July 27-31, 2014, Québec City, Québec, Canada. (Carla E. Brodley, Peter Stone, eds.), pages 2652-2658, 2014, AAAI Press. |
| [510] | Finite Integer Index of Pathwidth and Treewidth Parameterized and Exact Computation - 9th International Symposium, IPEC 2014, Wroclaw, Poland, September 10-12, 2014. Revised Selected Papers (Marek Cygan, Pinar Heggernes, eds.), volume 8894 of Lecture Notes in Computer Science, pages 258–269, 2014, Springer Verlag. |
| [509] | Faster Existential FO Model Checking on Posets Algorithms and Computation - 25th International Symposium, ISAAC 2014, Jeonju, Korea, December 15-17, 2014, Proceedings (Hee-Kap Ahn, Chan-Su Shin, eds.), volume 8889 of Lecture Notes in Computer Science, pages 441–451, 2014, Springer Verlag. |
| [508] | Parameterized Complexity Results for Agenda Safety in Judgment Aggregation Proceedings of ComSoc'14, Fifth International Workshop on Computational Social Choice Pittsburgh, Pennsylvania, June 23-25, 2014, pages 127–136, 2014. |
| [507] | Fixed-Parameter Tractable Reductions to SAT Theory and Applications of Satisfiability Testing - SAT 2014 - 17th International Conference, Held as Part of the Vienna Summer of Logic, VSL 2014, Vienna, Austria, July 14-17, 2014. Proceedings (Uwe Egly, Carsten Sinz, eds.), volume 8561 of Lecture Notes in Computer Science, pages 85-102, 2014, Springer Verlag. |
| [506] | The Parameterized Complexity of Reasoning Problems Beyond NP Principles of Knowledge Representation and Reasoning: Proceedings of the Fourteenth International Conference, KR 2014, Vienna, Austria, July 20-24, 2014 (Chitta Baral, Giuseppe De Giacomo, Thomas Eiter, eds.), pages 82–91, 2014, AAAI Press. |
| [505] | Subexponential Time Complexity of CSP with Global Constraints Principles and Practice of Constraint Programming - 20th International Conference, CP 2014, Lyon, France, September 8-12, 2014. Proceedings (Barry O'Sullivan, ed.), volume 8656 of Lecture Notes in Computer Science, pages 272-288, 2014, Springer Verlag. |
| [504] | Small Unsatisfiable Subsets in Constraint Satisfaction 26th IEEE International Conference on Tools with Artificial Intelligence, ICTAI 2014, Limassol, Cyprus, November 10-12, 2014, pages 429–436, 2014, IEEE. |
| [503] | Quantified Conjunctive Queries on Partially Ordered Sets Parameterized and Exact Computation - 9th International Symposium, IPEC 2014, Wroclaw, Poland, September 10-12, 2014. Revised Selected Papers (Marek Cygan, Pinar Heggernes, eds.), volume 8894 of Lecture Notes in Computer Science, pages 122–134, 2014, Springer Verlag. |
| [502] | Model checking existential logic on partially ordered sets Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), CSL-LICS '14, Vienna, Austria, July 14 - 18, 2014 (Thomas A. Henzinger, Dale Miller, eds.), pages 21:1–21:10, 2014, ACM. |
| [501] | The Complexity of Width Minimization for Existential Positive Queries Proc. 17th International Conference on Database Theory (ICDT), Athens, Greece, March 24-28, 2014., pages 235–244, 2014. |
| [500] | On the Kernelization Complexity of String Problems Computing and Combinatorics - 20th International Conference, COCOON 2014, Atlanta, GA, USA, August 4-6, 2014. Proceedings, pages 141–153, 2014. |
| [499] | Parameterized Algorithms to Preserve Connectivity Automata, Languages, and Programming - 41st International Colloquium, ICALP 2014, Copenhagen, Denmark, July 8-11, 2014, Proceedings, Part I, pages 800–811, 2014. |
| [498] | Heuristic Solution Approaches for the Two Dimensional Pre-Marshalling Problem Jun 2014, Master's thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms. Note: supervised by G. Raidl |
| [497] | Pfadsuche in einer Triangulation Reduction im Mammoth Massive Multiplayer Online Research Framework May 2014, Master's thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms. Note: supervised by G. Raidl |
| [496] | Finding Longest Common Subsequences by GPU-Based Parallel Ant Colony Optimization Feb 2014, Master's thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms. Note: supervised by G. Raidl |
| [495] | A Hybrid Algorithm for the Partition Coloring Problem Feb 2014, Master's thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms. Note: supervised by G. Raidl |
| [494] | Applying Ant Colony Optimization to the Periodic Vehicle Routing Problem with Time Windows Feb 2014, Master's thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms. Note: supervised by G. Raidl |
| [493] | Compendium of Parameterized Problems at Higher Levels of the Polynomial Hierarchy 2014, Technical report TR14-143, Electronic Colloquium on Computational Complexity (ECCC). |
| 2013 | |
| [492] | Proceedings of the 10th Metaheuristics International Conference (Hoong Chuin Lau, Günther R. Raidl, Patrick van Hentenryck, eds.), 2013. |
| [491] | 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 |
| [490] | Edge-weighted contact representations of planar graphs J. Graph Algorithms Appl., volume 17, number 4, pages 441–473, 2013. |
| [489] | 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 |
| [488] | Drawing Graphs and Maps with Curves (Dagstuhl Seminar 13151) Dagstuhl Reports, volume 3, number 4, pages 34–68, 2013. |
| [487] | Optimal 3D Angular Resolution for Low-Degree Graphs J. Graph Algorithms Appl., volume 17, number 3, pages 173–200, 2013. |
| [486] | Drawing Trees with Perfect Angular Resolution and Polynomial Area Discrete and Computational Geometry, volume 49, number 2, pages 157–182, 2013. |
| [485] | Parameterized Complexity Results for Exact Bayesian Network Structure Learning Journal Artificial Intelligence Research, volume 46, pages 263-302, 2013. |
| [484] | Satisfiability of acyclic and almost acyclic CNF formulas Theoretical Computer Science, volume 481, pages 85-99, 2013. |
| [483] | A Polynomial Kernel for Feedback Arc Set on Bipartite Tournaments Theory Comput. Syst., volume 53, number 4, pages 609–620, 2013. |
| [482] | Cops-and-robbers: remarks and problems Journal of Combinatorial Mathematics and Combinatorial Computing, volume 85, pages 141–159, 2013. |
| [481] | A unified approach to polynomial algorithms on graphs of bounded (bi-)rank-width Eur. J. Comb., volume 34, number 3, pages 680–701, 2013. |
| [480] | Better Algorithms for Satisfiability Problems for Formulas of Bounded Rank-width Fundam. Inform., volume 123, number 1, pages 59–76, 2013. |
| [479] | Polynomial space hardness without disjunction property Theor. Comput. Sci., volume 467, pages 1–11, 2013. |
| [478] | Generic expression hardness results for primitive positive formula comparison Inf. Comput., volume 222, pages 108–120, 2013. |
| [477] | 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. |
| [476] | 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. |
| [475] | 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. |
| [474] | 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. |
| [473] | 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. |
| [472] | 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. |
| [471] | 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. |
| [470] | 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. |
| [469] | 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. |
| [468] | 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. |
| [467] | 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. |
| [466] | 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. |
| [465] | 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 |
| [464] | Circular-Arc Cartograms IEEE Pacific Visualization Symposium (PacificVis'13), pages 1–8, 2013, IEEE. |
| [463] | 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. |
| [462] | 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. |
| [461] | 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. |
| [460] | 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. |
| [459] | Using Optimized Virtual Network Embedding for Network Dimensioning Proceedings of Networked Systems 2013, pages 118–125, 2013, IEEE. |
| [458] | 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. |
| [457] | 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. |
| [456] | 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. |
| [455] | Strict Confluent Drawing Graph Drawing (GD'13) (Stephen Wismath, Alexander Wolff, eds.), volume 8242 of LNCS, pages 352–363, 2013, Springer Berlin Heidelberg. |
| [454] | 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. |
| [453] | 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. |
| [452] | 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. |
| [451] | 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. |
| [450] | 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. |
| [449] | 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 |
| [448] | 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 |
| [447] | 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. |
| [446] | 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. |
| [445] | Backdoors to Abduction Proceedings of IJCAI 2013, the 23th International Joint Conference on Artificial Intelligence, August 3-9, 2013, Beijing, China, 2013. |
| [444] | 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. |
| [443] | 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. |
| [442] | 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. |