Full List of Publications
1080 results| [1080] | Algorithmic Extensions of Dirac's Theorem Chapter in , pages 406-416. |
| [1079] | Lossy Kernels for Hitting Subgraphs MFCS 2017. Note: To Appear |
| [1078] | On the Parameterized Complexity of Simultaneous Deletion Problems FSTTCS 2017. Note: To Appear |
| 2023 | |
| [1077] | MosaicSets: Embedding Set Systems into Grid Graphs IEEE Trans. Visualization and Computer Graphics, 2023. |
| [1076] | Untangling Circular Drawings: Algorithms and Complexity Comput. Geom. Theory Appl., volume 111, 2023. |
| [1075] | Circuit Minimization with QBF-Based Exact Synthesis Thirty-Seventh AAAI Conference on Artificial Intelligence, AAAI 2023, 2023, AAAI Press. Note: to appear |
| [1074] | Inconsistent Cores for ASP: The Perks and Perils of Non-Monotonicity Thirty-Seventh AAAI Conference on Artificial Intelligence, AAAI 2023, 2023, AAAI Press. Note: to appear |
| [1073] | A Structural Complexity Analysis of Synchronous Dynamical Systems Thirty-Seventh AAAI Conference on Artificial Intelligence, AAAI 2023, 2023, AAAI Press. Note: to appear |
| [1072] | A logic-based algorithmic meta-theorem for mim-width Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms (SODA 2023), 2023, SIAM. |
| [1071] | A Parameterized Theory of PAC Learning Thirty-Seventh AAAI Conference on Artificial Intelligence, AAAI 2023, 2023, AAAI Press. Note: to appear |
| [1070] | The Parameterized Complexity of Network Microaggregation Thirty-Seventh AAAI Conference on Artificial Intelligence, AAAI 2023, 2023, AAAI Press. Note: to appear |
| 2022 | |
| [1069] | 47th International Symposium on Mathematical Foundations of Computer Science, MFCS 2022, August 22-26, 2022, Vienna, Austria (Stefan Szeider, Robert Ganian, Alexandra Silva, eds.), volume 241 of LIPIcs, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. |
| [1068] | How to Find a Good Explanation for Clustering? Proceedings of the AAAI Conference on Artificial Intelligence, volume 36, number 4, pages 3904-3912, 6 2022. |
| [1067] | Multi-level Area Balancing of Clustered Graphs IEEE Trans. Visualization and Computer Graphics, volume 28, number 7, pages 2682–2696, 2022. |
| [1066] | Edge-Path Bundling: A Less Ambiguous Edge Bundling Approach IEEE Trans. Visualization and Computer Graphics, volume 28, number 1, pages 313–323, 2022. |
| [1065] | Multicriteria Optimization for Dynamic Demers Cartograms IEEE Trans. Visualization and Computer Graphics, volume 28, number 6, pages 2376–2387, 2022. Note: TVCG Replicability Stamp |
| [1064] | Recognizing Weighted and Seeded Disk Graphs J. Computational Geometry, volume 13, number 1, pages 327–376, 2022. |
| [1063] | Twin-width and generalized coloring numbers Discrete Mathematics, volume 345, number 3, pages 112746, 2022. |
| [1062] | Mixed Labeling: Integrating Internal and External Labels IEEE Trans. Visualization and Computer Graphics, volume 28, number 4, pages 1848–1861, 2022. |
| [1061] | Shape-Guided Mixed Metro Map Layout Computer Graphics Forum, volume 41, number 7, pages 495–506, 2022. |
| [1060] | An Algorithmic Study of Fully Dynamic Independent Sets for Map Labeling ACM J. Experimental Algorithmics, volume 27, pages 1.8:1–1.8:36, 2022. |
| [1059] | Parameterized Algorithms for Queue Layouts J. Graph Algorithms Appl., volume 26, number 3, pages 335–352, 2022. |
| [1058] | Parameterized Algorithms for Queue Layouts J. Graph Algorithms Appl., 2022. Note: to appear |
| [1057] | An Efficient Algorithm for Counting Markov Equivalent DAGs Artificial Intelligence, 2022. |
| [1056] | Threshold Treewidth and Hypertree Width Journal of Artificial Intelligence Research, volume 74, pages 1687–1713, 2022. |
| [1055] | Group Activity Selection with Few Agent Types Algorithmica, 2022. Note: to appear |
| [1054] | Algorithmic Applications of Tree-Cut Width SIAM J. Discrete Math., volume 36, number 4, pages 2635–2666, 2022. Note: to appear |
| [1053] | Sum-of-Products with Default Values: Algorithms and Complexity Results Journal of Artificial Intelligence Research, volume 33, pages 535–552, 2022. |
| [1052] | Preface: Ninth workshop on graph classes, optimization, and Width Parameters, Vienna, Austria Discr. Appl. Math., volume 312, pages 1–2, 2022. |
| [1051] | SAT Backdoors: Depth Beats Size (Shiri Chechik, Gonzalo Navarro, Eva Rotenberg, Grzegorz Herman, eds.), volume 244 of Leibniz International Proceedings in Informatics (LIPIcs), pages 46:1–46:18, 2022, Schloss Dagstuhl – Leibniz-Zentrum für Informatik. |
| [1050] | Turbocharging Heuristics for Weak Coloring Numbers CoRR, volume abs/2203.03358, 2022. |
| [1049] | Removing Popular Faces in Curve Arrangements CoRR, volume abs/2202.12175, 2022. |
| [1048] | Finding a Battleship of Uncertain Shape CoRR, volume abs/2202.08747, 2022. |
| [1047] | On Covering Segments with Unit Intervals SIAM J. Discrete Math., 2022. Note: to appear |
| [1046] | A Relative Value Function Based Learning Beam Search for Longest Common Subsequence Problems Chapter in Extended Abstracts of the 18th International Conference on Computer Aided Systems Theory – EUROCAST 2022 (Alexis Quesada-Arencibia, others, eds.), pages 22–23, 2022. |
| [1045] | Fine-grained Complexity of Partial Minimum Satisfiability Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence, IJCAI-22 (Lud De Raedt, ed.), pages 1774–1780, 7 2022, International Joint Conferences on Artificial Intelligence Organization. Note: Main Track |
| [1044] | A Learning Large Neighborhood Search for the Staff Rerostering Problem Integration of Constraint Programming, Artificial Intelligence, and Operations Research – CPAIOR 2022 (Pierre Schaus, ed.), volume 13292 of LNCS, pages 300–317, 2022, Springer. |
| [1043] | Planarizing Graphs and their Drawings by Vertex Splitting Graph Drawing and Network Visualization (GD'22) (Patrizio Angelini, Reinhard von Hanxleden, eds.), 2022, Springer. |
| [1042] | A Beam Search for the Shortest Common Supersequence Problem Guided by an Approximate Expected Length Calculation Evolutionary Computation in Combinatorial Optimization – EvoCOP 2022 (Leslie Pérez Cáceres, Sébastien Verel, eds.), volume 13222 of LNCS, pages 127–142, 2022, Springer. |
| [1041] | A Relative Value Function Based Learning Beam Search for the Longest Common Subsequence Problem Computer Aided Systems Theory – EUROCAST 2022 (Roberto Moreno-Díaz, Franz Pichler, Alexis Quesada-Arencibia, eds.), 2022, Springer. Note: to appear |
| [1040] | Learning Beam Search: Utilizing Machine Learning to Guide Beam Search for Solving Combinatorial Optimization Problems Machine Learning, Optimization, and Data Science, LOD 2021 (Giuseppe Nicosia, Varun Ojha, Emanuele La Malfa, Gabriele La Malfa, Giorgio Jansen, Panos M. Pardalos, Giovanni Giuffrida, Renato Umeton, eds.), volume 13164 of LNCS, pages 283–298, 2022, Springer. |
| [1039] | On Computing Optimal Linear Diagrams Diagrammatic Representation and Inference (DIAGRAMS'22) (Valeria Giardino, Sven Linker, Richard Burns, Francesco Bellucci, Jean-Michel Boucheix, Petrucio Viana, eds.), volume 13462 of LNAI, pages 20–36, 2022, Springer. |
| [1038] | Multidimensional Manhattan Preferences Theoretical Informatics (LATIN'22) (Armando Castañeda, Francisco Rodríguez-Henríquez, eds.), volume 13568 of LNCS, pages 273–289, 2022, Springer. |
| [1037] | Minimum Link Fencing Algorithms and Computation (ISAAC'22), 2022, Schloss Dagstuhl – Leibniz-Zentrum für Informatik. Note: To appear. |
| [1036] | On the Complexity of the Storyplan Problem Graph Drawing and Network Visualization (GD'22) (Patrizio Angelini, Reinhard von Hanxleden, eds.), 2022, Springer. |
| [1035] | Learning Large Bayesian Networks with Expert Constraints 38th Conference on Uncertainty in Artificial Intelligence (UAI 2022), Eindhoven, Netherlands, August 1–5, 2022 (James Cussens, Kun Zhang, eds.), pages 180:1592–1601, 2022. |
| [1034] | Preface: 47th International Symposium on Mathematical Foundations of Computer Science, MFCS 2022, August 22-26, 2022, Vienna, Austria 47th International Symposium on Mathematical Foundations of Computer Science, MFCS 2022, August 22-26, 2022, Vienna, Austria, volume 241 of LIPIcs, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. |
| [1033] | A SAT Approach to Twin-Width Proceedings of ALENEX 2022, the 24nd SIAM Symposium on Algorithm Engineering and Experiments (Cynthia A. Phillips, Bettina Speckmann, eds.), pages 67–77, 2022, Society for Industrial and Applied Mathematics (SIAM). |
| [1032] | A Beam Search for the Shortest Common Supersequence Problem Guided by an Approximate Expected Length Calculation Evolutionary Computation in Combinatorial Optimization - 22nd European Conference, EvoCOP 2022, Held as Part of EvoStar 2022, Madrid, Spain, April 20-22, 2022, Proceedings (Leslie Pérez Cáceres, Sébastien Vérel, eds.), volume 13222 of Lecture Notes in Computer Science, pages 127–142, 2022, Springer Verlag. |
| [1031] | A SAT Attack on Rota’s Basis Conjecture 25th International Conference on Theory and Applications of Satisfiability Testing, SAT 2022, August 2-5, 2022, Haifa, Israel (Kuldeep S. Meel, Ofer Strichman, eds.), volume 236 of LIPIcs, pages 4:1–4:18, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. |
| [1030] | The Complexity of Temporal Vertex Cover in Small-Degree Graphs Proceeding of AAAI-22, the Thirty-Sixth AAAI Conference on Artificial Intelligence, 2022, AAAI Press. Note: to appear |
| [1029] | Parameterised Partially-Predrawn Crossing Number 38th International Symposium on Computational Geometry, SoCG 2022, June 7-10, 2022, Berlin, Germany, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. Note: to appear |
| [1028] | Slim Tree-Cut Width 17th International Symposium on Parameterized and Exact Computation (IPEC 2022), 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. Note: to appear |
| [1027] | Hedonic Diversity Games: A Complexity Picture with More than Two Colors Proceeding of AAAI-22, the Thirty-Sixth AAAI Conference on Artificial Intelligence, 2022, AAAI Press. Note: to appear |
| [1026] | The Complexity of k-Means Clustering when Little is Known 39th Thirty-ninth International Conference on Machine Learning (ICML 2022), 2022. Note: to appear |
| [1025] | The Fine-Grained Complexity of Graph Homomorphism Parameterized by Clique-Width 49th International Colloquium on Automata, Languages, and Programming, ICALP 2022, July 4-8, 2022, Paris, France, 2022. Note: to appear |
| [1024] | Weighted Model Counting with Twin-Width 25th International Conference on Theory and Applications of Satisfiability Testing, SAT 2022, August 2-5, 2022, Haifa, Israel (Kuldeep S. Meel, Ofer Strichman, eds.), volume 236 of LIPIcs, pages 15:1–15:17, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. |
| [1023] | Longest Cycle above Erd\Hos–Gallai Bound 30th Annual European Symposium on Algorithms (ESA 2022), 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. Note: to appear |
| [1022] | Detours in Directed Graphs 39th International Symposium on Theoretical Aspects of Computer Science (STACS 2022) (Petra Berenbrink, Benjamin Monmege, eds.), volume 219 of Leibniz International Proceedings in Informatics (LIPIcs), pages 29:1–29:16, 2022, Schloss Dagstuhl – Leibniz-Zentrum für Informatik. |
| [1021] | A Unifying Framework for Characterizing and Computing Width Measures 13th Innovations in Theoretical Computer Science Conference, ITCS 2022, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. |
| [1020] | Finding a Cluster in Incomplete Data 30th Annual European Symposium on Algorithms (ESA 2022) (Shiri Chechik, Gonzalo Navarro, Eva Rotenberg, Grzegorz Herman, eds.), volume 244 of Leibniz International Proceedings in Informatics (LIPIcs), pages 47:1–47:14, 2022, Schloss Dagstuhl – Leibniz-Zentrum für Informatik. |
| [1019] | Tractable Abstract Argumentation via Backdoor-Treewidth Thirty-Sixth AAAI Conference on Artificial Intelligence, AAAI 2022, Thirty-Fourth Conference on Innovative Applications of Artificial Intelligence, IAAI 2022, The Twelveth Symposium on Educational Advances in Artificial Intelligence, EAAI 2022 Virtual Event, February 22 - March 1, 2022, pages 5608–5615, 2022, AAAI Press. |
| [1018] | CSP Beyond Tractable Constraint Languages 28th International Conference on Principles and Practice of Constraint Programming, CP 2022, July 31 to August 8, 2022, Haifa, Israel (Christine Solnon, ed.), volume 235 of LIPIcs, pages 20:1–20:17, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. |
| [1017] | The Complexity of Envy-Free Graph Cutting Proceeding of IJCAI-22, the 31st International Joint Conference on Artificial Intelligence, 2022. Note: to appear |
| [1016] | Towards Uniform Certification in QBF 39th International Symposium on Theoretical Aspects of Computer Science, STACS 2022, March 15-18, 2022, Marseille, France (Virtual Conference) (Petra Berenbrink, Benjamin Monmege, eds.), volume 219 of LIPIcs, pages 22:1–22:23, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. |
| [1015] | Testing Upward Planarity of Partial 2-Trees 30th International Symposium on Graph Drawing and Network Visualization, GD 2022, September 13-16, 2022, Tokyo, Japan, 2022, Springer Verlag. Note: to appear |
| [1014] | Parameterized Algorithms for Upward Planarity 38th International Symposium on Computational Geometry, SoCG 2022, June 7-10, 2022, Berlin, Germany, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. Note: to appear |
| [1013] | QCDCL with Cube Learning or Pure Literal Elimination - What is Best? Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence, IJCAI 2022, Vienna, Austria, 23-29 July 2022 (Luc De Raedt, ed.), pages 1781–1787, 2022, ijcai.org. Note: Distinguished Paper Award |
| [1012] | Should Decisions in QCDCL Follow Prefix Order? 25th International Conference on Theory and Applications of Satisfiability Testing, SAT 2022, August 2-5, 2022, Haifa, Israel (Kuldeep S. Meel, Ofer Strichman, eds.), volume 236 of LIPIcs, pages 11:1–11:19, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. |
| [1011] | FPT Approximation for Fair Minimum-Load Clustering 17th International Symposium on Parameterized and Exact Computation (IPEC 2022), 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. Note: to appear |
| [1010] | Lossy Kernelization of Same-Size Clustering Computer Science – Theory and Applications: 17th International Computer Science Symposium in Russia, CSR 2022, Virtual Event, June 29 – July 1, 2022, Proceedings, pages 96–114, 2022, Springer-Verlag. |
| [1009] | Edge-Cut Width: An Algorithmically Driven Analogue of Treewidth Based on Edge Cuts Proceeding of the 48th International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2022), 2022. Note: to appear |
| [1008] | Bounding and Computing Obstacle Numbers of Graphs 30th Annual European Symposium on Algorithms (ESA 2022), 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. Note: to appear |
| [1007] | Model Checking on Interpretations of Classes of Bounded Local Cliquewidth Proceedings of the 37th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS 2022), 2022, Association for Computing Machinery. |
| [1006] | Treelike Decompositions for Transductions of Sparse Graphs Proceedings of the 37th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS 2022), 2022, Association for Computing Machinery. |
| [1005] | Combinatorial and Algorithmic Aspects of Monadic Stability 2022, arXiv. |
| [1004] | Indiscernibles and Wideness in Monadically Stable and Monadically NIP Classes 2022, arXiv. |
| [1003] | A Matheuristic for Battery Exchange Station Location Planning for Electric Scooters jan 2022, Master's thesis, TU Wien, Institute of Logic and Computation. Note: supervised by G. Raidl and T. Jatschka |
| [1002] | Are Hitting Formulas Hard for Resolution? 2022, Technical report abs/2206.15225, CoRR. |
| 2021 | |
| [1001] | External Labeling: Fundamental Concepts and Algorithmic Techniques 2021, Morgan & Claypool. |
| [1000] | On the Readability of Abstract Set Visualizations IEEE Trans. Visualization and Computer Graphics, volume 27, number 6, pages 2821–2832, 2021. |
| [999] | On Families of Planar DAGs with Constant Stack Number CoRR, volume abs/2107.13658, 2021. |
| [998] | Solving the Longest Common Subsequence Problem Concerning Non-Uniform Distributions of Letters in Input Strings Mathematics, volume 9, number 13, 2021. |
| [997] | Multivalued Decision Diagrams for Prize-Collecting Job Sequencing with One Common and Multiple Secondary Resources Annals of Operations Research, volume 302, pages 407–531, 2021. |
| [996] | Labeling Nonograms: Boundary Labeling for Curve Arrangements Comput. Geom. Theory Appl., volume 98, pages 101791, 2021. |
| [995] | MetroSets: Visualizing Sets as Metro Maps IEEE Trans. Visualization and Computer Graphics, volume 27, number 2, pages 1257–1267, 2021. |
| [994] | Smart Charging of Electric Vehicles Considering SOC-Dependent Maximum Charging Powers Energies, volume 14, number 22, 2021. |
| [993] | A General Cooperative Optimization Approach for Distributing Service Points in Mobility Applications Algorithms, volume 14, number 8, 2021. |
| [992] | A*-based Construction of Decision Diagrams for a Prize-Collecting Scheduling Problem Computers & Operations Research, volume 126, number 105125, 2021. Note: previous technical report version at https://www.ac.tuwien.ac.at/files/tr/ac-tr-18-011a.pdf |
| [991] | A* Search for Prize-Collecting Job Sequencing with One Common and Multiple Secondary Resources Annals of Operations Research, volume 302, pages 477–501, 2021. Note: previous technical report version at https://www.ac.tuwien.ac.at/files/tr/ac-tr-19-002.pdf |
| [990] | Parameterized Complexity in Graph Drawing (Dagstuhl Seminar 21293) Dagstuhl Reports, volume 11, number 6, pages 82–123, 2021. |
| [989] | ClusterSets: Optimizing Planar Clusters in Categorical Point Data Computer Graphics Forum, volume 40, number 3, pages 471–481, 2021. |
| [988] | Measuring what matters: A hybrid approach to dynamic programming with treewidth J. Comput. Syst. Sci., volume 121, pages 57–75, 2021. |
| [987] | Solving Longest Common Subsequence Problems via a Transformation to the Maximum Clique Problem Computers & Operations Research, volume 125, number 105089, 2021. Note: previous technical report version at https://www.ac.tuwien.ac.at/files/tr/ac-tr-20-003.pdf |
| [986] | Geometric Planar Networks on Bichromatic Collinear Points Theoretical Computer Science, volume 895, pages 124–136, 2021. |
| [985] | Finding the Hardest Formulas for Resolution Journal of Artificial Intelligence Research, volume 72, pages 69–97, 2021. Note: Conference Award Track, best paper CP 2020 |
| [984] | New Width Parameters for SAT and Sharp-SAT Artificial Intelligence, volume 295, pages 103460, 2021. |
| [983] | On Structural Parameterizations of the Edge Disjoint Paths Problem Algorithmica, volume 83, number 6, pages 1605–1637, 2021. |
| [982] | The Power of Cut-Based Parameters for Computing Edge-Disjoint Paths Algorithmica, volume 83, number 2, pages 726–752, 2021. |
| [981] | On Structural Parameterizations of the Bounded-Degree Vertex Deletion Problem Algorithmica, volume 83, number 1, pages 297–336, 2021. |
| [980] | On Strict (Outer-)Confluent Graphs J. Graph Algorithms Appl., 2021. |
| [979] | Parameterized k-Clustering: Tractability island Journal of Computer and System Sciences, volume 117, pages 50 - 74, 2021. |
| [978] | The complexity landscape of decompositional parameters for ILP: Programs with Few Global Variables and Constraints Artificial Intelligence, 2021. |
| [977] | Strong (D)QBF Dependency Schemes via Implication-free Resolution Paths Electron. Colloquium Comput. Complex., pages 135, 2021. |
| [976] | Towards a Polynomial Kernel for Directed Feedback Vertex Set Algorithmica, volume 83, number 5, pages 1201–1221, 2021. |
| [975] | Fixed-Parameter Tractability Chapter in Handbook of Satisfiability, 2nd Edition (Armin Biere, Marijn Heule, Hans van Maaren, Toby Walsh, eds.), pages 693–736, 2021, IOS Press. |
| [974] | Stable Visual Summaries for Trajectory Collections Pacific Visualization Symposium (PacificVis'21), pages 61–70, 2021, IEEE. |
| [973] | Layered Area-Proportional Rectangle Contact Representation Graph Drawing and Network Visualization (GD'21) (Helen Purchase, Ignaz Rutter, eds.), volume 12868 of LNCS, pages 318–326, 2021, Springer. |
| [972] | A Large Neighborhood Search for a Cooperative Optimization Approach to Distribute Service Points in Mobility Applications Proc. of the 8th Int. Conf. on Metaheuristics and Nature Inspired Computing (META 2021), 2021. Note: to appear |
| [971] | Learning Surrogate Functions for the Short-Horizon Planning in Same-Day Delivery Problems 17th International Conference on Integration of Constraint Programming, Artificial Intelligence, and Operations Research (CPAIOR'21) (Peter J. Stuckey, ed.), volume 12735 of LNCS, pages 72–88, 2021, Springer. |
| [970] | Driver Shift Planning for an Online Store with Short Delivery Times Proceedings of the 2nd International Conference on Industry 4.0 and Smart Manufacturing (ISM 2020), volume 180 of Procedia Computer Science, pages 517–524, 2021. |
| [969] | Route Duration Prediction in a Stochastic and Dynamic Vehicle Routing Problem with Short Delivery Deadlines Proceedings of the 2nd International Conference on Industry 4.0 and Smart Manufacturing (ISM 2020), volume 180 of Procedia Computer Science, pages 366-370, 2021. |
| [968] | Lacon- and Shrub-Decompositions: A New Characterization of First-Order Transductions of Bounded Expansion Classes 2021 36th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), pages 1-13, 2021. Note: distinguished paper |
| [967] | Learning Surrogate Functions for the Short-Horizon Planning in Same-Day Delivery Problems 17th International Conference on Integration of Constraint Programming, Artificial Intelligence, and Operations Research (CPAIOR'21) (Peter J. Stuckey, ed.), volume 12735 of LNCS, pages 283–298, 2021, Springer. |
| [966] | Disjoint Box Covering in a Rectilinear Polygon European Workshop on Computational Geometry (EuroCG'21), pages 71:1–71:7, 2021. |
| [965] | Untangling Circular Drawings: Algorithms and Complexity Algorithms and Computation (ISAAC'21) (Hee-Kap Ahn, Kunihiko Sadakane, eds.), volume 212 of LIPIcs, pages 19:1–19:17, 2021, Schloss Dagstuhl – Leibniz-Zentrum für Informatik. |
| [964] | Unit Disk Representations of Embedded Trees, Outerplanar and Multi-Legged Graphs Graph Drawing and Network Visualization (GD'21) (Helen Purchase, Ignaz Rutter, eds.), volume 12868 of LNCS, pages 304–317, 2021, Springer. |
| [963] | Balanced Independent and Dominating Sets on Colored Interval Graphs Theory and Practice of Computer Science (SOFSEM'21) (Tomáš Bureš, Riccardo Dondi, Johann Gamper, Giovanna Guerrini, Tomasz Jurdziński, Claus Pahl, Florian Sikora, Prudence Wong, eds.), volume 12607 of LNCS, pages 89–103, 2021, Springer. |
| [962] | Worbel: Aggregating Point Labels into Word Clouds Advances in Geographic Information Systems (SIGSPATIAL'21), pages 256–267, 2021, ACM. |
| [961] | On the Upward Book Thickness Problem: Combinatorial and Complexity Results Graph Drawing and Network Visualization (GD'21) (Helen Purchase, Ignaz Rutter, eds.), volume 12868 of LNCS, pages 242–256, 2021, Springer. |
| [960] | Learning fast-inference Bayesian networks Proceedings of NeurIPS 2021, the Thirty-fifth Conference on Neural Information Processing Systems (M. Ranzato, A. Beygelzimer, K. Nguyen, P.S. Liang, J.W. Vaughan, Y. Dauphin, eds.), pages 17852–17863, 2021. |
| [959] | Turbocharging Treewidth-Bounded Bayesian Network Structure Learning Proceeding of AAAI-21, the Thirty-Fifth AAAI Conference on Artificial Intelligence, pages 3895–3903, 2021, AAAI Press. |
| [958] | Computing Optimal Hypertree Decompositions with SAT Proceeding of IJCAI-21, the 30th International Joint Conference on Artificial Intelligence (Zhi-Hua Zhou, ed.), 2021. |
| [957] | SAT-based Decision Tree Learning for Large Data Sets Proceeding of AAAI-21, the Thirty-Fifth AAAI Conference on Artificial Intelligence, pages 3904–3912, 2021, AAAI Press. |
| [956] | Certified DQBF Solving by Definition Extraction Theory and Applications of Satisfiability Testing - SAT 2021 - 24th International Conference, Barcelona, Spain, July 5-9, 2021, Proceedings (Chu-Min Li, Felip Manyà, eds.), volume 12831 of Lecture Notes in Computer Science, pages 499–517, 2021, Springer Verlag. |
| [955] | Finding the Hardest Formulas for Resolution (Extended Abstract) Proceeding of IJCAI-21, the 30th International Joint Conference on Artificial Intelligence (Zhi-Hua Zhou, ed.), pages 4814–4818, 2021. Note: Sister Conferences Best Papers |
| [954] | Parameterized Complexity of Small Decision Tree Learning Proceeding of AAAI-21, the Thirty-Fifth AAAI Conference on Artificial Intelligence, pages 6454–6462, 2021, AAAI Press. |
| [953] | Backdoor DNFs Proceeding of IJCAI-2021, the 30th International Joint Conference on Artificial Intelligence (Zhi-Hua Zhou, ed.), pages 1403–1409, 2021. |
| [952] | Proof Complexity of Symbolic QBF Reasoning Theory and Applications of Satisfiability Testing - SAT 2021 - 24th International Conference, Barcelona, Spain, July 5-9, 2021, Proceedings (Chu-Min Li, Felip Manyà, eds.), volume 12831 of Lecture Notes in Computer Science, pages 399–416, 2021, Springer Verlag. |
| [951] | SAT Modulo Symmetries for Graph Generation Proceeings of CP 2021, the 27th International Conference on Principles and Practice of Constraint Programming (Laurent D. Michel, ed.), pages 39:1–-39:17, 2021, Dagstuhl Publishing. |
| [950] | Computing Kemeny Rankings from d-Euclidean Preferences Algorithmic Decision Theory - 7th International Conference, ADT 2021, Toulouse, France, November 3-5, 2021, Proceedings, volume 13023 of Lecture Notes in Computer Science, pages 147–161, 2021, Springer Verlag. |
| [949] | Engineering an Efficient Boolean Functional Synthesis Engine IEEE/ACM International Conference On Computer Aided Design, ICCAD 2021, Munich, Germany, November 1-4, 2021, pages 1–9, 2021, IEEE. |
| [948] | The Complexity of Bayesian Network Learning: Revisiting the Superstructure Proceedings of NeurIPS 2021, the Thirty-fifth Conference on Neural Information Processing Systems, 2021. Note: to appear |
| [947] | The Complexity of Object Association in Multiple Object Tracking Thirty-Fifth AAAI Conference on Artificial Intelligence, AAAI 2021, Virtual Event, February 2-9, 2021, pages 1388–1396, 2021, AAAI Press. |
| [946] | Crossing-Optimal Extension of Simple Drawings 48th International Colloquium on Automata, Languages, and Programming, ICALP 2021, July 12-16, 2021, Glasgow, Scotland (Virtual Conference) (Nikhil Bansal, Emanuela Merelli, James Worrell, eds.), volume 198 of LIPIcs, pages 72:1–72:17, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. |
| [945] | The Parameterized Complexity of Clustering Incomplete Data Proceeding of AAAI-21, the Thirty-Fifth AAAI Conference on Artificial Intelligence, pages 7296–7304, 2021, AAAI Press. |
| [944] | EPTAS for \emphk-means Clustering of Affine Subspaces Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, SODA 2021, Virtual Conference, January 10 - 13, 2021 (Dániel Marx, ed.), pages 2649–2659, 2021, SIAM. |
| [943] | Approximate Evaluation of First-Order Counting Queries Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA 2021), 2021, SIAM. |
| [942] | The Parameterized Complexity of Connected Fair Division Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence, IJCAI 2021, Virtual Event / Montreal, Canada, 19-27 August 2021 (Zhi-Hua Zhou, ed.), pages 139–145, 2021, ijcai.org. |
| [941] | Graphs with at most two moplexes Proceedings of the XI Latin and American Algorithms, Graphs and Optimization Symposium, LAGOS 2021, 2021, Elsevier. |
| [940] | Davis and Putnam Meet Henkin: Solving DQBF with Resolution Theory and Applications of Satisfiability Testing - SAT 2021 - 24th International Conference, Barcelona, Spain, July 5-9, 2021, Proceedings (Chu-Min Li, Felip Manyà, eds.), volume 12831 of Lecture Notes in Computer Science, pages 30–46, 2021, Springer Verlag. |
| [939] | On Coresets for Fair Clustering in Metric and Euclidean Spaces and Their Applications 48th International Colloquium on Automata, Languages, and Programming, ICALP 2021, July 12-16, 2021, Glasgow, Scotland (Virtual Conference), 2021. |
| [938] | Parameterized Complexity of Feature Selection for Categorical Data Clustering 46th International Symposium on Mathematical Foundations of Computer Science (MFCS 2021) (Filippo Bonchi, Simon J. Puglisi, eds.), volume 202 of Leibniz International Proceedings in Informatics (LIPIcs), pages 14:1–14:14, 2021, Schloss Dagstuhl – Leibniz-Zentrum für Informatik. |
| [937] | Worbel: Aggregating Point Labels into Word Clouds Proceedings of the International Conference on Advances in Geographic Information Systems 2021 (ACM SIGSPATIAL 2021), 2021. |
| [936] | A Learning Large Neighborhood Search for the Staff Rerostering Problem oct 2021, Master's thesis, TU Wien, Institute of Logic and Computation. Note: supervised by G. Raidl and E. Rönnberg and M. Huber |
| [935] | Computational Methods for Fleet Scheduling in E-Mobility aug 2021, Master's thesis, TU Wien, Institute of Logic and Computation. Note: supervised by G. Raidl |
| [934] | Scheduling the Charging of Electric Vehicles with SOC-Dependent Maximum Charging Power apr 2021, Master's thesis, TU Wien, Institute of Logic and Computation. Note: supervised by G. Raidl and T. Jatschka |
| [933] | Randomized Construction Approaches to the Traveling Tournament Problem using Lower Bound Based Heuristics mar 2021, Master's thesis, TU Wien, Institute of Logic and Computation. Note: supervised by G. Raidl and N. Frohner |
| 2020 | |
| [932] | An Iterative Time-Bucket Refinement Algorithm for a High-Resolution Resource-Constrained Project Scheduling Problem International Transactions in Operational Research, jan 2020. |
| [931] | A Survey on Transit Map Layout – from Design, Machine, and Human Perspectives Computer Graphics Forum, volume 39, number 3, pages 619–646, 2020. |
| [930] | A Lower Bound for the Smallest Uniquely Hamiltonian Planar Graph with Minimum Degree Three Applied Mathematics and Computation, volume 380, number 125233, 2020. |
| [929] | A Model for Finding Transition-Minors Discrete Applied Mathematics, volume 228, pages 242–264, 2020. |
| [928] | A Unified Model and Algorithms for Temporal Map Labeling Algorithmica, volume 82, pages 2709–2736, 2020. |
| [927] | Placing Labels in Road Maps: Algorithms and Complexity Algorithmica, volume 82, pages 1881–1908, 2020. |
| [926] | Route Schematization with Landmarks J. Spatial Information Science, volume 21, 2020. |
| [925] | Finding Longest Common Subsequences: New anytime A$^*$ Search Results Applied Soft Computing, volume 95, number 106400, 2020. |
| [924] | An A* Search Algorithm for the Constrained Longest Common Subsequence Problem Information Processing Letters, volume 166, number 106041, 2020. Note: previous technical report version at https://www.ac.tuwien.ac.at/files/tr/ac-tr-20-004.pdf |
| [923] | Anytime Algorithms for the Longest Common Palindromic Subsequence Problem Computers & Operations Research, volume 114, pages 104827, 2020, Elsevier. |
| [922] | Parameterized Algorithms for Book Embedding Problems J. Graph Algorithms Appl., volume 24, number 4, pages 603–620, 2020. |
| [921] | Using decomposition-parameters for QBF: Mind the prefix! J. Comput. Syst. Sci., volume 110, pages 1–21, 2020. |
| [920] | On Existential MSO and its Relation to ETH ACM Transactions on Computation Theory, volume 12, number 4, pages 22:1–22:32, 2020. |
| [919] | Foreword: Eighth Workshop on Graph Classes, Optimization, and Width Parameters, Toronto, Ontario, Canada Discr. Appl. Math., volume 278, pages 1–2, 2020. |
| [918] | Complexity of independency and cliquy trees Discr. Appl. Math., volume 272, pages 2–15, 2020. |
| [917] | Crossing Layout in Non-planar Graphs Chapter in Beyond Planar Graphs (Seok-Hee Hong, Takeshi Tokuyama, eds.), pages 187–209, 2020, Springer Nature Singapore. |
| [916] | The Turing Test for Graph Drawing Algorithms Graph Drawing and Network Visualization (GD'20) (David Auber, Pavel Valtr, eds.), volume 12590 of LNCS, pages 466–481, 2020, Springer. |
| [915] | 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. |
| [914] | Labeling Nonograms European Workshop on Computational Geometry (EuroCG'20), pages 71:1–71:8, 2020. |
| [913] | 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. |
| [912] | Distributing Battery Swapping Stations for Electric Scooters in an Urban Area Optimization and Applications, Proceedings of OPTIMA 2020 – XI International Conference Optimization and Applications (Nicholas Olenev, Yuri Evtushenko, Michael Khachay, Vlasta Malkova, eds.), volume 12422 of LNCS, pages 150–165, 2020, Springer. |
| [911] | 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. |
| [910] | 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. |
| [909] | 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. |
| [908] | 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 2020: Volume I (Patrick De Causmaecker, Ender Özcan, Greet Vanden Berghe, eds.), 2020. |
| [907] | A Beam Search Approach to the Traveling Tournament Problem Evolutionary Computation in Combinatorial Optimization – 20th European Conference, EvoCOP 2020 (Luís Paquete, Christine Zarges, eds.), volume 12102 of LNCS, pages 67–82, 2020, Springer. |
| [906] | 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. |
| [905] | 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. |
| [904] | 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. |
| [903] | 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. |
| [902] | On Solving a Generalized Constrained Longest Common Subsequence Problem Proceedings of OPTIMA 2020 – XI International Conference Optimization and Applications (Nicholas Olenev, Yuri Evtushenko, Michael Khachay, Vlasta Malkova, eds.), volume 12422 of LNCS, pages 55–79, 2020, Springer. |
| [901] | 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. |
| [900] | 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. |
| [899] | Balanced Independent and Dominating Sets on Colored Interval Graphs European Workshop on Computational Geometry (EuroCG'20), pages 66:1–66:6, 2020. |
| [898] | Parameterized Algorithms for Queue Layouts Graph Drawing and Network Visualization (GD'20) (David Auber, Pavel Valtr, eds.), volume 12590 of LNCS, pages 40–54, 2020, Springer. |
| [897] | 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. |
| [896] | 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. |
| [895] | 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. |
| [894] | 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. |
| [893] | 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. |
| [892] | 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. |
| [891] | 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. |
| [890] | Computing Optimal Hypertree Decompositions Proceedings of ALENEX 2020, the 22nd SIAM Symposium on Algorithm Engineering and Experiments (Guy Blelloch, Irene Finocchi, eds.), pages 1–11, 2020, Society for Industrial and Applied Mathematics (SIAM). |
| [889] | 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 |
| [888] | 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. |
| [887] | 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. |
| [886] | 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. |
| [885] | 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. |
| [884] | An Efficient Algorithm for Counting Markov Equivalent DAGs The Thirty-Fourth AAAI Conference on Artificial Intelligence, AAAI 2020, New York, NY, USA, February 7-12, 2020, pages 10136–10143, 2020, AAAI Press. |
| [883] | The Complexity Landscape of Resource-Constrained Scheduling Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence, IJCAI 2020 (Christian Bessiere, ed.), pages 1741–1747, 2020, ijcai.org. |
| [882] | Building Large k-Cores from Sparse Graphs 45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020) (Javier Esparza, Daniel Kráľ, eds.), volume 170 of Leibniz International Proceedings in Informatics (LIPIcs), pages 35:1–35:14, 2020, Schloss Dagstuhl–Leibniz-Zentrum für Informatik. |
| [881] | Low-Rank Binary Matrix Approximation in Column-Sum Norm Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2020) (Jarosław Byrka, Raghu Meka, eds.), volume 176 of Leibniz International Proceedings in Informatics (LIPIcs), pages 32:1–32:18, 2020, Schloss Dagstuhl–Leibniz-Zentrum für Informatik. |
| [880] | Towards Faster Reasoners by Using Transparent Huge Pages Principles and Practice of Constraint Programming - 26th International Conference, CP 2020, Louvain-la-Neuve, Belgium, September 7-11, 2020, Proceedings, volume 12333 of Lecture Notes in Computer Science, pages 304–322, 2020, Springer Verlag. |
| [879] | 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. |
| [878] | 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. |
| [877] | Solving the Steiner Tree Problem with few Terminals 32nd IEEE International Conference on Tools with Artificial Intelligence, ICTAI 2020, Baltimore, MD, USA, November 9-11, 2020, pages 293–300, 2020, IEEE. |
| [876] | Parameterized Complexity of Envy-Free Resource Allocation in Social Networks The Thirty-Fourth AAAI Conference on Artificial Intelligence, AAAI 2020, New York, NY, USA, February 7-12, 2020, pages 7135–7142, 2020, AAAI Press. |
| [875] | Extending Nearly Complete 1-Planar Drawings in Polynomial Time 45th International Symposium on Mathematical Foundations of Computer Science, MFCS 2020, August 24-28, 2020, Prague, Czech Republic (Javier Esparza, Daniel Král', eds.), volume 170 of LIPIcs, pages 31:1–31:16, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. |
| [874] | Extending Partial 1-Planar Drawings 47th International Colloquium on Automata, Languages, and Programming, ICALP 2020, July 8-11, 2020, Saarbrücken, Germany (Virtual Conference) (Artur Czumaj, Anuj Dawar, Emanuela Merelli, eds.), volume 168 of LIPIcs, pages 43:1–43:19, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. |
| [873] | Manipulating Districts to Win Elections: Fine-Grained Complexity The Thirty-Fourth AAAI Conference on Artificial Intelligence, AAAI 2020, New York, NY, USA, February 7-12, 2020, pages 1902–1909, 2020, AAAI Press. |
| [872] | 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. |
| [871] | 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. |
| [870] | 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. |
| [869] | Stable Matchings with Diversity Constraints: Affirmative Action is beyond NP Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence, IJCAI 2020 (Christian Bessiere, ed.), pages 146–152, 2020, ijcai.org. |
| [868] | Parameterized Algorithms for Queue Layouts Graph Drawing and Network Visualization - 28th International Symposium, GD 2020, Vancouver, BC, Canada, September 16-18, 2020, Revised Selected Papers (David Auber, Pavel Valtr, eds.), volume 12590 of Lecture Notes in Computer Science, pages 40–54, 2020, Springer Verlag. |
| [867] | 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. |
| [866] | Hard QBFs for Merge Resolution 40th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2020, December 14-18, 2020, BITS Pilani, K K Birla Goa Campus, Goa, India (Virtual Conference) (Nitin Saxena, Sunil Simon, eds.), volume 182 of LIPIcs, pages 12:1–12:15, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. |
| [865] | On Covering Segments with Unit Intervals 37th International Symposium on Theoretical Aspects of Computer Science, STACS 2020, March 10-13, 2020, Montpellier, France (Christophe Paul, Markus Bläser, eds.), volume 154 of LIPIcs, pages 13:1–13:17, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. |
| [864] | A Large Neighborhood Search for Distributing Service Points in Mobility Applications with Capacities and Limited Resources 09 2020, Presentation, CPAIOR2020. |
| [863] | 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 |
| [862] | 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 |
| [861] | 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 |
| [860] | 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 | |
| [859] | Metabopolis: scalable network layout for biological pathway diagrams in urban map style BMC Bioinformatics, volume 20, pages 187, 2019. |
| [858] | Exact Approaches for Network Design Problems with Relays INFORMS Journal on Computing, volume 31, number 1, pages 171–192, 2019. |
| [857] | Photonic-integrated circuits with non-planar topologies realized by 3D-printed waveguide overpasses Optics Express, volume 27, number 12, pages 17402–17425, 2019. |
| [856] | Minimizing crossings in constrained two-sided circular graph layouts J. Computational Geometry, volume 10, number 2, pages 45–69, 2019. |
| [855] | Lombardi Drawings of Knots and Links J. Computational Geometry, volume 10, number 1, pages 444–476, 2019. |
| [854] | Snarks with Special Spanning Trees Graphs and Combinatorics, volume 35, number 1, pages 207–219, 2019, Springer. |
| [853] | Job Sequencing with One Common and Multiple Secondary Resources: An A*/Beam Search Based Anytime Algorithm Artificial Intelligence, volume 277, number 103173, 2019. |
| [852] | Short Plane Supports for Spatial Hypergraphs J. Graph Algorithms Appl., volume 23, number 3, pages 463–498, 2019. |
| [851] | On the Readability of Leaders in Boundary Labeling Information Visualization, volume 18, number 1, pages 110–132, 2019. |
| [850] | External Labeling Techniques: A Taxonomy and Survey Computer Graphics Forum, volume 38, number 3, pages 833–860, 2019. |
| [849] | Planar Drawings of Fixed-Mobile Bigraphs Theoretical Computer Science, volume 795, pages 408–419, 2019. |
| [848] | Guidelines for Experimental Algorithmics: A Case Study in Network Analysis Algorithms, volume 12, number 7, pages 127:1–127:37, 2019. |
| [847] | Dependency Learning for QBF Journal of Artificial Intelligence Research, volume 65, pages 180–208, 2019. |
| [846] | Long-Distance Q-Resolution with Dependency Schemes Journal of Automated Reasoning, volume 63, number 1, pages 127–155, 2019. |
| [845] | On the Parameterized Complexity of (k,s)-SAT Information Processing Letters, volume 143, pages 34–36, 2019. |
| [844] | A SAT Approach to Branchwidth ACM Transactions on Computational Logic, volume 20, number 3, pages 15:1–15:24, 2019. |
| [843] | Solving Integer Linear Programs by Exploiting Variable-Constraint Interactions: A Survey Algorithms, volume 12, number 12, pages 248, 2019. |
| [842] | On the Complexity Landscape of Connected f-Factor Problems Algorithmica, volume 81, number 6, pages 2606–2632, 2019. |
| [841] | Parameterized Complexity of Asynchronous Border Minimization Algorithmica, volume 81, number 1, pages 201–223, 2019. |
| [840] | Shrub-Depth: Capturing Height of Dense Graphs Logical Methods in Computer Science, 2019. |
| [839] | Counting linear extensions: Parameterizations by treewidth Algorithmica, 2019. |
| [838] | Compendium of Parameterized Problems at Higher Levels of the Polynomial Hierarchy MDPI Algorithms, volume 12, number 9, pages 1–28, 2019. |
| [837] | 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. |
| [836] | 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 |
| [835] | 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. |
| [834] | 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. |
| [833] | A Memetic Algorithm for Competitive Facility Location Problems Chapter in Business and Consumer Analytics: New Ideas, pages 637–660, 2019, Springer. |
| [832] | 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. |
| [831] | 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. |
| [830] | A Novel Approach for Solving Large-Scale Bike Sharing Station Planning Problems Learning and Intelligent Optimization – 13th International Conference, LION 13 (Nikolaos F. Matsatsinis, Yannis Marinakis, Panos Pardalos, eds.), volume 11968 of LNCS, pages 184–200, 2019, Springer. |
| [829] | A SAT Approach for Finding Sup-Transition-Minors Learning and Intelligent Optimization. LION 2019, volume 11968 of LNCS, pages 325–341, 2019, Springer. |
| [828] | 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. |
| [827] | 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. |
| [826] | 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. |
| [825] | Efficient Segment Folding is Hard Canadian Conference on Computational Geometry (CCCG'19), pages 177–183, 2019. |
| [824] | Exploring Semi-Automatic Map Labeling Advances in Geographic Information Systems (SIGSPATIAL'19), pages 13–22, 2019, ACM. |
| [823] | 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. |
| [822] | 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. |
| [821] | Efficient Non-Segregated Routing for Reconfigurable Demand-Aware Networks IFIP Networking Conference (Networking'19), pages 1–9, 2019, IEEE. |
| [820] | 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. |
| [819] | 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 |
| [818] | 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. |
| [817] | 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. |
| [816] | 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. |
| [815] | Refined Complexity of PCA with Outliers Proceedings of the 36th International Conference on Machine Learning, ICML 2019, 9-15 June 2019, Long Beach, California, USA (Kamalika Chaudhuri, Ruslan Salakhutdinov, eds.), volume 97 of Proceedings of Machine Learning Research, pages 5818–5826, 2019, PMLR. |
| [814] | 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. |
| [813] | 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. |
| [812] | 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. |
| [811] | Finding Linear Arrangements of Hypergraphs with Bounded Cutwidth in Linear Time 14th International Symposium on Parameterized and Exact Computation, IPEC 2019, September 11-13, 2019, Munich, Germany (Bart M. P. Jansen, Jan Arne Telle, eds.), volume 148 of LIPIcs, pages 20:1–20:14, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. |
| [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 Graph Drawing and Network Visualization - 27th International Symposium, GD 2019, Prague, Czech Republic, September 17-20, 2019, Proceedings (Daniel Archambault, Csaba D. Tóth, eds.), volume 11904 of Lecture Notes in Computer Science, pages 147–161, 2019, Springer Verlag. |
| [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 Integer Programming and Combinatorial Optimization - 20th International Conference, IPCO 2019, Ann Arbor, MI, USA, May 22-24, 2019, Proceedings (Andrea Lodi, Viswanath Nagarajan, eds.), volume 11480 of Lecture Notes in Computer Science, pages 194–204, 2019, Springer Verlag. |
| [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 Graph Drawing and Network Visualization - 27th International Symposium, GD 2019, Prague, Czech Republic, September 17-20, 2019, Proceedings (Daniel Archambault, Csaba D. Tóth, eds.), volume 11904 of Lecture Notes in Computer Science, pages 365–378, 2019, Springer Verlag. |
| [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] | Recent Trends in Knowledge Compilation (Dagstuhl Seminar 17381) (Adnan Darwiche, Pierre Marquis, Dan Suciu, Stefan Szeider, eds.), volume 7 of Dagstuhl Reports, 2017. |
| [743] | Linear-Time Parameterized Algorithms via Skew-Symmetric Multicuts ACM Trans. Algorithms, volume 13, number 4, pages 46:1–46:25, 9 2017, Assoc. Comput. Mach., New York. |
| [742] | 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. |
| [741] | 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. |
| [740] | Euclidean Greedy Drawings of Trees Discrete and Computational Geometry, volume 58, number 3, pages 543–579, 2017. |
| [739] | Large Neighborhood Search for the Most Strings with Few Bad Columns Problem Soft Computing, volume 21, number 17, pages 4901–4915, 2017. |
| [738] | 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 |
| [737] | Progress on Partial Edge Drawings J. Graph Algorithms Appl., volume 21, number 4, pages 757–786, 2017. |
| [736] | The Treewidth of Proofs Information and Computation, volume 255, pages 147–164, 2017. |
| [735] | Parameterized Complexity of Directed Steiner Tree on Sparse Graphs SIAM J. Discrete Math., volume 31, number 2, pages 1294–1327, 2017. |
| [734] | Hitting (Selected) Odd Cycles SIAM J. Discrete Math., volume 31, number 3, pages 1581–1615, 2017. |
| [733] | 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. |
| [732] | Backdoors into heterogeneous classes of SAT and CSP Journal of Computer and System Sciences, volume 85, pages 38–56, 2017. |
| [731] | Discovering Archipelagos of Tractability for Constraint Satisfaction and Counting ACM Transactions on Algorithms, volume 13, number 2, pages 29:1–29:32, 2017. |
| [730] | Kernelization using structural parameters on sparse graph classes Journal of Computer and System Sciences, volume 84, pages 219–242, 2017. |
| [729] | Parameterized Complexity Classes Beyond Para-NP Journal of Computer and System Sciences, volume 87, pages 16–57, 2017. |
| [728] | Faster exact algorithms for some terminal set problems J. Comput. Syst. Sci., volume 88, pages 195–207, 2017. |
| [727] | Metric Dimension of Bounded Tree-length Graphs SIAM J. Discrete Math., volume 31, number 2, pages 1217–1243, 2017. |
| [726] | Free Weak Nilpotent Minimum Algebras Soft Computing, volume 21(1), pages 79–95, 2017. |
| [725] | 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. |
| [724] | 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. |
| [723] | Minimizing crossings in constrained two-sided circular graph layouts European Workshop on Computational Geometry (EuroCG'17), pages 265–268, April 2017. |
| [722] | Radial Contour Labeling with Straight Leaders IEEE Pacific Visualization Symposium (PacificVis'17), pages 295–304, 2017. |
| [721] | 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. |
| [720] | 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. |
| [719] | An Enhanced Iterated Greedy Metaheuristic for the Particle Therapy Patient Scheduling Problem Proceedings of the 12th Metaheuristics International Conference, pages 465–474, 2017. |
| [718] | 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. |
| [717] | 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. |
| [716] | 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. |
| [715] | 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. |
| [714] | 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. |
| [713] | 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. |
| [712] | 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. |
| [711] | 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. |
| [710] | 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. |
| [709] | 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. |
| [708] | 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. |
| [707] | 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 |
| [706] | 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. |
| [705] | 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. |
| [704] | 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. |
| [703] | Combining Treewidth and Backdoors for CSP 34th Symposium on Theoretical Aspects of Computer Science (STACS 2017) (Heribert Vollmer, Vallée, eds.), volume 66 of Leibniz International Proceedings in Informatics (LIPIcs), pages 36:1–36:17, 2017, Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik. |
| [702] | 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. |
| [701] | 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. |
| [700] | 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. |
| [699] | 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. |
| [698] | 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. |
| [697] | 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. |
| [696] | 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. |
| [695] | 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. |
| [694] | 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. |
| [693] | 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. |
| [692] | 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. |
| [691] | 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 |
| [690] | 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. |
| [689] | 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 |
| [688] | Stable Matching with Uncertain Pairwise Preferences Proceedings of AAMAS 2017, the 16th International Conference on Autonomous Agents and Multiagent Systems, 2017, IFAAMAS/ACM. |
| [687] | 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 | |
| [686] | Hybrid Metaheuristics – Powerful Tools for Optimization 2016, Springer. |
| [685] | 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. |
| [684] | 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 |
| [683] | 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. |
| [682] | On Self-Approaching and Increasing-Chord Drawings of 3-Connected Planar Graphs J. Computational Geometry, volume 7, number 1, pages 47–69, 2016. |
| [681] | Extending Convex Partial Drawings of Graphs Algorithmica, volume 76, number 1, pages 47–67, 2016. |
| [680] | Mixed Map Labeling J. Spatial Information Science, volume 13, pages 3–32, 2016. |
| [679] | 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 |
| [678] | Evaluation of Labeling Strategies for Rotating Maps ACM J. Experimental Algorithmics, volume 21, number 1, pages 1.4:1–1.4:21, 2016. |
| [677] | Consistent Labeling of Rotating Maps J. Computational Geometry, volume 7, number 1, pages 308–331, 2016. |
| [676] | Strict Confluent Drawing J. Computational Geometry, volume 7, number 1, pages 22–46, 2016. |
| [675] | 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 |
| [674] | 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 |
| [673] | 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 |
| [672] | Adjacency-Preserving Spatial Treemaps J. Computational Geometry, volume 7, number 1, pages 100-122, 2016. |
| [671] | Quantifier reordering for QBF Journal of Automated Reasoning, volume 56, number 4, pages 459–477, 2016. |
| [670] | Soundness of Q-resolution with dependency schemes Theoretical Computer Science, volume 612, pages 83–101, 2016. |
| [669] | Model Counting for CNF Formulas of Bounded Modular Treewidth Algorithmica, volume 76, number 1, pages 168–194, 2016. |
| [668] | A Parameterized Study of Maximum Generalized Pattern Matching Problems Algorithmica, volume 75, number 1, pages 1–26, 2016. |
| [667] | Complexity and monotonicity results for domination games Theor. Comput. Sci., volume 628, pages 1–29, 2016. |
| [666] | Tree-depth and vertex-minors Eur. J. Comb., volume 56, pages 46–56, 2016. |
| [665] | Backdoors to q-Horn Algorithmica, volume 74, number 1, pages 540–557, 2016. |
| [664] | Meta-Kernelization with Structural Parameters Journal of Computer and System Sciences, volume 82, number 2, pages 333–346, 2016. |
| [663] | FO Model Checking of Interval Graphs Logical Methods in Computer Science, volume 11, number 4, 2016. |
| [662] | Are There Any Good Digraph Measures? Journal of Combinatorial Theory, Series B, volume 116, pages 250–286, 2016. |
| [661] | Directed elimination games Discrete Applied Mathematics, volume 199, pages 187–198, 2016. |
| [660] | Quantified Conjunctive Queries on Partially Ordered Sets Theoretical Computer Science, volume 618, pages 72–84, 2016. |
| [659] | Model Checking Existential Logic on Partially Ordered Sets ACM Transactions on Computational Logic, volume 17, number 2, 2016. |
| [658] | Partially Polynomial Kernels for Set Cover and Test Cover SIAM J. Discrete Math., volume 30, number 3, pages 1401–1423, 2016. |
| [657] | 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. |
| [656] | 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. |
| [655] | 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. |
| [654] | 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. |
| [653] | 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. |
| [652] | 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. |
| [651] | Temporal Map Labeling: A New Unified Framework with Experiments Advances in Geographic Information Systems (SIGSPATIAL'16), pages 23:1–23:10, 2016. |
| [650] | 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. |
| [649] | 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. |
| [648] | 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. |
| [647] | 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. |
| [646] | 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. |
| [645] | 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. |
| [644] | 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. |
| [643] | 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. |
| [642] | 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. |
| [641] | 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. |
| [640] | 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. |
| [639] | 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. |
| [638] | 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. |
| [637] | 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. |
| [636] | 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. |
| [635] | 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. |
| [634] | 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. |
| [633] | 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. |
| [632] | 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. |
| [631] | 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. |
| [630] | Parameterized Complexity Results for the Kemeny Rule in Judgment Aggregation Proceedings of ComSoc 2016, the Sixth International Workshop on Computational Social Choice, 2016. |
| [629] | 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. |
| [628] | 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. |
| [627] | 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. |
| [626] | 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. |
| [625] | 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. |
| [624] | 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 |
| [623] | Parameterized Complexity in the Polynomial Hierarchy 2016, PhD thesis, Technische Universität Wien. |
| [622] | 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 |
| [621] | 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 |
| [620] | 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 |
| [619] | 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 |
| [618] | Positive and Negative Results for Parameterized Compilability 2016, Technical report AC-TR-16-003, Algorithms and Complexity Group, TU Wien. |
| [617] | Complexity Results for Manipulation, Bribery and Control of the Kemeny Procedure in Judgment Aggregation 8 2016, Technical report 1608.02406, arXiv.org. |
| 2015 | |
| [616] | Numerical Optimisation of Electro-Hybrid Powertrains MTZ Worldwide, volume 03, pages 46–52, Mar 2015, Springer. |
| [615] | Numerische Optimierung elektrifizierter Antriebsstränge Motortechnische Zeitschrift (MTZ), volume 03, pages 66–74, Mar 2015, Springer. |
| [614] | Backdoors to Tractable Answer Set Programming Artificial Intelligence, volume 220, pages 64–103, 3 2015. |
| [613] | 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. |
| [612] | 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 |
| [611] | 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 |
| [610] | Multi-Row Boundary-Labeling Algorithms for Panorama Images ACM Trans. Spatial Algorithms and Systems, volume 1, number 1, pages 1:1–1:30, 2015. |
| [609] | 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 |
| [608] | Empirical Evaluation for Graph Drawing (Dagstuhl Seminar 15052) Dagstuhl Reports, volume 5, number 1, pages 243–258, 2015. |
| [607] | Many-to-One Boundary Labeling with Backbones J. Graph Algorithms Appl., volume 19, number 3, pages 779–816, 2015. |
| [606] | Computing secure sets in graphs using answer set programming Journal of Logic and Computation, 2015. |
| [605] | Parameterized and subexponential-time complexity of satisfiability problems and applications Theoretical Computer Science, volume 607, pages 282–295, 2015. |
| [604] | A SAT Approach to Clique-Width ACM Transactions on Computational Logic, volume 16, number 3, pages 24, 2015. |
| [603] | Faster Parameterized Algorithms for Deletion to Split Graphs Algorithmica, volume 71, number 4, pages 989–1006, 2015. |
| [602] | On finding optimal polytrees Theoretical Computer Science, volume 592, pages 49–58, 2015. |
| [601] | Improving Vertex Cover as a Graph Parameter Discrete Mathematics & Theoretical Computer Science, volume 17, number 2, pages 77–100, 2015. |
| [600] | Backdoors to Normality for Disjunctive Logic Programs ACM Transactions on Computational Logic, volume 17, number 1, 2015. |
| [599] | On the Subexponential-Time Complexity of CSP Journal of Artificial Intelligence Research, volume 52, pages 203–234, 2015. |
| [598] | 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. |
| [597] | A complete parameterized complexity analysis of bounded planning Journal of Computer and System Sciences, volume 81, number 7, pages 1311–1332, 2015. |
| [596] | 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. |
| [595] | 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. |
| [594] | 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, 1 2015, Springer Verlag. |
| [593] | 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. |
| [592] | 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. |
| [591] | Partitioning Graph Drawings and Triangulated Simple Polygons into Greedily Routable Regions Algorithms and Computation (ISAAC'15) (Khaled Elbassioni, Kazuhisa Makino, eds.), volume |