Full List of Publications
1261 results| [1261] | Algorithmic Extensions of Dirac's Theorem Chapter in , pages 406-416. |
| [1260] | Parallel Beam Search for Combinatorial Optimization Workshop Proceedings of the International Conference on Parallel Processing (ICPP 2022), pages 1–8, ACM Press. |
| [1259] | Lossy Kernels for Hitting Subgraphs MFCS 2017. Note: To Appear |
| [1258] | On the Parameterized Complexity of Simultaneous Deletion Problems FSTTCS 2017. Note: To Appear |
| 2025 | |
| [1257] | Introducing Fairness in Network Visualization Information Sciences, volume 691, pages 121642, 2025. |
| [1256] | Large and Parallel Human Sorting Networks Creative Mathematical Sciences Communication (Henning Fernau, Inge Schwank, Jacqueline Staub, eds.), pages 194–204, 2025, Springer Nature Switzerland. |
| [1255] | Pathways to Tractability for Geometric Thickness SOFSEM 2025: Theory and Practice of Computer Science - 50th International Conference on Current Trends in Theory and Practice of Computer Science, 2025. Note: to appear |
| 2024 | |
| [1254] | Bounding and Computing Obstacle Numbers of Graphs SIAM J. Discret. Math., volume 38, number 2, pages 1537–1565, 2024. |
| [1253] | Computing Data-driven Multilinear Metro Maps The Cartographic Journal, pages 1–16, 2024. |
| [1252] | Visualizing Extensions of Argumentation Frameworks as Layered Graphs CoRR, volume abs/2409.05457, 2024. |
| [1251] | Signed double Roman domination on cubic graphs Applied Mathematics and Computation, volume 471, pages 128612, 2024, Elsevier. |
| [1250] | Splitting Plane Graphs to Outerplanarity J. Graph Algorithms Appl., volume 28, number 3, pages 31–48, 2024. |
| [1249] | Improving Temporal Treemaps by Minimizing Crossings Comput. Graph. Forum, volume 43, number 3, pages e15087, 2024. |
| [1248] | Uncertainty in Humanities Network Visualization Frontiers in Communication, volume 8, pages 1305137, 2024. |
| [1247] | On the Complexity of the Storyplan Problem J. Computer and Systems Sciences, volume 139, pages 103466, 2024. |
| [1246] | SAT-based Decision Tree Learning for Large Data Sets Journal of Artificial Intelligence Research, volume 80, pages 875–918, 2024. |
| [1245] | On Critical Node Problems with Vulnerable Vertices J. Graph Algorithms Appl., volume 28, number 1, pages 1–26, 2024. |
| [1244] | Backdoor DNFs Journal of Computer and System Sciences, volume 144, pages 103547, 2024. |
| [1243] | SAT Modulo Symmetries for Graph Generation and Enumeration ACM Transactions on Computational Logic, volume 25, number 3, 2024. |
| [1242] | Efficient Branch-and-Bound Algorithms for Finding Triangle-Constrained 2-Clubs J. Comb. Optim., 2024. Note: to appear |
| [1241] | Slim Tree-Cut Width Algorithmica, volume 86, number 8, pages 2714–2738, 2024. |
| [1240] | The Fine-Grained Complexity of Graph Homomorphism Parameterized by Clique-Width ACM Trans. Algorithms, volume 20, number 3, pages 19, 2024. |
| [1239] | SAT backdoors: Depth beats size Journal of Computer and System Sciences, volume 142, pages 103520, 2024. |
| [1238] | Fixed-Parameter Algorithms for Computing RAC Drawings of Graphs J. Graph Algorithms Appl., 2024. Note: to appear |
| [1237] | The Complexity of Optimizing Atomic Congestion Artif. Intell., 2024. Note: to appear |
| [1236] | Compilation and Fast Model Counting beyond CNF Proceedings of the Thirty-Third International Joint Conference on Artificial Intelligence, IJCAI-24 (Kate Larson, ed.), pages 3315–3323, 8 2024, International Joint Conferences on Artificial Intelligence Organization. Note: Main Track |
| [1235] | Explaining Decisions in ML Models: A Parameterized Complexity Analysis Proceedings of the 21st International Conference on Principles of Knowledge Representation and Reasoning, pages 563–573, 8 2024. |
| [1234] | Revisiting Causal Discovery from a Complexity-Theoretic Perspective Proceedings of the Thirty-Third International Joint Conference on Artificial Intelligence, IJCAI-24 (Kate Larson, ed.), pages 3377–3385, 8 2024, International Joint Conferences on Artificial Intelligence Organization. Note: Main Track |
| [1233] | ASP-QRAT: A Conditionally Optimal Dual Proof System for ASP Proceedings of the 21st International Conference on Principles of Knowledge Representation and Reasoning, pages 253–263, 8 2024. |
| [1232] | Hoop Diagrams: A Set Visualization Method Diagrammatic Representation and Inference (DIAGRAMS'24), volume 14981 of LNCS, pages 377-392, 2024, Springer. |
| [1231] | GdMetriX - A NetworkX Extension For Graph Drawing Metrics Graph Drawing and Network Visualization (GD'24) (Stefan Felsner, Karsten Klein, eds.), volume 320 of LIPIcs, pages 45:1–45:3, 2024, Schloss Dagstuhl – Leibniz-Zentrum für Informatik. Note: Poster abstract |
| [1230] | Introducing Fairness in Graph Visualization via Gradient Descent Machine Learning Methods in Visualisation for Big Data (MLVis'24) (Daniel Archambault, Ian Nabney, Jaakko Peltonen, eds.), pages 1–5, 2024, Eurographics Association. |
| [1229] | Tackling the $\alpha$-Domination Problem Heuristically 19th International Conference on Computer Aided Systems Theory, 2024, Springer. Note: to appear; preprint: https://www.ac.tuwien.ac.at/files/pub/iurlano-varga-raidl-24.pdf |
| [1228] | Introducing Fairness in Graph Visualization Graph Drawing and Network Visualization (GD'24) (Stefan Felsner, Karsten Klein, eds.), volume 320 of LIPIcs, pages 49:1–49:3, 2024, Schloss Dagstuhl – Leibniz-Zentrum für Informatik. Note: Poster abstract |
| [1227] | A Simulated Annealing Based Approach for the Roman Domination Problem Metaheuristics and Nature Inspired Computing (Bernabé Dorronsoro, Rachid Ellaia, El-Ghazali Talbi, eds.), pages 28–43, 2024, Springer Nature Switzerland. Note: preprint: https://www.ac.tuwien.ac.at/files/pub/greilhuber-schober-iurlano-raidl-23.pdf |
| [1226] | Minimizing Switches in Cased Graph Drawings Graph Drawing and Network Visualization (GD'24) (Stefan Felsner, Karsten Klein, eds.), volume 320 of LIPIcs, pages 43:1–43:3, 2024, Schloss Dagstuhl – Leibniz-Zentrum für Informatik. Note: Poster abstract |
| [1225] | Flip-Breakability: A Combinatorial Dichotomy for Monadically Dependent Graph Classes Proceedings of the 56th Annual ACM Symposium on Theory of Computing, pages 1550–1560, 2024, Association for Computing Machinery. |
| [1224] | Constrained Boundary Labeling Algorithms and Computation (ISAAC'24) (Julian Mestre, Anthony Wirth, eds.), volume 322 of LIPIcs, pages 11:1–11:16, 2024, Schloss Dagstuhl – Leibniz-Zentrum für Informatik. Note: To appear. |
| [1223] | Revisiting ILP Models for Exact Crossing Minimization in Storyline Drawings Graph Drawing and Network Visualization (GD'24) (Stefan Felsner, Karsten Klein, eds.), volume 320 of LIPIcs, pages 31:1–31:19, 2024, Schloss Dagstuhl – Leibniz-Zentrum für Informatik. |
| [1222] | The Parameterized Complexity of Extending Stack Layouts Graph Drawing and Network Visualization (GD'24) (Stefan Felsner, Karsten Klein, eds.), volume 320 of LIPIcs, pages 12:1–12:17, 2024, Schloss Dagstuhl – Leibniz-Zentrum für Informatik. |
| [1221] | Minimizing Corners in Colored Rectilinear Grids Algorithms and Computation (WALCOM'24) (Ryuhei Uehara, Katsuhisa Yamanaka, Hsu-Chun Yen, eds.), volume 14549 of LNCS, pages 134–148, 2024, Springer. |
| [1220] | Boundary Labeling in a Circular Orbit Graph Drawing and Network Visualization (GD'24) (Stefan Felsner, Karsten Klein, eds.), volume 320 of LIPIcs, pages 22:1–22:17, 2024, Schloss Dagstuhl – Leibniz-Zentrum für Informatik. |
| [1219] | Fully Dynamic Maximum Independent Sets of Disks in Polylogarithmic Update Time Computational Geometry (SoCG'24) (Wolfgang Mulzer, Jeff M. Phillips, eds.), volume 293 of LIPIcs, pages 19:1–19:16, 2024, Schloss Dagstuhl – Leibniz-Zentrum für Informatik. |
| [1218] | Bundling-Aware Graph Drawing Graph Drawing and Network Visualization (GD'24) (Stefan Felsner, Karsten Klein, eds.), volume 320 of LIPIcs, pages 15:1–15:19, 2024, Schloss Dagstuhl – Leibniz-Zentrum für Informatik. |
| [1217] | Small unsatisfiable k-CNFs with bounded literal occurrence 27th International Conference on Theory and Applications of Satisfiability Testing (SAT 2024) (Supratik Chakraborty, Jie-Hong Roland Jiang, eds.), volume 305 of Leibniz International Proceedings in Informatics (LIPIcs), pages 31:1–31:22, 2024, Schloss Dagstuhl – Leibniz-Zentrum für Informatik. |
| [1216] | SAT-Based Tree Decomposition with Iterative Cascading Policy Selection AAAI'24, the Thirty-Eighth AAAI Conference on Artificial Intelligence, February 20-27, Vancouver, Canada (Jennifer Dy, Sriraam Natarajan, eds.), pages 8191–8199, 2024, AAAI Press. |
| [1215] | SubModST: A Fast Generic Solver for Submodular Maximization with Size Constraints 32nd Annual European Symposium on Algorithms (ESA 2024), 2024, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. Note: to appear |
| [1214] | Structure-guided Local Improvement for Maximum Satisfiability The 30th International Conference on Principles and Practice of Constraint Programming, CP 2024 (Paul Shaw, ed.), 2024, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. Note: to appear |
| [1213] | eSLIM: Circuit Minimization with SAT Based Local Improvement 27th International Conference on Theory and Applications of Satisfiability Testing (SAT 2024) (Supratik Chakraborty, Jie-Hong Roland Jiang, eds.), volume 305 of Leibniz International Proceedings in Informatics (LIPIcs), pages 23:1–23:14, 2024, Schloss Dagstuhl – Leibniz-Zentrum für Informatik. |
| [1212] | A General Theoretical Framework for Learning Smallest Interpretable Models AAAI'24, the Thirty-Eighth AAAI Conference on Artificial Intelligence, February 20-27, Vancouver, Canada (Jennifer Dy, Sriraam Natarajan, eds.), pages 10662–10669, 2024, AAAI Press. |
| [1211] | On the Complexity of Community-aware Network Sparsification 49th International Symposium on Mathematical Foundations of Computer Science (MFCS 2024), 2024, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. Note: to appear |
| [1210] | The Parameterized Complexity Landscape of the Unsplittable Flow Problem Graph-Theoretic Concepts in Computer Science - 48th International Workshop, WG 2024, Spik, Slovenia, June 19-21, 2024, Revised Selected Papers, 2024, Springer Verlag. Note: to appear |
| [1209] | A Tight Subexponential-Time Algorithm for Two-Page Book Embedding 51st International Colloquium on Automata, Languages, and Programming, ICALP 2024, July 8-12, 2024, Tallinn, Estonia (Karl Bringmann, Martin Grohe, Gabriele Puppis, Ola Svensson, eds.), volume 297 of LIPIcs, pages 68:1–68:18, 2024, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. |
| [1208] | The Complexity of Fair Division of Indivisible Items with Externalities Thirty-Eighth AAAI Conference on Artificial Intelligence, AAAI 2024, Thirty-Sixth Conference on Innovative Applications of Artificial Intelligence, IAAI 2024, Fourteenth Symposium on Educational Advances in Artificial Intelligence, EAAI 2014, February 20-27, 2024, Vancouver, Canada (Michael J. Wooldridge, Jennifer G. Dy, Sriraam Natarajan, eds.), pages 9653–9661, 2024, AAAI Press. |
| [1207] | Learning Small Decision Trees for Data of Low Rank-Width AAAI'24, the Thirty-Eighth AAAI Conference on Artificial Intelligence, February 20-27, Vancouver, Canada (Jennifer Dy, Sriraam Natarajan, eds.), pages 10476–10483, 2024, AAAI Press. |
| [1206] | Exact Algorithms for Clustered Planarity with Linear Saturators 35th International Symposium on Algorithms and Computation, ISAAC 2024, 2024, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. |
| [1205] | The Parameterized Complexity of Extending Stack Layouts Graph Drawing and Network Visualization - 31st International Symposium, GD 2024, 2024, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. Note: to appear |
| [1204] | Parameterized Algorithms for Coordinated Motion Planning: Minimizing Energy 51st International Colloquium on Automata, Languages, and Programming, ICALP 2024, July 8-12, 2024, Tallinn, Estonia (Karl Bringmann, Martin Grohe, Gabriele Puppis, Ola Svensson, eds.), volume 297 of LIPIcs, pages 53:1–53:18, 2024, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. |
| [1203] | Hardness of Random Reordered Encodings of Parity for Resolution and CDCL AAAI'24, the Thirty-Eighth AAAI Conference on Artificial Intelligence, February 20-27, Vancouver, Canada (Jennifer Dy, Sriraam Natarajan, eds.), pages 7978–7986, 2024, AAAI Press. |
| [1202] | Counting Vanishing Matrix-Vector Products WALCOM: Algorithms and Computation - 18th International Conference and Workshops on Algorithms and Computation, WALCOM 2024, Kanazawa, Japan, March 18-20, 2024, Proceedings (Ryuhei Uehara, Katsuhisa Yamanaka, Hsu-Chun Yen, eds.), volume 14549 of Lecture Notes in Computer Science, pages 335–349, 2024, Springer Verlag. |
| [1201] | The Complexity of Optimizing Atomic Congestion Thirty-Eighth AAAI Conference on Artificial Intelligence, AAAI 2024, Thirty-Sixth Conference on Innovative Applications of Artificial Intelligence, IAAI 2024, Fourteenth Symposium on Educational Advances in Artificial Intelligence, EAAI 2014, February 20-27, 2024, Vancouver, Canada (Michael J. Wooldridge, Jennifer G. Dy, Sriraam Natarajan, eds.), pages 20044–20052, 2024, AAAI Press. |
| [1200] | Twin-Width Meets Feedback Edges and Vertex Integrity 19th International Symposium on Parameterized and Exact Computation, IPEC 2024, 2024, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. Note: to appear |
| [1199] | Computing Twin-Width Parameterized by the Feedback Edge Number 41st International Symposium on Theoretical Aspects of Computer Science, STACS 2024, March 12-14, 2024, Clermont-Ferrand, France (Olaf Beyersdorff, Mamadou Moustapha Kanté, Orna Kupferman, Daniel Lokshtanov, eds.), volume 289 of LIPIcs, pages 7:1–7:19, 2024, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. |
| [1198] | First-Order Model Checking on Monadically Stable Graph Classes 2024, arXiv. Note: to be presented at FOCS 2024 |
| 2023 | |
| [1197] | The Silent (R)evolution of SAT Communications of the ACM, volume 66, number 6, pages 64–72, June 2023. |
| [1196] | LinSets.zip: Compressing Linear Set Diagrams IEEE Trans. Visualization and Computer Graphics, volume 29, number 6, pages 2875–2887, 2023. |
| [1195] | Faster Edge-Path Bundling Through Graph Spanners Computer Graphics Forum, volume 42, number 6, pages e14789, 2023. |
| [1194] | Scheduling Jobs Using Queries to Interactively Learn Human Availability Times Computers and Operations Research, 2023. Note: to appear |
| [1193] | MosaicSets: Embedding Set Systems into Grid Graphs IEEE Trans. Visualization and Computer Graphics, 2023. |
| [1192] | Large Neighborhood Search for Electric Vehicle Fleet Scheduling Energies, volume 16, number 12, 2023. |
| [1191] | Growth of the perfect sequence covering array number Designs, Codes and Cryptography, volume 91, number 4, pages 1487–1494, 2023, Springer. |
| [1190] | New Frontiers of Parameterized Complexity in Graph Drawing (Dagstuhl Seminar 23162) Dagstuhl Reports, volume 13, number 4, pages 58–97, 2023. |
| [1189] | Untangling Circular Drawings: Algorithms and Complexity Comput. Geom. Theory Appl., volume 111, 2023. |
| [1188] | Worbel: Aggregating Point Labels into Word Clouds ACM Trans. Spatial Algorithms and Systems, volume 9, number 3, pages 19:1–19:32, 2023. |
| [1187] | On the Upward Book Thickness Problem: Combinatorial and Complexity Results European J. Combinatorics, volume 110, pages 103662, 2023. |
| [1186] | Splitting Vertices in 2-Layer Graph Drawings IEEE Computer Graphics and Applications, volume 43, number 3, pages 24–35, 2023. |
| [1185] | Computing optimal hypertree decompositions with SAT Artificial Intelligence, volume 325, pages 104015, 2023. |
| [1184] | SAT-Boosted Tabu Search for Coloring Massive Graphs J. Exp. Algorithmics, volume 2825, number 1.5, pages 1–19, 2023. |
| [1183] | Are Hitting Formulas Hard for Resolution? Discr. Appl. Math., volume 337, pages 173–184, 2023. |
| [1182] | Computing Dense and Sparse Subgraphs of Weakly Closed Graphs Algorithmica, volume 85, number 7, pages 2156–2187, 2023. |
| [1181] | Essentially Tight Kernels for (Weakly) Closed Graphs Algorithmica, volume 85, number 6, pages 1706–1735, 2023. |
| [1180] | The Parameterized Complexity of s-Club with Triangle and Seed Constraints Theory Comput. Syst., volume 67, number 5, pages 1050–1081, 2023. |
| [1179] | Group Activity Selection with Few Agent Types Algorithmica, volume 85, number 5, pages 1111–1155, 2023. |
| [1178] | Metric Dimension Parameterized by Feedback Vertex Set and Other Structural Parameters SIAM J. Discrete Math., 2023. Note: to appear |
| [1177] | Hedonic diversity games: A complexity picture with more than two colors Artif. Intell., volume 325, pages 104017, 2023. |
| [1176] | On the parameterized complexity of clustering problems for incomplete data Journal of Computer and System Sciences, volume 134, pages 1–19, 2023. |
| [1175] | Parameterized complexity of envy-free resource allocation in social networks Artif. Intell., volume 315, pages 103826, 2023. |
| [1174] | Destroying Multicolored Paths and Cycles in Edge-Colored Graphs Discret. Math. Theor. Comput. Sci., volume 25, 2023. |
| [1173] | CSP beyond tractable constraint languages Constraints, volume 28, number 3, pages 450–471, 2023. |
| [1172] | Sample compression schemes for balls in graphs SIAM J. Discrete Math., 2023. Note: to appear |
| [1171] | Speeding up Logic-Based Benders Decomposition by Strengthening Cuts with Graph Neural Networks Machine Learning, Optimization, and Data Science. LOD 2023., 2023, Springer. Note: to appear |
| [1170] | Interactive Job Scheduling with Partially Known Personnel Availabilities OLA 2023: Optimization and Learning (B. Dorronsoro, F. Chicano, G. Danoy, E.-G. Talbi, eds.), volume 1824 of Communications in Computer and Information Science, pages 236–247, 2023, Springer. |
| [1169] | Computing Hive Plots: A Combinatorial Framework Graph Drawing and Network Visualization (GD'23) (Michael Bekos, Markus Chimani, eds.), volume 14466 of LNCS, pages 153–169, 2023, Springer. |
| [1168] | Planarizing Graphs and their Drawings by Vertex Splitting Graph Drawing and Network Visualization (GD'22) (Patrizio Angelini, Reinhard von Hanxleden, eds.), volume 13764 of LNCS, pages 232–246, 2023, Springer. |
| [1167] | On Families of Planar DAGs with Constant Stack Number Graph Drawing and Network Visualization (GD'23) (Michael Bekos, Markus Chimani, eds.), volume 14465 of LNCS, pages 135–151, 2023, Springer. |
| [1166] | First-Order Model Checking on Structurally Sparse Graph Classes Proceedings of the 55th Annual ACM Symposium on Theory of Computing, STOC 2023, pages 567-580, 2023, Association for Computing Machinery. |
| [1165] | An Evolutionary Approach for Scheduling a Fleet of Shared Electric Vehicles EvoApplications 2023: Applications of Evolutionary Computation (J. Correia, S. Smith, R. Qaddoura, eds.), volume 13989 of LNCS, pages 3-18, 2023, Springer. |
| [1164] | The Influence of Dimensions on the Complexity of Computing Decision Trees Conference on Artificial Intelligence (AAAI'23) (Brian Williams, Yiling Chen, Jennifer Neville, eds.), pages 8343–8350, 2023, AAAI Press. |
| [1163] | Optimizing the positions of battery swapping stations – Pilot Studies and Layout Optimization Algorithm Proceedings to the 6th International Electric Vehicle Technology Conference, pages 20231015, 2023, JSAE. |
| [1162] | A Multilevel Optimization Approach for Large Scale Battery Exchange Station Location Planning Evolutionary Computation in Combinatorial Optimization – 23rd European Conference, EvoCOP 2023 (Leslie Pérez Cáceres, Thomas Stützle, eds.), volume 13987 of LNCS, pages 50–65, 2023, Springer. |
| [1161] | 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.), volume 13789 of LNCS, pages 87-95, 2023, Springer. |
| [1160] | MySemCloud: Semantic-aware Word Cloud Editing Pacific Visualization Symposium (PacificVis'23), pages 147–156, 2023. |
| [1159] | Splitting Plane Graphs to Outerplanarity Algorithms and Computation (WALCOM'23) (Bertrand M. T. Lin, Chun-Cheng Lin, Giuseppe Liotta, eds.), volume 13973 of LNCS, 2023, Springer. |
| [1158] | Multi-Objective Policy Evolution for a Same-Day Delivery Problem with Soft Deadlines , pages 1941–1949, 2023, ACM Press. |
| [1157] | A Policy-Based Learning Beam Search for Combinatorial Optimization Evolutionary Computation in Combinatorial Optimization – 23rd European Conference, EvoCOP 2023 (Leslie Pérez Cáceres, Thomas Stützle, eds.), volume 13987 of LNCS, pages 130–145, 2023, Springer. Note: best paper award winner |
| [1156] | Evaluating Restricted First-Order Counting Properties on Nowhere Dense Classes and Beyond 31st Annual European Symposium on Algorithms (ESA 2023) (Inge Li Gørtz, Martin Farach-Colton, Simon J. Puglisi, Grzegorz Herman, eds.), volume 274 of Leibniz International Proceedings in Informatics (LIPIcs), pages 43:1–43:17, 2023, Schloss Dagstuhl – Leibniz-Zentrum für Informatik. |
| [1155] | Indiscernibles and Flatness in Monadically Stable and Monadically NIP Classes 50th International Colloquium on Automata, Languages, and Programming, ICALP 2023, July 10-14, 2023, Paderborn, Germany (Kousha Etessami, Uriel Feige, Gabriele Puppis, eds.), volume 261 of LIPIcs, pages 125:1–125:18, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. |
| [1154] | A logic-based algorithmic meta-theorem for mim-width Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 3282-3304, 2023. |
| [1153] | Crossing Minimization in Time Interval Storylines European Workshop on Computational Geometry (EuroCG'23) (Clemens Huemer, Carlos Seara, eds.), pages 36:1–36:7, 2023. |
| [1152] | Block Crossings in One-Sided Tanglegrams Algorithms and Data Structures (WADS'23) (Pat Morin, Subhash Suri, eds.), volume 14079 of LNCS, pages 386–400, 2023, Springer. |
| [1151] | Transitions in Dynamic Point Labeling Geographic Information Science (GIScience'23) (Roger Beecham, Jed A. Long, Dianna Smith, Qunshan Zhao, Sarah Wise, eds.), volume 277 of LIPIcs, pages 2:1–2:19, 2023, Schloss Dagstuhl – Leibniz-Zentrum für Informatik. |
| [1150] | Extending Orthogonal Planar Graph Drawings is Fixed-Parameter Tractable Computational Geometry (SoCG'23) (Erin W. Chambers, Joachim Gudmundsson, eds.), volume 258 of LIPIcs, pages 18:1–18:16, 2023, Schloss Dagstuhl – Leibniz-Zentrum für Informatik. |
| [1149] | On the Complexity of the Storyplan Problem Graph Drawing and Network Visualization (GD'22) (Patrizio Angelini, Reinhard von Hanxleden, eds.), volume 13764 of LNCS, pages 304–318, 2023, Springer. |
| [1148] | Searching for smallest universal graphs and tournaments with SAT Proceedings of CP 2023, the 29th International Conference on Principles and Practice of Constraint Programming (Roland Yap, ed.), volume 280 of LIPIcs, pages 39:1–39:20, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. |
| [1147] | Proven optimally-balanced Latin rectangles with SAT Proceedings of CP 2023, the 29th International Conference on Principles and Practice of Constraint Programming (Roland Yap, ed.), volume 280 of LIPIcs, pages 48:1–48:10, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. |
| [1146] | Maximizing Social Welfare in Score-Based Social Distance Games Proceedings Nineteenth conference on Theoretical Aspects of Rationality and Knowledge, TARK 2023, Oxford, United Kingdom, 28-30th June 2023 (Rineke Verbrugge, ed.), volume 379 of EPTCS, pages 272–286, 2023. |
| [1145] | Exact Algorithms for Group Closeness Centrality SIAM Conference on Applied and Computational Discrete Algorithms, ACDA 2023, Seattle, WA, USA, May 31 - June 2, 2023 (Jonathan W. Berry, David B. Shmoys, Lenore Cowen, Uwe Naumann, eds.), pages 1–12, 2023, SIAM. |
| [1144] | Computing twin-width with SAT and branch & bound The 32nd International Joint Conference on Artificial Intelligence (IJCAI-23), August 19–25, 2023, Macao, S.A.R. (Edith Elkind, ed.), pages 2013–2021, 2023, ijcai.org. Note: Main Track |
| [1143] | A Dynamic MaxSAT-based Approach to Directed Feedback Vertex Sets Proceedings of the Symposium on Algorithm Engineering and Experiments, ALENEX 2023, Florence, Italy, January 22-23, 2023 (Gonzalo Navarro, Julian Shun, eds.), pages 39–52, 2023, SIAM. |
| [1142] | Circuit Minimization with QBF-Based Exact Synthesis Thirty-Seventh AAAI Conference on Artificial Intelligence, AAAI 2023, Thirty-Fifth Conference on Innovative Applications of Artificial Intelligence, IAAI 2023, Thirteenth Symposium on Educational Advances in Artificial Intelligence, EAAI 2023, Washington, DC, USA, February 7-14, 2023 (Brian Williams, Yiling Chen, Jennifer Neville, eds.), pages 4087–4094, 2023, AAAI Press. |
| [1141] | Circuit Minimization with Exact Synthesis: From QBF Back to SAT Proceedings of the 32nd International Workshop on Logic & Synthesis (IWLS), 2023. |
| [1140] | The Parameterized Complexity of Finding Concise Local Explanations Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence, IJCAI 2023, 19th-25th August 2023, Macao, SAR, China, pages 3312–3320, 2023, ijcai.org. |
| [1139] | On the Group Coverage Centrality Problem: Parameterized Complexity and Heuristics SIAM Conference on Applied and Computational Discrete Algorithms, ACDA 2023, Seattle, WA, USA, May 31 - June 2, 2023 (Jonathan W. Berry, David B. Shmoys, Lenore Cowen, Uwe Naumann, eds.), pages 13–24, 2023, SIAM. |
| [1138] | On Computing Optimal Tree Ensembles International Conference on Machine Learning, ICML 2023, 23-29 July 2023, Honolulu, Hawaii, USA (Andreas Krause, Emma Brunskill, Kyunghyun Cho, Barbara Engelhardt, Sivan Sabato, Jonathan Scarlett, eds.), volume 202 of Proceedings of Machine Learning Research, pages 17364–17374, 2023, PMLR. |
| [1137] | SAT-Based Generation of Planar Graphs The 26th International Conference on Theory and Applications of Satisfiability Testing (SAT 2023), July 04-08, 2023, Alghero, Italy (Meena Mahajan, Friedrich Slivovsky, eds.), volume 271 of LIPIcs, pages 14:1–14:18, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. |
| [1136] | A SAT Solver's Opinion on the Erdős-Faber-Lovász Conjecture The 26th International Conference on Theory and Applications of Satisfiability Testing (SAT 2023), July 04-08, 2023, Alghero, Italy (Meena Mahajan, Friedrich Slivovsky, eds.), 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. |
| [1135] | Co-Certificate Learning with SAT Modulo Symmetries Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence, IJCAI 2023, 19th-25th August 2023, Macao, SAR, China, pages 1944–1953, 2023, ijcai.org. Note: Main Track |
| [1134] | Space-Efficient Parameterized Algorithms on Graphs of Low Shrubdepth 31st Annual European Symposium on Algorithms, ESA 2023, September 4-6, 2023, Amsterdam, The Netherlands (Inge Li Gørtz, Martin Farach-Colton, Simon J. Puglisi, Grzegorz Herman, eds.), volume 274 of LIPIcs, pages 18:1–18:18, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. |
| [1133] | Inconsistent Cores for ASP: The Perks and Perils of Non-Monotonicity Thirty-Seventh AAAI Conference on Artificial Intelligence, AAAI 2023, Thirty-Fifth Conference on Innovative Applications of Artificial Intelligence, IAAI 2023, Thirteenth Symposium on Educational Advances in Artificial Intelligence, EAAI 2023, Washington, DC, USA, February 7-14, 2023 (Brian Williams, Yiling Chen, Jennifer Neville, eds.), pages 6363–6371, 2023, AAAI Press. |
| [1132] | IPASIR-UP: User Propagators for CDCL The 26th International Conference on Theory and Applications of Satisfiability Testing (SAT 2023), July 04-08, 2023, Alghero, Italy (Meena Mahajan, Friedrich Slivovsky, eds.), volume 271 of LIPIcs, pages 8:1–8:13, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. |
| [1131] | Structure-Aware Lower Bounds and Broadening the Horizon of Tractability for QBF LICS, pages 1–14, 2023. |
| [1130] | Learning Small Decision Trees with Large Domain The 32nd International Joint Conference on Artificial Intelligence (IJCAI-23), August 19–25, 2023, Macao, S.A.R. (Edith Elkind, ed.), pages 3184–3192, 2023, ijcai.org. Note: Main Track |
| [1129] | A Structural Complexity Analysis of Synchronous Dynamical Systems Thirty-Seventh AAAI Conference on Artificial Intelligence, AAAI 2023, Thirty-Fifth Conference on Innovative Applications of Artificial Intelligence, IAAI 2023, Thirteenth Symposium on Educational Advances in Artificial Intelligence, EAAI 2023, Washington, DC, USA, February 7-14, 2023 (Brian Williams, Yiling Chen, Jennifer Neville, eds.), pages 6313–6321, 2023, AAAI Press. |
| [1128] | The Computational Complexity of Concise Hypersphere Classification Proceedings of the 40th International Conference on Machine Learning, ICML 2023, pages 9060–9070, 2023, PMLR. |
| [1127] | From Data Completion to Problems on Hypercubes: A Parameterized Analysis of the Independent Set Problem 18th International Symposium on Parameterized and Exact Computation, IPEC 2023, September 6-8, 2023, Amsterdam, The Netherlands (Neeldhara Misra, Magnus Wahlström, eds.), volume 285 of LIPIcs, pages 16:1–16:14, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. |
| [1126] | The Parameterized Complexity of Coordinated Motion Planning 39th International Symposium on Computational Geometry, SoCG 2023, June 12-15, 2023, Dallas, Texas, USA (Erin W. Chambers, Joachim Gudmundsson, eds.), volume 258 of LIPIcs, pages 28:1–28:16, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. |
| [1125] | Pseudorandom Finite Models LICS, pages 1–13, 2023. |
| [1124] | Consistency Checking Problems: A Gateway to Parameterized Sample Complexity 18th International Symposium on Parameterized and Exact Computation, IPEC 2023, September 6-8, 2023, Amsterdam, The Netherlands (Neeldhara Misra, Magnus Wahlström, eds.), volume 285 of LIPIcs, pages 18:1–18:17, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. |
| [1123] | A Polyhedral Perspective on Tropical Convolutions Combinatorial Algorithms - 34th International Workshop, IWOCA 2023, Tainan, Taiwan, June 7-10, 2023, Proceedings (Sun-Yuan Hsieh, Ling-Ju Hung, Chia-Wei Lee, eds.), volume 13889 of Lecture Notes in Computer Science, pages 111–122, 2023, Springer Verlag. |
| [1122] | Upward and Orthogonal Planarity are W[1]-Hard Parameterized by Treewidth Graph Drawing and Network Visualization - 31st International Symposium, GD 2023, Isola delle Femmine, Palermo, Italy, September 20-22, 2023, Revised Selected Papers, Part II (Michael A. Bekos, Markus Chimani, eds.), volume 14466 of Lecture Notes in Computer Science, pages 203–217, 2023, Springer Verlag. |
| [1121] | Fast Convolutions for Near-Convex Sequences 34th International Symposium on Algorithms and Computation, ISAAC 2023, December 3-6, 2023, Kyoto, Japan (Satoru Iwata, Naonori Kakimura, eds.), volume 283 of LIPIcs, pages 16:1–16:16, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. |
| [1120] | Deterministic Constrained Multilinear Detection 48th International Symposium on Mathematical Foundations of Computer Science, MFCS 2023, August 28 to September 1, 2023, Bordeaux, France (Jérôme Leroux, Sylvain Lombardy, David Peleg, eds.), volume 272 of LIPIcs, pages 25:1–25:14, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. |
| [1119] | A Parameterized Theory of PAC Learning Thirty-Seventh AAAI Conference on Artificial Intelligence, AAAI 2023, Thirty-Fifth Conference on Innovative Applications of Artificial Intelligence, IAAI 2023, Thirteenth Symposium on Educational Advances in Artificial Intelligence, EAAI 2023, Washington, DC, USA, February 7-14, 2023 (Brian Williams, Yiling Chen, Jennifer Neville, eds.), pages 6834–6841, 2023, AAAI Press. |
| [1118] | New Complexity-Theoretic Frontiers of Tractability for Neural Network Training Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, NeurIPS 2023, New Orleans, LA, USA, December 10 - 16, 2023, 2023. |
| [1117] | Fixed-Parameter Algorithms for Computing RAC Drawings of Graphs Graph Drawing and Network Visualization - 31st International Symposium, GD 2023, Isola delle Femmine, Palermo, Italy, September 20-22, 2023, Revised Selected Papers, Part II (Michael A. Bekos, Markus Chimani, eds.), volume 14466 of Lecture Notes in Computer Science, pages 66–81, 2023, Springer Verlag. |
| [1116] | On the Complexity of Finding a Sparse Connected Spanning Subgraph in a Non-Uniform Failure Model 18th International Symposium on Parameterized and Exact Computation, IPEC 2023, September 6-8, 2023, Amsterdam, The Netherlands (Neeldhara Misra, Magnus Wahlström, eds.), volume 285 of LIPIcs, pages 4:1–4:12, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. |
| [1115] | The Parameterized Complexity of Network Microaggregation Thirty-Seventh AAAI Conference on Artificial Intelligence, AAAI 2023, Thirty-Fifth Conference on Innovative Applications of Artificial Intelligence, IAAI 2023, Thirteenth Symposium on Educational Advances in Artificial Intelligence, EAAI 2023, Washington, DC, USA, February 7-14, 2023 (Brian Williams, Yiling Chen, Jennifer Neville, eds.), pages 6262–6270, 2023, AAAI Press. |
| [1114] | Extending Orthogonal Planar Graph Drawings Is Fixed-Parameter Tractable 39th International Symposium on Computational Geometry, SoCG 2023, June 12-15, 2023, Dallas, Texas, USA (Erin W. Chambers, Joachim Gudmundsson, eds.), volume 258 of LIPIcs, pages 18:1–18:16, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. |
| [1113] | Multi-Parameter Analysis of Finding Minors and Subgraphs in Edge-Periodic Temporal Graphs SOFSEM 2023: Theory and Practice of Computer Science - 48th International Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2023, Nový Smokovec, Slovakia, January 15-18, 2023, Proceedings (Leszek Gasieniec, ed.), volume 13878 of Lecture Notes in Computer Science, pages 283–297, 2023, Springer Verlag. |
| [1112] | Algorithms for Satisfiability Testing September 2023, SKILL 2023, Gesellschaft für Informatik, Bonn. Note: to appear |
| [1111] | Approximate Evaluation of Quantitative Second Order Queries 2023, arXiv. |
| [1110] | Advancing State Space Search for Static and Dynamic Optimization by Parallelization and Learning May 2023, PhD thesis, Institute of Logic and Computation, TU Wien. Note: supervised by G. R. Raidl |
| [1109] | Computational Optimization Approaches for Distributing Battery Exchange Stations for Electric Scooters Sep 2023, Master's thesis, TU Wien, Institute of Logic and Computation. Note: supervised by G. Raidl and T. Jatschka |
| [1108] | A Learning Multilevel Optimization Approach for a Large Location Allocation Problem May 2023, Master's thesis, TU Wien, Institute of Logic and Computation. Note: supervised by G. Raidl and T. Jatschka |
| [1107] | Hybrid Metaheuristics Based on Large Neighborhood Search and Mixed Integer Linear Programming for the Directed Feedback Vertex Set Problem Jan 2023, Master's thesis, TU Wien, Institute of Logic and Computation. Note: supervised by G. Raidl and J. Varga |
| [1106] | Hybrid Approaches to Sports League Scheduling using Constraint Programming and Simulated Annealing Jan 2023, Master's thesis, TU Wien, Institute of Logic and Computation. Note: supervised by G. Raidl and N. Frohner |
| 2022 | |
| [1105] | 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. |
| [1104] | Hardness Characterisations and Size-Width Lower Bounds for QBF Resolution ACM Transactions on Computational Logic, September 2022, Association for Computing Machinery. |
| [1103] | Initial Learning of Textual Programming at School: Evolution of Outreach Activities OLYMPIADS IN INFORMATICS, pages 43–53, January 2022. |
| [1102] | Multi-level Area Balancing of Clustered Graphs IEEE Trans. Visualization and Computer Graphics, volume 28, number 7, pages 2682–2696, 2022. |
| [1101] | Edge-Path Bundling: A Less Ambiguous Edge Bundling Approach IEEE Trans. Visualization and Computer Graphics, volume 28, number 1, pages 313–323, 2022. |
| [1100] | Computational Methods for Scheduling the Charging and Assignment of an On-Site Shared Electric Vehicle Fleet Access, volume 10, 2022. |
| [1099] | Multicriteria Optimization for Dynamic Demers Cartograms IEEE Trans. Visualization and Computer Graphics, volume 28, number 6, pages 2376–2387, 2022. Note: TVCG Replicability Stamp |
| [1098] | Recognizing Weighted and Seeded Disk Graphs J. Computational Geometry, volume 13, number 1, pages 327–376, 2022. |
| [1097] | Twin-width and generalized coloring numbers Discrete Mathematics, volume 345, number 3, pages 112746, 2022. |
| [1096] | Graph Search and Variable Neighborhood Search for Finding Constrained Longest Common Subsequences in Artificial and Real Gene Sequences Applied Soft Computing, volume 122, pages 108844, 2022. |
| [1095] | Mixed Labeling: Integrating Internal and External Labels IEEE Trans. Visualization and Computer Graphics, volume 28, number 4, pages 1848–1861, 2022. |
| [1094] | Shape-Guided Mixed Metro Map Layout Computer Graphics Forum, volume 41, number 7, pages 495–506, 2022. |
| [1093] | 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. |
| [1092] | Parameterized Algorithms for Queue Layouts J. Graph Algorithms Appl., volume 26, number 3, pages 335–352, 2022. |
| [1091] | Parameterized Algorithms for Queue Layouts J. Graph Algorithms Appl., volume 26, number 3, pages 335–352, 2022. |
| [1090] | An efficient algorithm for counting Markov equivalent DAGs Artificial Intelligence, volume 304, pages 103648, 2022. |
| [1089] | Colored cut games Theoretical Computer Science, volume 936, pages 13–32, 2022. |
| [1088] | Refined Parameterizations for Computing Colored Cuts in Edge-Colored Graphs Theory Comput. Syst., volume 66, number 5, pages 1019–1045, 2022. |
| [1087] | Exploiting \textdollarc\textdollar-Closure in Kernelization Algorithms for Graph Problems SIAM J. Discrete Math., volume 36, number 4, pages 2798–2821, 2022. |
| [1086] | Threshold Treewidth and Hypertree Width Journal of Artificial Intelligence Research, volume 74, pages 1687–1713, 2022. |
| [1085] | Algorithmic Applications of Tree-Cut Width SIAM J. Discrete Math., volume 36, number 4, pages 2635–2666, 2022. |
| [1084] | Sum-of-Products with Default Values: Algorithms and Complexity Results Journal of Artificial Intelligence Research, volume 33, pages 535–552, 2022. |
| [1083] | Preface: Ninth workshop on graph classes, optimization, and Width Parameters, Vienna, Austria Discr. Appl. Math., volume 312, pages 1–2, 2022. |
| [1082] | Removing Popular Faces in Curve Arrangements CoRR, volume abs/2202.12175, 2022. |
| [1081] | Finding a Battleship of Uncertain Shape CoRR, volume abs/2202.08747, 2022. |
| [1080] | On Covering Segments with Unit Intervals SIAM J. Discret. Math., volume 36, number 2, pages 1200–1230, 2022. |
| [1079] | A Large Neighborhood Search for Battery Swapping Station Location Planning for Electric Scooters Chapter in Extended Abstracts of the 18th International Conference on Computer Aided Systems Theory (EUROCAST 2022) (Alexis Quesada-Arencibia, others, eds.), pages 32–33, feb 2022. |
| [1078] | A Large Neighborhood Search for Battery Swapping Station Location Planning for Electric Scooters Chapter in Computer Aided Systems Theory – EUROCAST 2022, volume 13789 of LNCS, pages 121-129, 2022, Springer. |
| [1077] | 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. |
| [1076] | Learning Value Functions for Same-Day Delivery Problems in the Tardiness Regime Chapter in Extended Abstracts of the 18th International Conference on Computer Aided Systems Theory – EUROCAST 2022 (Alexis Quesada-Arencibia, others, eds.), pages 20–21, 2022. |
| [1075] | 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 |
| [1074] | 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. |
| [1073] | 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. Note: best paper award winner |
| [1072] | A Large Neighborhood Search for a Cooperative Optimization Approach to Distribute Service Points in Mobility Applications Metaheuristics and Nature Inspired Computing (Bernabé Dorronsoro, Farouk Yalaoui, El-Ghazali Talbi, Grégoire Danoy, eds.), volume 1541 of CCIS, pages 3–17, 2022, Springer. |
| [1071] | 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. |
| [1070] | Parallel Beam Search for Combinatorial Optimization Fifteenth International Symposium on Combinatorial Search (SoCS 2022), pages 273–275, 2022, AAAI. |
| [1069] | Turbocharging Heuristics for Weak Coloring Numbers European Symposium on Algorithms (ESA 2022) (Shiri Chechik, Gonzalo Navarro, Eva Rotenberg, Grzegorz Herman, eds.), volume 244 of LIPIcs, pages 44:1–44:18, 2022, Schloss Dagstuhl – Leibniz-Zentrum für Informatik. |
| [1068] | Combinatorial and Algorithmic Aspects of Monadic Stability 33rd International Symposium on Algorithms and Computation (ISAAC 2022) (Sang Won Bae, Heejin Park, eds.), volume 248 of Leibniz International Proceedings in Informatics (LIPIcs), pages 11:1–11:17, 2022, Schloss Dagstuhl – Leibniz-Zentrum für Informatik. |
| [1067] | 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. |
| [1066] | 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. |
| [1065] | Minimum Link Fencing Algorithms and Computation (ISAAC'22) (Sang Won Bae, Heejin Park, eds.), volume 248 of LIPIcs, pages 34:1–34:14, 2022, Schloss Dagstuhl – Leibniz-Zentrum für Informatik. |
| [1064] | Compacting Squares: Input-Sensitive In-Place Reconfiguration of Sliding Squares Scandinavian Symposium and Workshops on Algorithm Theory (SWAT'22) (Artur Czumaj, Qin Xin, eds.), volume 227 of LIPIcs, pages 4:1–4:19, 2022, Schloss Dagstuhl – Leibniz-Zentrum für Informatik. |
| [1063] | 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. |
| [1062] | 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. |
| [1061] | 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). |
| [1060] | PACE Solver Description: DAGer - Cutting out Cycles with MaxSAT 17th International Symposium on Parameterized and Exact Computation, IPEC 2022, September 7-9, 2022, Potsdam, Germany (Holger Dell, Jesper Nederlof, eds.), volume 249 of LIPIcs, pages 32:1–32:4, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. |
| [1059] | SAT-Based Local Search for Plane Subgraph Partitions (CG Challenge) 38th International Symposium on Computational Geometry, SoCG 2022, June 7-10, 2022, Berlin, Germany (Xavier Goaoc, Michael Kerber, eds.), volume 224 of LIPIcs, pages 74:1–74:8, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. |
| [1058] | On Critical Node Problems with Vulnerable Vertices Combinatorial Algorithms - 33rd International Workshop, IWOCA 2022, Trier, Germany, June 7-9, 2022, Proceedings (Cristina Bazgan, Henning Fernau, eds.), volume 13270 of Lecture Notes in Computer Science, pages 494–508, 2022, Springer Verlag. |
| [1057] | Pedant: A Certifying DQBF Solver 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 20:1–20:10, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. |
| [1056] | 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. |
| [1055] | Covering Many (Or Few) Edges with k Vertices in Sparse Graphs 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 42:1–42:18, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. |
| [1054] | 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. |
| [1053] | The Complexity of Temporal Vertex Cover in Small-Degree Graphs Thirty-Sixth AAAI Conference on Artificial Intelligence, AAAI 2022, pages 10193–10201, 2022, AAAI Press. |
| [1052] | Parameterised Partially-Predrawn Crossing Number 38th International Symposium on Computational Geometry, SoCG 2022, June 7-10, 2022, Berlin, Germany (Xavier Goaoc, Michael Kerber, eds.), volume 224 of LIPIcs, pages 46:1–46:15, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. |
| [1051] | The Parameterized Complexity of s-Club with Triangle and Seed Constraints Combinatorial Algorithms - 33rd International Workshop, IWOCA 2022, Trier, Germany, June 7-9, 2022, Proceedings (Cristina Bazgan, Henning Fernau, eds.), volume 13270 of Lecture Notes in Computer Science, pages 313–326, 2022, Springer Verlag. |
| [1050] | Slim Tree-Cut Width 17th International Symposium on Parameterized and Exact Computation, IPEC 2022, September 7-9, 2022, Potsdam, Germany (Holger Dell, Jesper Nederlof, eds.), volume 249 of LIPIcs, pages 15:1–15:18, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. |
| [1049] | Hedonic Diversity Games: A Complexity Picture with More than Two Colors Thirty-Sixth AAAI Conference on Artificial Intelligence, AAAI 2022, pages 5034–5042, 2022, AAAI Press. |
| [1048] | The Complexity of k-Means Clustering when Little is Known International Conference on Machine Learning, ICML 2022, 17-23 July 2022, Baltimore, Maryland, USA (Kamalika Chaudhuri, Stefanie Jegelka, Le Song, Csaba Szepesvári, Gang Niu, Sivan Sabato, eds.), volume 162 of Proceedings of Machine Learning Research, pages 6960–6987, 2022, PMLR. |
| [1047] | 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 (Mikolaj Bojanczyk, Emanuela Merelli, David P. Woodruff, eds.), volume 229 of LIPIcs, pages 66:1–66:20, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. |
| [1046] | 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. |
| [1045] | Longest Cycle above Erd\Hos–Gallai Bound 30th Annual European Symposium on Algorithms (ESA 2022), volume 271 of LIPIcs, pages 13:1–13:17, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. |
| [1044] | 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. |
| [1043] | 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. |
| [1042] | 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. |
| [1041] | 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. |
| [1040] | SAT Backdoors: Depth Beats Size 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 46:1–46:18, 2022, Schloss Dagstuhl – Leibniz-Zentrum für Informatik. |
| [1039] | 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. |
| [1038] | The Complexity of Envy-Free Graph Cutting Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence, IJCAI 2022, Vienna, Austria, 23-29 July 2022 (Luc De Raedt, ed.), pages 237–243, 2022, ijcai.org. |
| [1037] | 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. |
| [1036] | Testing Upward Planarity of Partial 2-Trees Graph Drawing and Network Visualization - 30th International Symposium, GD 2022, Tokyo, Japan, September 13-16, 2022, Revised Selected Papers (Patrizio Angelini, Reinhard von Hanxleden, eds.), volume 13764 of Lecture Notes in Computer Science, pages 175–187, 2022, Springer Verlag. |
| [1035] | Parameterized Algorithms for Upward Planarity 38th International Symposium on Computational Geometry, SoCG 2022, June 7-10, 2022, Berlin, Germany (Xavier Goaoc, Michael Kerber, eds.), volume 224 of LIPIcs, pages 26:1–26:16, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. |
| [1034] | 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 |
| [1033] | 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. |
| [1032] | 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 |
| [1031] | 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. |
| [1030] | How to Find a Good Explanation for Clustering? Thirty-Sixth AAAI Conference on Artificial Intelligence, AAAI 2022, pages 3904–3912, 2022, AAAI Press. |
| [1029] | Edge-Cut Width: An Algorithmically Driven Analogue of Treewidth Based on Edge Cuts Graph-Theoretic Concepts in Computer Science - 48th International Workshop, WG 2022, Tübingen, Germany, June 22-24, 2022, Revised Selected Papers (Michael A. Bekos, Michael Kaufmann, eds.), volume 13453 of Lecture Notes in Computer Science, pages 98–113, 2022, Springer Verlag. |
| [1028] | Bounding and Computing Obstacle Numbers of Graphs 30th Annual European Symposium on Algorithms, ESA 2022, September 5-9, 2022, Berlin/Potsdam, Germany (Shiri Chechik, Gonzalo Navarro, Eva Rotenberg, Grzegorz Herman, eds.), volume 244 of LIPIcs, pages 11:1–11:13, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. |
| [1027] | 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. |
| [1026] | 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. |
| [1025] | Computing Treewidth with Constraint Programming pages 115–126, September 2022, SKILL 2022, Gesellschaft für Informatik, Bonn. |
| [1024] | Computational Optimization Approaches for Distributing Service Points for Mobility Applications and Smart Charging of Electric Vehicles feb 2022, PhD thesis, Institute of Logic and Computation, TU Wien. Note: supervised by G. R. Raidl and T. Rodemann |
| [1023] | On Hard Subgraph Problems: Parameterized Algorithms and Efficient Implementations 2022, PhD thesis, University of Marburg, Germany. |
| [1022] | Optimization of Container Transportation for Fixed-Schedule Block Trains with Optional Round Trips in Collaborative Logistics Dec 2022, Master's thesis, TU Wien, Institute of Logic and Computation. Note: supervised by G. Raidl, G. Brandstätter, and U. Ritzinger |
| [1021] | Minimizing Makespan in Flow Shops with a Reinforcement Learning Like Approach May 2022, Master's thesis, TU Wien, Institute of Logic and Computation. Note: supervised by G. Raidl and Marc Huber |
| [1020] | 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 |
| [1019] | Scrambling permutations and related structures: asymptotics and constructions 2022, Master's thesis, TU Wien, Institute of Discrete Mathematics and Geometry. Note: supervised by B. Gittenberger |
| 2021 | |
| [1018] | External Labeling: Fundamental Concepts and Algorithmic Techniques 2021, Morgan & Claypool. |
| [1017] | On the Readability of Abstract Set Visualizations IEEE Trans. Visualization and Computer Graphics, volume 27, number 6, pages 2821–2832, 2021. |
| [1016] | Solving the Longest Common Subsequence Problem Concerning Non-Uniform Distributions of Letters in Input Strings Mathematics, volume 9, number 13, 2021. |
| [1015] | 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. |
| [1014] | Labeling Nonograms: Boundary Labeling for Curve Arrangements Comput. Geom. Theory Appl., volume 98, pages 101791, 2021. |
| [1013] | MetroSets: Visualizing Sets as Metro Maps IEEE Trans. Visualization and Computer Graphics, volume 27, number 2, pages 1257–1267, 2021. |
| [1012] | Smart Charging of Electric Vehicles Considering SOC-Dependent Maximum Charging Powers Energies, volume 14, number 22, 2021. |
| [1011] | A General Cooperative Optimization Approach for Distributing Service Points in Mobility Applications Algorithms, volume 14, number 8, pages 232, 2021. |
| [1010] | 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 |
| [1009] | 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 |
| [1008] | Parameterized Complexity in Graph Drawing (Dagstuhl Seminar 21293) Dagstuhl Reports, volume 11, number 6, pages 82–123, 2021. |
| [1007] | ClusterSets: Optimizing Planar Clusters in Categorical Point Data Computer Graphics Forum, volume 40, number 3, pages 471–481, 2021. |
| [1006] | Measuring what matters: A hybrid approach to dynamic programming with treewidth J. Comput. Syst. Sci., volume 121, pages 57–75, 2021. |
| [1005] | Geometric Planar Networks on Bichromatic Collinear Points Theoretical Computer Science, volume 895, pages 124–136, 2021. |
| [1004] | 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 |
| [1003] | Enumerating connected induced subgraphs: Improved delay and experimental comparison Discr. Appl. Math., volume 303, pages 262–282, 2021. |
| [1002] | Destroying Bicolored $P_3$s by Deleting Few Edges Discret. Math. Theor. Comput. Sci., volume 23, number 1, 2021. |
| [1001] | New Width Parameters for SAT and Sharp-SAT Artificial Intelligence, volume 295, pages 103460, 2021. |
| [1000] | On Structural Parameterizations of the Edge Disjoint Paths Problem Algorithmica, volume 83, number 6, pages 1605–1637, 2021. |
| [999] | The Power of Cut-Based Parameters for Computing Edge-Disjoint Paths Algorithmica, volume 83, number 2, pages 726–752, 2021. |
| [998] | On Structural Parameterizations of the Bounded-Degree Vertex Deletion Problem Algorithmica, volume 83, number 1, pages 297–336, 2021. |
| [997] | On Strict (Outer-)Confluent Graphs J. Graph Algorithms Appl., 2021. |
| [996] | Parameterized k-Clustering: Tractability island Journal of Computer and System Sciences, volume 117, pages 50 - 74, 2021. |
| [995] | Graphs with at most two moplexes Journal of Graph Theory, 2021, Wiley Online Library. |
| [994] | The complexity landscape of decompositional parameters for ILP: Programs with Few Global Variables and Constraints Artificial Intelligence, 2021. |
| [993] | Strong (D)QBF Dependency Schemes via Implication-free Resolution Paths Electron. Colloquium Comput. Complex., pages 135, 2021. |
| [992] | Towards a Polynomial Kernel for Directed Feedback Vertex Set Algorithmica, volume 83, number 5, pages 1201–1221, 2021. |
| [991] | 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. |
| [990] | Stable Visual Summaries for Trajectory Collections Pacific Visualization Symposium (PacificVis'21), pages 61–70, 2021, IEEE. |
| [989] | 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. |
| [988] | 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. |
| [987] | 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. |
| [986] | 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. |
| [985] | 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 |
| [984] | 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. |
| [983] | Disjoint Box Covering in a Rectilinear Polygon European Workshop on Computational Geometry (EuroCG'21), pages 71:1–71:7, 2021. |
| [982] | 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. |
| [981] | 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. |
| [980] | 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. |
| [979] | Worbel: Aggregating Point Labels into Word Clouds Advances in Geographic Information Systems (SIGSPATIAL'21), pages 256–267, 2021, ACM. |
| [978] | 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. |
| [977] | 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. |
| [976] | 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. |
| [975] | Computing Optimal Hypertree Decompositions with SAT Proceeding of IJCAI-21, the 30th International Joint Conference on Artificial Intelligence (Zhi-Hua Zhou, ed.), 2021. |
| [974] | 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. |
| [973] | 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. |
| [972] | First-Order Logic in Finite Domains: Where Semantic Evaluation Competes with SMT Solving Proceedings of the 9th International Symposium on Symbolic Computation in Software Science, SCSS 2021, Hagenberg, Austria, September 8-10, 2021 (Temur Kutsia, ed.), volume 342 of EPTCS, pages 99–113, 2021. |
| [971] | 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 |
| [970] | 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. |
| [969] | Backdoor DNFs Proceeding of IJCAI-2021, the 30th International Joint Conference on Artificial Intelligence (Zhi-Hua Zhou, ed.), pages 1403–1409, 2021. |
| [968] | 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. |
| [967] | Essentially Tight Kernels For (Weakly) Closed Graphs 32nd International Symposium on Algorithms and Computation, ISAAC 2021, December 6-8, 2021, Fukuoka, Japan (Hee-Kap Ahn, Kunihiko Sadakane, eds.), volume 212 of LIPIcs, pages 35:1–35:15, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. |
| [966] | 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. |
| [965] | 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. |
| [964] | Preventing Small (s,t)Cuts by Protecting Edges Graph-Theoretic Concepts in Computer Science - 47th International Workshop, WG 2021, Warsaw, Poland, June 23-25, 2021, Revised Selected Papers (Lukasz Kowalik, Michal Pilipczuk, Pawel Rzazewski, eds.), volume 12911 of Lecture Notes in Computer Science, pages 143–155, 2021, Springer Verlag. |
| [963] | 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. |
| [962] | The Complexity of Bayesian Network Learning: Revisiting the Superstructure Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, NeurIPS 2021, December 6-14, 2021, virtual (Marc'Aurelio Ranzato, Alina Beygelzimer, Yann N. Dauphin, Percy Liang, Jennifer Wortman Vaughan, eds.), pages 430–442, 2021. |
| [961] | 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. |
| [960] | 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. |
| [959] | 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. |
| [958] | 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. |
| [957] | Approximate Evaluation of First-Order Counting Queries Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA 2021), 2021, SIAM. |
| [956] | 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. |
| [955] | Graphs with two moplexes Proceedings of the XI Latin and American Algorithms, Graphs and Optimization Symposium, LAGOS 2021, 2021, Elsevier. |
| [954] | 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. |
| [953] | 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. |
| [952] | 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. |
| [951] | Worbel: Aggregating Point Labels into Word Clouds Proceedings of the International Conference on Advances in Geographic Information Systems 2021 (ACM SIGSPATIAL 2021), 2021. |
| [950] | Exact and heuristic approaches for solving string problems from bioinformatics Dec 2021, PhD thesis, Institute of Logic and Computation, TU Wien. Note: supervised by G. R. Raidl |
| [949] | 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, winner of the Austrian OCG Förderpreis 2022 |
| [948] | 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 |
| [947] | 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 |
| [946] | 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 | |
| [945] | An Iterative Time-Bucket Refinement Algorithm for a High-Resolution Resource-Constrained Project Scheduling Problem International Transactions in Operational Research, jan 2020. |
| [944] | A Survey on Transit Map Layout – from Design, Machine, and Human Perspectives Computer Graphics Forum, volume 39, number 3, pages 619–646, 2020. |
| [943] | A Lower Bound for the Smallest Uniquely Hamiltonian Planar Graph with Minimum Degree Three Applied Mathematics and Computation, volume 380, number 125233, 2020. |
| [942] | A Model for Finding Transition-Minors Discrete Applied Mathematics, volume 228, pages 242–264, 2020. |
| [941] | A Unified Model and Algorithms for Temporal Map Labeling Algorithmica, volume 82, pages 2709–2736, 2020. |
| [940] | Placing Labels in Road Maps: Algorithms and Complexity Algorithmica, volume 82, pages 1881–1908, 2020. |
| [939] | Route Schematization with Landmarks J. Spatial Information Science, volume 21, 2020. |
| [938] | Finding Longest Common Subsequences: New anytime A$^*$ Search Results Applied Soft Computing, volume 95, number 106400, 2020. |
| [937] | 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 |
| [936] | Anytime Algorithms for the Longest Common Palindromic Subsequence Problem Computers & Operations Research, volume 114, pages 104827, 2020, Elsevier. |
| [935] | Solving Longest Common Subsequence Problems via a Transformation to the Maximum Clique Problem Computers & Operations Research, volume 125, number 105089, 2020. Note: previous technical report version at https://www.ac.tuwien.ac.at/files/tr/ac-tr-20-003.pdf |
| [934] | Parameterized Algorithms for Book Embedding Problems J. Graph Algorithms Appl., volume 24, number 4, pages 603–620, 2020. |
| [933] | Parameterized algorithms for Module Map problems Discr. Appl. Math., volume 283, pages 396–416, 2020. |
| [932] | Using decomposition-parameters for QBF: Mind the prefix! J. Comput. Syst. Sci., volume 110, pages 1–21, 2020. |
| [931] | On Existential MSO and Its Relation to ETH ACM Trans. Comput. Theory, volume 12, number 4, pages 22:1–22:32, 2020. |
| [930] | Foreword: Eighth Workshop on Graph Classes, Optimization, and Width Parameters, Toronto, Ontario, Canada Discr. Appl. Math., volume 278, pages 1–2, 2020. |
| [929] | Complexity of independency and cliquy trees Discr. Appl. Math., volume 272, pages 2–15, 2020. |
| [928] | Crossing Layout in Non-planar Graphs Chapter in Beyond Planar Graphs (Seok-Hee Hong, Takeshi Tokuyama, eds.), pages 187–209, 2020, Springer Nature Singapore. |
| [927] | 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. |
| [926] | 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. |
| [925] | Labeling Nonograms European Workshop on Computational Geometry (EuroCG'20), pages 71:1–71:8, 2020. |
| [924] | 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. |
| [923] | 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. |
| [922] | 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. |
| [921] | VNS and PBIG as Optimization Cores in a Cooperative Optimization Approach for Distributing Service Points Computer Aided Systems Theory – EUROCAST 2019, volume 12013 of LNCS, pages 255–262, 2020, Springer. |
| [920] | 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. |
| [919] | 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. |
| [918] | 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. |
| [917] | 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. |
| [916] | 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. |
| [915] | 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. |
| [914] | 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. |
| [913] | 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. |
| [912] | 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. |
| [911] | 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. |
| [910] | 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. |
| [909] | Balanced Independent and Dominating Sets on Colored Interval Graphs European Workshop on Computational Geometry (EuroCG'20), pages 66:1–66:6, 2020. |
| [908] | 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. |
| [907] | 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. |
| [906] | 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. |
| [905] | 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. |
| [904] | 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. |
| [903] | 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. |
| [902] | 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. |
| [901] | 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. |
| [900] | 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). |
| [899] | 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 |
| [898] | Refined Parameterizations for Computing Colored Cuts in Edge-Colored Graphs SOFSEM 2020: Theory and Practice of Computer Science - 46th International Conference on Current Trends in Theory and Practice of Informatics, SOFSEM 2020, Limassol, Cyprus, January 20-24, 2020, Proceedings (Alexander Chatzigeorgiou, Riccardo Dondi, Herodotos Herodotou, Christos A. Kapoutsis, Yannis Manolopoulos, George A. Papadopoulos, Florian Sikora, eds.), volume 12011 of Lecture Notes in Computer Science, pages 248–259, 2020, Springer Verlag. |
| [897] | Colored Cut Games 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 30:1–30:17, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. |
| [896] | 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. |
| [895] | FixCon: A Generic Solver for Fixed-Cardinality Subgraph Problems Proceedings of the Symposium on Algorithm Engineering and Experiments, ALENEX 2020, Salt Lake City, UT, USA, January 5-6, 2020 (Guy E. Blelloch, Irene Finocchi, eds.), pages 12–26, 2020, SIAM. |
| [894] | Computing Dense and Sparse Subgraphs of Weakly Closed Graphs 31st International Symposium on Algorithms and Computation, ISAAC 2020, December 14-18, 2020, Hong Kong, China (Virtual Conference) (Yixin Cao, Siu-Wing Cheng, Minming Li, eds.), volume 181 of LIPIcs, pages 20:1–20:17, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. |
| [893] | Exploiting c-Closure in Kernelization Algorithms for Graph Problems 28th Annual European Symposium on Algorithms, ESA 2020, September 7-9, 2020, Pisa, Italy (Virtual Conference) (Fabrizio Grandoni, Grzegorz Herman, Peter Sanders, eds.), volume 173 of LIPIcs, pages 65:1–65:17, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. |
| [892] | String Factorizations Under Various Collision Constraints 31st Annual Symposium on Combinatorial Pattern Matching, CPM 2020, June 17-19, 2020, Copenhagen, Denmark (Inge Li Gørtz, Oren Weimann, eds.), volume 161 of LIPIcs, pages 17:1–17:14, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. |
| [891] | 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. |
| [890] | 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. |
| [889] | On the Parameterized Complexity of Clustering Incomplete Data into Subspaces of Small Rank Proceeding of AAAI-20, the Thirty-Fourth AAAI Conference on Artificial Intelligence, February 7–12, 2020, New York, pages 3906–3913, 2020, AAAI Press. |
| [888] | 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. |
| [887] | 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. |
| [886] | 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. |
| [885] | 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. |
| [884] | 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. |
| [883] | 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. |
| [882] | 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. |
| [881] | 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. |
| [880] | 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. |
| [879] | 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. |
| [878] | 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. |
| [877] | 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. |
| [876] | 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. |
| [875] | 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. |
| [874] | 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. |
| [873] | 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. |
| [872] | 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. |
| [871] | 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. |
| [870] | 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. |
| [869] | 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. |
| [868] | A Large Neighborhood Search for Distributing Service Points in Mobility Applications with Capacities and Limited Resources 09 2020, Presentation, CPAIOR2020. |
| [867] | 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 |
| [866] | 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 |
| [865] | 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 |
| [864] | 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 | |
| [863] | Metabopolis: scalable network layout for biological pathway diagrams in urban map style BMC Bioinformatics, volume 20, pages 187, 2019. |
| [862] | Exact Approaches for Network Design Problems with Relays INFORMS Journal on Computing, volume 31, number 1, pages 171–192, 2019. |
| [861] | Photonic-integrated circuits with non-planar topologies realized by 3D-printed waveguide overpasses Optics Express, volume 27, number 12, pages 17402–17425, 2019. |
| [860] | Minimizing crossings in constrained two-sided circular graph layouts J. Computational Geometry, volume 10, number 2, pages 45–69, 2019. |
| [859] | Lombardi Drawings of Knots and Links J. Computational Geometry, volume 10, number 1, pages 444–476, 2019. |
| [858] | Snarks with Special Spanning Trees Graphs and Combinatorics, volume 35, number 1, pages 207–219, 2019, Springer. |
| [857] | Job Sequencing with One Common and Multiple Secondary Resources: An A*/Beam Search Based Anytime Algorithm Artificial Intelligence, volume 277, number 103173, 2019. |
| [856] | Short Plane Supports for Spatial Hypergraphs J. Graph Algorithms Appl., volume 23, number 3, pages 463–498, 2019. |
| [855] | On the Readability of Leaders in Boundary Labeling Information Visualization, volume 18, number 1, pages 110–132, 2019. |
| [854] | External Labeling Techniques: A Taxonomy and Survey Computer Graphics Forum, volume 38, number 3, pages 833–860, 2019. |
| [853] | Planar Drawings of Fixed-Mobile Bigraphs Theoretical Computer Science, volume 795, pages 408–419, 2019. |
| [852] | Guidelines for Experimental Algorithmics: A Case Study in Network Analysis Algorithms, volume 12, number 7, pages 127:1–127:37, 2019. |
| [851] | Dependency Learning for QBF Journal of Artificial Intelligence Research, volume 65, pages 180–208, 2019. |
| [850] | Long-Distance Q-Resolution with Dependency Schemes Journal of Automated Reasoning, volume 63, number 1, pages 127–155, 2019. |
| [849] | On the Parameterized Complexity of (k,s)-SAT Information Processing Letters, volume 143, pages 34–36, 2019. |
| [848] | A SAT Approach to Branchwidth ACM Transactions on Computational Logic, volume 20, number 3, pages 15:1–15:24, 2019. |
| [847] | Solving Integer Linear Programs by Exploiting Variable-Constraint Interactions: A Survey Algorithms, volume 12, number 12, pages 248, 2019. |
| [846] | On the Complexity Landscape of Connected f-Factor Problems Algorithmica, volume 81, number 6, pages 2606–2632, 2019. |
| [845] | Parameterized Complexity of Asynchronous Border Minimization Algorithmica, volume 81, number 1, pages 201–223, 2019. |
| [844] | Shrub-Depth: Capturing Height of Dense Graphs Logical Methods in Computer Science, 2019. |
| [843] | Counting linear extensions: Parameterizations by treewidth Algorithmica, 2019. |
| [842] | Compendium of Parameterized Problems at Higher Levels of the Polynomial Hierarchy MDPI Algorithms, volume 12, number 9, pages 1–28, 2019. |
| [841] | 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. |
| [840] | 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 |
| [839] | 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. |
| [838] | 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. |
| [837] | A Memetic Algorithm for Competitive Facility Location Problems Chapter in Business and Consumer Analytics: New Ideas, pages 637–660, 2019, Springer. |
| [836] | 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. |
| [835] | 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. |
| [834] | 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. |
| [833] | A SAT Approach for Finding Sup-Transition-Minors Learning and Intelligent Optimization. LION 2019, volume 11968 of LNCS, pages 325–341, 2019, Springer. |
| [832] | 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. |
| [831] | 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. |
| [830] | 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. |
| [829] | Efficient Segment Folding is Hard Canadian Conference on Computational Geometry (CCCG'19), pages 177–183, 2019. |
| [828] | Exploring Semi-Automatic Map Labeling Advances in Geographic Information Systems (SIGSPATIAL'19), pages 13–22, 2019, ACM. |
| [827] | 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. |
| [826] | 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. |
| [825] | Efficient Non-Segregated Routing for Reconfigurable Demand-Aware Networks IFIP Networking Conference (Networking'19), pages 1–9, 2019, IEEE. |
| [824] | 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. |
| [823] | 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 |
| [822] | 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. |
| [821] | 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. |
| [820] | 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. |
| [819] | 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. |
| [818] | 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. |
| [817] | 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. |
| [816] | 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. |
| [815] | Enumerating Connected Induced Subgraphs: Improved Delay and Experimental Comparison SOFSEM 2019: Theory and Practice of Computer Science - 45th International Conference on Current Trends in Theory and Practice of Computer Science, Nový Smokovec, Slovakia, January 27-30, 2019, Proceedings (Barbara Catania, Rastislav Královic, Jerzy R. Nawrocki, Giovanni Pighizzini, eds.), volume 11376 of Lecture Notes in Computer Science, pages 272–284, 2019, Springer Verlag. |
| [814] | 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. |
| [813] | Destroying Bicolored $P_3$s by Deleting Few Edges Computing with Foresight and Industry - 15th Conference on Computability in Europe, CiE 2019, Durham, UK, July 15-19, 2019, Proceedings (Florin Manea, Barnaby Martin, Daniël Paulusma, Giuseppe Primiero, eds.), volume 11558 of Lecture Notes in Computer Science, pages 193–204, 2019, Springer Verlag. |
| [812] | 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. |
| [811] | 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. |
| [810] | 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). |
| [809] | 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. |
| [808] | 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. |
| [807] | 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. |
| [806] | 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. |
| [805] | 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. |
| [804] | 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. |
| [803] | 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. |
| [802] | 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. |
| [801] | Approximation Algorithms for BalancedCC Multiwinner Rules Proceedings of the 18th International Conference on Autonomous Agents and MultiAgent Systems, AAMAS '19, Montreal, QC, Canada, May 13-17, 2019 (Edith Elkind, Manuela Veloso, Noa Agmon, Matthew E. Taylor, eds.), pages 494–502, 2019, International Foundation for Autonomous Agents and Multiagent Systems. |
| [800] | 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. |
| [799] | 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 |
| [798] | Patient Scheduling in Particle Therapy mar 2019, PhD thesis, Institute of Logic and Computation, TU Wien. Note: supervised by G. R. Raidl |
| [797] | 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 |
| [796] | Perfect Pseudo Matchings on Snarks may 2019, Master's thesis, TU Wien, Institute of Logic and Computation. Note: supervised by G. Raidl |
| [795] | 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 |
| [794] | 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 |
| [793] | 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 | |
| [792] | Exact approaches for the directed network design problem with relays Omega, 2018. |
| [791] | Solving a Selective Dial-a-Ride Problem with Logic-based Benders Decomposition Computers & Operations Research, volume 96, pages 30–54, 2018. |
| [790] | Drawing Large Graphs by Multilevel Maxent-Stress Optimization IEEE Trans. Visualization and Computer Graphics, volume 24, number 5, pages 1814–1827, 2018. |
| [789] | Particle Therapy Patient Scheduling with Limited Starting Time Variations of Daily Treatments International Transactions in Operational Research, 2018. |
| [788] | Scalable Set Visualizations (Dagstuhl Seminar 17332) Dagstuhl Reports, volume 7, number 8, pages 1–22, 2018. |
| [787] | Planar and poly-arc Lombardi drawings J. Computational Geometry, volume 9, number 1, pages 328–355, 2018. |
| [786] | 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 |
| [785] | The complexity landscape of decompositional parameters for ILP Artificial Intelligence, volume 257, pages 61–71, 2018. |
| [784] | Meta-kernelization using well-structured modulators Discr. Appl. Math., volume 248, pages 153–167, 2018. |
| [783] | Solving Problems on Graphs of High Rank-Width Algorithmica, volume 80, number 2, pages 742–771, 2018. |
| [782] | On the complexity of rainbow coloring problems Discr. Appl. Math., volume 246, pages 38–48, 2018. |
| [781] | A single-exponential fixed-parameter algorithm for distance-hereditary vertex deletion Journal of Computer and System Sciences, volume 97, pages 121–146, 2018. |
| [780] | Graph Visualization Chapter in Encyclopedia of Big Data Technologies (Sherif Sakr, Albert Zomaya, eds.), 2018, Springer International Publishing. |
| [779] | 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. |
| [778] | Semi-Automated Location Planning for Urban Bike-Sharing Systems Proceedings of the 7th Transport Research Arena (TRA 2018), pages 1–10, 2018. |
| [777] | Particle Therapy Patient Scheduling: Time Estimation for Scheduling Sets of Treatments Computer Aided Systems Theory – EUROCAST 2017, Part I, pages 364–372, 2018, Springer. |
| [776] | 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. |
| [775] | 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. |
| [774] | 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. |
| [773] | 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. |
| [772] | 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. |
| [771] | 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. |
| [770] | 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. |
| [769] | 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. |
| [768] | 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. |
| [767] | 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. |
| [766] | 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. |
| [765] | 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. |
| [764] | 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. |
| [763] | 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. |
| [762] | Parameterized Algorithms for Module Map Problems Combinatorial Optimization - 5th International Symposium, ISCO 2018, Marrakesh, Morocco, April 11-13, 2018, Revised Selected Papers (Jon Lee, Giovanni Rinaldi, Ali Ridha Mahjoub, eds.), volume 10856 of Lecture Notes in Computer Science, pages 376–388, 2018, Springer Verlag. |
| [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] | Visibility Based Obstacle Placing – Automated Obstacle Placing Based on Circularity Jan 2016, Master's thesis, TU Wien, Institute of Computer Graphics and Algorithms. Note: supervised by G. Raidl and R. Schaffranek |
| [619] | 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 |
| [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 9472 of LNCS, pages 637–649, 2015, Springer Berlin Heidelberg. |
| [590] | Drawing Large Graphs by Multilevel Maxent-Stress Optimization Graph Drawing (GD'15) (Emilio Di Giacomo, Anna Lubiw, eds.), volume 9411 of LNCS, pages 30–43, 2015, Springer International Publishing. |
| [589] | Towards Realistic Flow Control in Power Grid Operation Energy Informatics (EI'15) (Sebastian Gottwalt, Lukas König, Hartmut Schmeck, eds.), volume 9424 of LNCS, pages 192–199, 2015, Springer International Publishing. |
| [588] | CPU Versus GPU Parallelization of an Ant Colony Optimization for the Longest Common Subsequence Problem Computer Aided Systems Theory – EUROCAST 2015, volume 9520 of LNCS, pages 401–408, 2015, Springer. |
| [587] | Mixed Map Labeling Algorithms and Complexity (CIAC'15) (V. Th. Paschos, Peter Widmayer, eds.), volume 9079 of LNCS, pages 339–351, 2015, Springer International Publishing. |
| [586] | Operating Power Grids with Few Flow Control Buses Future Energy Systems (e-Energy'15), pages 289–294, 2015, ACM. |
| [585] | On Solving the Most Strings With Few Bad Columns Problem: An ILP Model and Heuristics Proceedings of the 2015 International Symposium on Innovations in Intelligent Systems and Applications (INISTA) (David Camacho, others, eds.), pages 1-8, 2015, IEEE Xplore. |
| [584] | Combinatorial Properties of Triangle-Free Rectangle Arrangements and the Squarability Problem Graph Drawing (GD'15) (Emilio Di Giacomo, Anna Lubiw, eds.), volume 9411 of LNCS, pages 231–244, 2015, Springer International Publishing. |
| [583] | On Minimizing Crossings in Storyline Visualizations Graph Drawing (GD'15) (Emilio Di Giacomo, Anna Lubiw, eds.), volume 9411 of LNCS, pages 192–198, 2015, Springer International Publishing. |
| [582] | Recognizing Weighted Disk Contact Graphs Graph Drawing (GD'15) (Emilio Di Giacomo, Anna Lubiw, eds.), volume 9411 of LNCS, pages 433–446, 2015, Springer International Publishing. |
| [581] | A Cluster-First Route-Second Approach for Balancing Bicycle Sharing Systems Extended Abstracts of the Fifthteenth International Conference on Computer Aided Systems Theory (EUROCAST 2015) (Alexis Quesada-Arencibia, José Carlos Rodriguez, Roberto Moreno-Díaz jr., Roberto Moreno-Díaz, eds.), pages 125–126, 2015. |
| [580] | A New Solution Representation for the Firefighter Problem Evolutionary Computation in Combinatorial Optimization – EvoCOP 2015 (Gabriela Ochoa, Francisco Chicano, eds.), volume 9026 of LNCS, pages 25–35, 2015, Springer. |
| [579] | Label Placement in Road Maps Algorithms and Complexity (CIAC'15) (V. Th. Paschos, Peter Widmayer, eds.), volume 9079 of LNCS, pages 221–234, 2015, Springer International Publishing. |
| [578] | A Value-Correction Construction Heuristic for the Two-Dimensional Cutting Stock Problem with Variable Sheet Size Extended Abstracts of the Fifthteenth International Conference on Computer Aided Systems Theory (EUROCAST 2015) (Alexis Quesada-Arencibia, José Carlos Rodriguez, Roberto Moreno-Díaz jr., Roberto Moreno-Díaz, eds.), pages 109–110, 2015. |
| [577] | A Scalable Approach for the K-Staged Two-Dimensional Cutting Stock Problem with Variable Sheet Size Computer Aided Systems Theory – EUROCAST 2015, volume 9520 of LNCS, pages 384–392, 2015, Springer. |
| [576] | Solving the 3-Staged 2-Dimensional Cutting Stock Problem by Dynamic Programming and Variable Neighborhood Search The 3rd International Conference on Variable Neighborhood Search (VNS'14), volume 47 of Electronic Notes in Discrete Mathematics, pages 133–140, 2015, Elsevier. |
| [575] | Heuristic Approaches for the Probabilistic Traveling Salesman Problem Computer Aided Systems Theory – EUROCAST 2015 (Roberto Moreno-Díaz, Franz Pichler, Alexis Quesada-Arencibia, eds.), volume 9520 of LNCS, pages 342–349, 2015, Springer International Publishing Switzerland. |
| [574] | A Genetic Algorithm for the Capacity and Distance Constrained Plant Location Problem Proceedings of the 11th Metaheuristics International Conference, pages 89/1–89/9, 2015. |
| [573] | A Variable Neighborhood Search for the Generalized Vehicle Routing Problem with Stochastic Demands Evolutionary Computation in Combinatorial Optimization – EvoCOP 2015 (Gabriela Ochoa, Francisco Chicano, eds.), volume 9026 of LNCS, pages 48–60, 2015, Springer. |
| [572] | On the Readability of Boundary Labeling Graph Drawing (GD'15) (Emilio Di Giacomo, Anna Lubiw, eds.), volume 9411 of LNCS, pages 515–527, 2015, Springer International Publishing. |
| [571] | A New Type of Metamodel for Longitudinal Dynamics Optimization of Hybrid Electric Vehicles Computer Aided Systems Theory – EUROCAST 2015 (Roberto Moreno-Díaz, others, eds.), volume 9520 of LNCS, pages 425–432, 2015, Springer International Publishing Switzerland. |
| [570] | Towards Realistic Pedestrian Route Planning Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS'15) (Giuseppe F. Italiano, Marie Schmidt, eds.), volume 48 of OpenAccess Series in Informatics (OASIcs), pages 1–15, 2015, Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik. |
| [569] | Improving the Efficiency of Dynamic Programming on Tree Decompositions via Machine Learning Proceedings of IJCAI 2015, the 24th International Joint Conference on Artificial Intelligence, July 25–31, 2015, Buenos Aires, Argentina (Qiang Yang, Michael Wooldridge, eds.), pages 275–282, 2015. |
| [568] | On the Parameterized Complexity of Girth and Connectivity Problems on Linear Matroids Algorithms and Data Structures - 14th International Symposium, WADS 2015, Victoria, BC, Canada, August 5-7, 2015. Proceedings, pages 566–577, 2015. |
| [567] | Linear Time Parameterized Algorithms for Subset Feedback Vertex Set Automata, Languages, and Programming - 42nd International Colloquium, ICALP 2015, Kyoto, Japan, July 6-10, 2015, Proceedings, Part I, pages 935–946, 2015. |
| [566] | Reconfiguration on Sparse Graphs Algorithms and Data Structures - 14th International Symposium, WADS 2015, Victoria, BC, Canada, August 5-7, 2015. Proceedings, pages 506–517, 2015. |
| [565] | Variable-Deletion Backdoors to Planning Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence, January 25-30, 2015, Austin, Texas, USA. (Blai Bonet, Sven Koenig, eds.), pages 3305–3312, 2015, AAAI Press. |
| [564] | Community Structure Inspired Algorithms for SAT and #SAT 18th International Conference on Theory and Applications of Satisfiability Testing (SAT 2015), September 24-27, 2015, Austin, Texas (Marijn Heule, Sean Weaver, eds.), pages 223-237, 2015, Springer Verlag. |
| [563] | Parameterized Complexity of Asynchronous Border Minimization Theory and Applications of Models of Computation - 12th Annual Conference, TAMC 2015, Singapore, May 18-20, 2015, Proceedings (Rahul Jain, Sanjay Jain, Frank Stephan, eds.), volume 9076 of Lecture Notes in Computer Science, pages 428–440, 2015, Springer Verlag. |
| [562] | Algorithmic Applications of Tree-Cut Width Mathematical Foundations of Computer Science 2015 - 40th International Symposium, MFCS 2015, Milan, Italy, August 24-28, 2015, Proceedings, Part II, volume 9235 of Lecture Notes in Computer Science, pages 348–360, 2015, Springer Verlag. |
| [561] | Parameterized Algorithms for Parity Games Mathematical Foundations of Computer Science 2015 - 40th International Symposium, MFCS 2015, Milan, Italy, August 24-28, 2015, Proceedings, Part II (Giuseppe F. Italiano, Giovanni Pighizzini, Donald Sannella, eds.), volume 9235 of Lecture Notes in Computer Science, pages 336–347, 2015, Springer Verlag. |
| [560] | FO Model Checking on Posets of Bounded Width IEEE 56th Annual Symposium on Foundations of Computer Science, FOCS 2015, Berkeley, CA, USA, 17-20 October, 2015, pages 963–974, 2015. |
| [559] | Solving d-SAT via Backdoors to Small Treewidth Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2015, San Diego, CA, USA, January 4-6, 2015, pages 630–641, 2015. |
| [558] | Parameterized Complexity Results for Agenda Safety in Judgment Aggregation Proceedings of AAMAS 2015, the 14th International Conference on Autonomous Agents and Multiagent Systems (Gerhard Weiss, Pinar Yolum, Rafael H. Bordini, Edith Elkind, eds.), pages 127–136, 2015, IFAAMAS/ACM. |
| [557] | Complexity of the Winner Determination Problem in Judgment Aggregation: Kemeny, Slater, Tideman, Young Proceedings of AAMAS 2015, the 14th International Conference on Autonomous Agents and Multiagent Systems, 2015, IFAAMAS/ACM. |
| [556] | Meta-Kernelization using Well-Structured Modulators Parameterized and Exact Computation - 10th International Symposium, IPEC 2014, Patras, Greece, September 16-18, 2015. Revised Selected Papers (Thore Husfeldt, Iyad A. Kanj, eds.), volume 43 of LIPIcs, pages 114–126, 2015. |
| [555] | Solving Problems on Graphs of High Rank-Width Algorithms and Data Structures Symposium (WADS 2015), August 5-7, 2015, University of Victoria, BC, Canada, pages 314–326, 2015, Springer Verlag. |
| [554] | On the Complexity of Rainbow Coloring Problems Combinatorial Algorithms - 26th International Workshop, IWOCA 2015, Verona, Italy, October 5-7, 2015, Revised Selected Papers (Zsuzsanna Lipták, William F. Smyth, eds.), pages 209–220, 2015. |
| [553] | A Dichotomy Result for Ramsey Quantifiers Proceedings of WoLLIC 2015, the 22nd International Workshop on Logic, Language, Information, and Computation, 2015, Springer Verlag. |
| [552] | Fixed-parameter Tractable Reductions to SAT for Planning Proceedings of IJCAI 2015, the 24th International Joint Conference on Artificial Intelligence, July 25–31, 2015, Buenos Aires, Argentina, 2015. |
| [551] | On Compiling Structured CNFs to OBDDs Computer Science - Theory and Applications - 10th International Computer Science Symposium in Russia, CSR 2015, Listvyanka, Russia, July 13-17, 2015, Proceedings, pages 80–93, 2015. |
| [550] | First-Order Queries on Finite Abelian Groups 24th EACSL Annual Conference on Computer Science Logic, CSL 2015, September 7-10, 2015, Berlin, Germany, pages 41–59, 2015. |
| [549] | On Compiling CNFs into Structured Deterministic DNNFs Theory and Applications of Satisfiability Testing - SAT 2015 - 18th International Conference, Austin, TX, USA, September 24-27, 2015, Proceedings, pages 199–214, 2015. |
| [548] | Metric Dimension of Bounded Width Graphs Mathematical Foundations of Computer Science 2015 - 40th International Symposium, MFCS 2015, Milan, Italy, August 24-28, 2015, Proceedings, Part II, pages 115–126, 2015. |
| [547] | Solving the Travelling Thief Problem with an Evolutionary Algorithm Sep 2015, Master's thesis, TU Wien, Institute of Computer Graphics and Algorithms. Note: supervised by G. Raidl and B. Hu |
| [546] | Electric Vehicles Recharge Scheduling with Logic-Based Benders Decomposition Jul 2015, Master's thesis, TU Wien, Institute of Computer Graphics and Algorithms. Note: supervised by G. Raidl and M. Riedler |
| [545] | Optimization Approaches for Recreational Bicycle Tour Planning Apr 2015, Master's thesis, TU Wien, Institute of Computer Graphics and Algorithms. Note: supervised by M. Prandtstetter and G. Raidl |
| [544] | Solving the Multi-Objective Steiner Tree Problem with Resources Jan 2015, Master's thesis, TU Wien, Institute of Computer Graphics and Algorithms. Note: supervised by M. Leitner, M. Ruthmair, and G. Raidl |
| [543] | An Overview of Non-Uniform Parameterized Complexity 2015, Technical report TR15-130, Electronic Colloquium on Computational Complexity (ECCC). |
| 2014 | |
| [542] | On d-regular schematization of embedded paths Comput. Geom. Theory Appl., volume 47, number 3A, pages 381–406, 2014. |
| [541] | Tractable answer-set programming with weight constraints: bounded treewidth is not enough Theory Pract. Log. Program., volume 14, number 2, pages 141-164, 2014. |
| [540] | Faster Parameterized Algorithms Using Linear Programming ACM Transactions on Algorithms, volume 11, number 2, pages 15:1–15:31, 2014. |
| [539] | Guarantees and limits of preprocessing in constraint satisfaction and reasoning Artificial Intelligence, volume 216, pages 1-19, 2014. |
| [538] | Lower bounds on the complexity of MSO1 model-checking J. Comput. Syst. Sci., volume 80, number 1, pages 180–194, 2014. |
| [537] | Digraph width measures in parameterized algorithmics Discrete Applied Mathematics, volume 168, pages 88–107, 2014. |
| [536] | Unification and Projectivity in De Morgan and Kleene Algebras Order, volume 31, number 2, pages 159–187, 2014. |
| [535] | Scalability Considerations for Multivariate Graph Visualization Chapter in Multivariate Network Visualization (Andreas Kerren, Helen C. Purchase, Matthew O. Ward, eds.), volume 8380 of LNCS, pages 207–235, 2014, Springer International Publishing. |
| [534] | Reducing the Number of Simulations in Operation Strategy Optimization for Hybrid Electric Vehicles Chapter in Applications of Evolutionary Computation (Anna I. Esparcia-Alcázar, Antonio M. Mora, eds.), pages 553-564, 2014, Springer. |
| [533] | A survey on automated metro map layout methods Schematic Mapping Workshop, apr 2014. |
| [532] | Boosting an Exact Logic-Based Benders Decomposition Approach by Variable Neighborhood Search Proceedings of the 3rd International Conference on Variable Neighborhood Search, volume 47 of Electronic Notes in Discrete Mathematics, pages 149–156, 2014, Elsevier. |
| [531] | Speeding up Logic-Based Benders' Decomposition by a Metaheuristic for a Bi-Level Capacitated Vehicle Routing Problem Hybrid Metaheuristics, 9th Int. Workshop, HM 2014 (Maria J. Blesa, Christain Blum, Stefan Voß, eds.), volume 8457 of LNCS, pages 183–197, 2014, Springer. |
| [530] | Balancing Bicycle Sharing Systems: An Analysis of Path Relinking and Recombination within a GRASP Hybrid Parallel Problem Solving from Nature – PPSN XIII (Thomas Bartz-Beielstein, Jürgen Branke, Bogdan Filipic, Jim Smith, eds.), volume 8672 of LNCS, pages 792–801, 2014, Springer. |
| [529] | On Self-Approaching and Increasing-Chord Drawings of 3-Connected Planar Graphs Graph Drawing (GD'14) (Christian A. Duncan, Antonios Symvonis, eds.), volume 8871 of LNCS, pages 476–487, 2014, Springer Berlin Heidelberg. |
| [528] | Minimum Tree Supports for Hypergraphs and Low-Concurrency Euler Diagrams Algorithm Theory (SWAT'14) (R. Ravi, I. L. Gørtz, eds.), volume 8503 of LNCS, pages 253–264, 2014, Springer International Publishing. |
| [527] | Balancing Bicycle Sharing Systems: An Approach for the Dynamic Case Evolutionary Computation in Combinatorial Optimization – EvoCOP 2014 (Christian Blum, Gabriela Ochoa, eds.), volume 8600 of LNCS, pages 73–84, 2014, Springer. |
| [526] | An Efficient Variable Neighborhood Search Solving a Robust Dynamic Facility Location Problem in Emergency Service Network Proceedings of the 3rd International Conference on Variable Neighborhood Search, volume 47 of Electronic Notes in Discrete Mathematics, pages 261–268, 2014, Elsevier. |
| [525] | Variable Neighbourhood Search for Integrated Timetable Design of Railway Infrastructure Proceedings of the 3rd International Conference on Variable Neighborhood Search, volume 47 of Electronic Notes in Discrete Mathematics, pages 141–148, 2014, Elsevier. |
| [524] | A Metaheuristic Approach for Integrated Timetable based Design of Railway Infrastructure Proceedings of the 3rd International Conference on Road and Rail Infrastructure CETRA 2014 (S. Lakusic, others, eds.), pages 691–696, 2014, Department of Transportation, University of Zagreb. |
| [523] | Evaluation of Labeling Strategies for Rotating Maps Experimental Algorithms (SEA'14) (Joachim Gudmundsson, J. Katajainen, eds.), volume 8504 of LNCS, pages 235–246, 2014, Springer International Publishing. |
| [522] | A Variable Neighborhood Search Using Very Large Neighborhood Structures for the 3-Staged 2-Dimensional Cutting Stock Problem Hybrid Metaheuristics, 9th Int. Workshop, HM 2014 (Maria J. Blesa, Christain Blum, Stefan Voß, eds.), volume 8457 of LNCS, pages 85–99, 2014, Springer. |
| [521] | PIGRA – A Tool for Pixelated Graph Representations Graph Drawing (GD'14) (Christian A. Duncan, Antonios Symvonis, eds.), volume 8871 of LNCS, pages 513–514, 2014, Springer Berlin Heidelberg. Note: Poster abstract |
| [520] | An Evolutionary Algorithm for the Leader-Follower Facility Location Problem with Proportional Customer Behavior Conference Proceedings of Learning and Intelligent Optimization Conference (LION 8), volume 8426 of LNCS, pages 203–217, 2014, Springer. |
| [519] | Semantic Word Cloud Representations: Hardness and Approximation Algorithms Theoretical Informatics (LATIN'14) (Alfredo Viola, ed.), volume 8392 of LNCS, pages 514–525, 2014, Springer Berlin Heidelberg. |
| [518] | Simultaneous Embeddability of Two Partitions Graph Drawing (GD'14) (Christian A. Duncan, Antonios Symvonis, eds.), volume 8871 of LNCS, pages 64–75, 2014, Springer Berlin Heidelberg. |
| [517] | Variable Dependencies and Q-Resolution Theory and Applications of Satisfiability Testing - SAT 2014 - 17th International Conference, Held as Part of the Vienna Summer of Logic, VSL 2014, Vienna, Austria, July 14-17, 2014. Proceedings (Carsten Sinz, Uwe Egly, eds.), volume 8561 of Lecture Notes in Computer Science, pages 269–284, 2014, Springer Verlag. |
| [516] | Linear Time Parameterized Algorithms via Skew-Symmetric Multicuts Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2014, Portland, Oregon, USA, January 5-7, 2014, pages 1739–1748, 2014. |
| [515] | Vertex Exponential Algorithms for Connected f-Factors 34th International Conference on Foundation of Software Technology and Theoretical Computer Science, FSTTCS 2014, December 15-17, 2014, New Delhi, India, pages 61–71, 2014. |
| [514] | A Parameterized Study of Maximum Generalized Pattern Matching Problems Parameterized and Exact Computation - 9th International Symposium, IPEC 2014, Wroclaw, Poland, September 10-12, 2014. Revised Selected Papers (Marek Cygan, Pinar Heggernes, eds.), volume 8894 of Lecture Notes in Computer Science, pages 270–281, 2014, Springer Verlag. |
| [513] | Backdoors to Planning Proceedings of the Twenty-Eighth AAAI Conference on Artificial Intelligence, July 27 -31, 2014, Québec City, Québec, Canada. (Carla E. Brodley, Peter Stone, eds.), pages 2300–2307, 2014, AAAI Press. |
| [512] | Parameterized Approximations via d-Skew-Symmetric Multicut Mathematical Foundations of Computer Science 2014 - 39th International Symposium, MFCS 2014, Budapest, Hungary, August 25-29, 2014. Proceedings, Part II, pages 457–468, 2014. |
| [511] | Parameterized and Subexponential-Time Complexity of Satisfiability Problems and Applications Combinatorial Optimization and Applications - 8th International Conference, COCOA 2014, Wailea, Maui, HI, USA, December 19-21, 2014, Proceedings (Zhao Zhang, Lidong Wu, Wen Xu, Ding-Zhu Du, eds.), volume 8881 of Lecture Notes in Computer Science, pages 637–651, 2014, Springer Verlag. |
| [510] | Backdoors into Heterogeneous Classes of SAT and CSP Proceedings of the Twenty-Eighth AAAI Conference on Artificial Intelligence, July 27-31, 2014, Québec City, Québec, Canada. (Carla E. Brodley, Peter Stone, eds.), pages 2652-2658, 2014, AAAI Press. |
| [509] | Finite Integer Index of Pathwidth and Treewidth Parameterized and Exact Computation - 9th International Symposium, IPEC 2014, Wroclaw, Poland, September 10-12, 2014. Revised Selected Papers (Marek Cygan, Pinar Heggernes, eds.), volume 8894 of Lecture Notes in Computer Science, pages 258–269, 2014, Springer Verlag. |
| [508] | Faster Existential FO Model Checking on Posets Algorithms and Computation - 25th International Symposium, ISAAC 2014, Jeonju, Korea, December 15-17, 2014, Proceedings (Hee-Kap Ahn, Chan-Su Shin, eds.), volume 8889 of Lecture Notes in Computer Science, pages 441–451, 2014, Springer Verlag. |
| [507] | Parameterized Complexity Results for Agenda Safety in Judgment Aggregation Proceedings of ComSoc'14, Fifth International Workshop on Computational Social Choice Pittsburgh, Pennsylvania, June 23-25, 2014, pages 127–136, 2014. |
| [506] | Fixed-Parameter Tractable Reductions to SAT Theory and Applications of Satisfiability Testing - SAT 2014 - 17th International Conference, Held as Part of the Vienna Summer of Logic, VSL 2014, Vienna, Austria, July 14-17, 2014. Proceedings (Uwe Egly, Carsten Sinz, eds.), volume 8561 of Lecture Notes in Computer Science, pages 85-102, 2014, Springer Verlag. |
| [505] | The Parameterized Complexity of Reasoning Problems Beyond NP Principles of Knowledge Representation and Reasoning: Proceedings of the Fourteenth International Conference, KR 2014, Vienna, Austria, July 20-24, 2014 (Chitta Baral, Giuseppe De Giacomo, Thomas Eiter, eds.), pages 82–91, 2014, AAAI Press. |
| [504] | Subexponential Time Complexity of CSP with Global Constraints Principles and Practice of Constraint Programming - 20th International Conference, CP 2014, Lyon, France, September 8-12, 2014. Proceedings (Barry O'Sullivan, ed.), volume 8656 of Lecture Notes in Computer Science, pages 272-288, 2014, Springer Verlag. |
| [503] | Small Unsatisfiable Subsets in Constraint Satisfaction 26th IEEE International Conference on Tools with Artificial Intelligence, ICTAI 2014, Limassol, Cyprus, November 10-12, 2014, pages 429–436, 2014, IEEE. |
| [502] | Quantified Conjunctive Queries on Partially Ordered Sets Parameterized and Exact Computation - 9th International Symposium, IPEC 2014, Wroclaw, Poland, September 10-12, 2014. Revised Selected Papers (Marek Cygan, Pinar Heggernes, eds.), volume 8894 of Lecture Notes in Computer Science, pages 122–134, 2014, Springer Verlag. |
| [501] | Model checking existential logic on partially ordered sets Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), CSL-LICS '14, Vienna, Austria, July 14 - 18, 2014 (Thomas A. Henzinger, Dale Miller, eds.), pages 21:1–21:10, 2014, ACM. |
| [500] | The Complexity of Width Minimization for Existential Positive Queries Proc. 17th International Conference on Database Theory (ICDT), Athens, Greece, March 24-28, 2014., pages 235–244, 2014. |
| [499] | On the Kernelization Complexity of String Problems Computing and Combinatorics - 20th International Conference, COCOON 2014, Atlanta, GA, USA, August 4-6, 2014. Proceedings, pages 141–153, 2014. |
| [498] | Parameterized Algorithms to Preserve Connectivity Automata, Languages, and Programming - 41st International Colloquium, ICALP 2014, Copenhagen, Denmark, July 8-11, 2014, Proceedings, Part I, pages 800–811, 2014. |
| [497] | Heuristic Solution Approaches for the Two Dimensional Pre-Marshalling Problem Jun 2014, Master's thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms. Note: supervised by G. Raidl |
| [496] | Pfadsuche in einer Triangulation Reduction im Mammoth Massive Multiplayer Online Research Framework May 2014, Master's thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms. Note: supervised by G. Raidl |
| [495] | A Hybrid Algorithm for the Partition Coloring Problem Feb 2014, Master's thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms. Note: supervised by G. Raidl |
| [494] | Applying Ant Colony Optimization to the Periodic Vehicle Routing Problem with Time Windows Feb 2014, Master's thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms. Note: supervised by G. Raidl |
| [493] | Finding Longest Common Subsequences by GPU-Based Parallel Ant Colony Optimization Feb 2014, Master's thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms. Note: supervised by G. Raidl |
| [492] | Compendium of Parameterized Problems at Higher Levels of the Polynomial Hierarchy 2014, Technical report TR14-143, Electronic Colloquium on Computational Complexity (ECCC). |
| 2013 | |
| [491] | Proceedings of the 10th Metaheuristics International Conference (Hoong Chuin Lau, Günther R. Raidl, Patrick van Hentenryck, eds.), 2013. |
| [490] | Parameterized and Exact Computation - 8th International Symposium, IPEC 2013, Sophia Antipolis, France, September 4-6, 2013, Revised Selected Papers (Gregory Gutin, Stefan Szeider, eds.), volume 8246 of Lecture Notes in Computer Science, 2013, Springer Verlag. Note: ISBN 978-3-319-03897-1 |
| [489] | Edge-weighted contact representations of planar graphs J. Graph Algorithms Appl., volume 17, number 4, pages 441–473, 2013. |
| [488] | Stabilizing Branch-and-Price for Constrained Tree Problems Networks, volume 61, number 2, pages 150–170, 2013. Note: previous technical report version at https://www.ac.tuwien.ac.at/files/pub/leitner-11e.pdf |
| [487] | Drawing Graphs and Maps with Curves (Dagstuhl Seminar 13151) Dagstuhl Reports, volume 3, number 4, pages 34–68, 2013. |
| [486] | Optimal 3D Angular Resolution for Low-Degree Graphs J. Graph Algorithms Appl., volume 17, number 3, pages 173–200, 2013. |
| [485] | Drawing Trees with Perfect Angular Resolution and Polynomial Area Discrete and Computational Geometry, volume 49, number 2, pages 157–182, 2013. |
| [484] | Parameterized Complexity Results for Exact Bayesian Network Structure Learning Journal of Artificial Intelligence Research, volume 46, pages 263-302, 2013. |
| [483] | Satisfiability of acyclic and almost acyclic CNF formulas Theoretical Computer Science, volume 481, pages 85-99, 2013. |
| [482] | A Polynomial Kernel for Feedback Arc Set on Bipartite Tournaments Theory Comput. Syst., volume 53, number 4, pages 609–620, 2013. |
| [481] | Cops-and-robbers: remarks and problems Journal of Combinatorial Mathematics and Combinatorial Computing, volume 85, pages 141–159, 2013. |
| [480] | A unified approach to polynomial algorithms on graphs of bounded (bi-)rank-width Eur. J. Comb., volume 34, number 3, pages 680–701, 2013. |
| [479] | Better Algorithms for Satisfiability Problems for Formulas of Bounded Rank-width Fundam. Inform., volume 123, number 1, pages 59–76, 2013. |
| [478] | Polynomial space hardness without disjunction property Theor. Comput. Sci., volume 467, pages 1–11, 2013. |
| [477] | Generic expression hardness results for primitive positive formula comparison Inf. Comput., volume 222, pages 108–120, 2013. |
| [476] | A Timeslot-Filling Based Heuristic Approach to Construct High-School Timetables Chapter in Advances in Metaheuristics (Luca Di Gaspero, Andrea Schaerf, Thomas Stützle, eds.), volume 53 of Operations Research/Computer Science Interfaces Series, pages 143–158, 2013, Springer. |
| [475] | An Optimization Model for Integrated Timetable Based Design of Railway Infrastructure Proceedings of the 5th International Seminar on Railway Operations Modelling and Analysis – RailCopenhagen 2013, pages 765–774, 2013, IAROR. |
| [474] | Balancing Bicycle Sharing Systems: A Variable Neighborhood Search Approach Evolutionary Computation in Combinatorial Optimisation – 13th European Conference, EvoCOP 2013 (M. Middendorf, C. Blum, eds.), volume 7832 of LNCS, pages 121-132, 2013, Springer. |
| [473] | Balancing Bicycle Sharing Systems: Improving a VNS by Efficiently Determining Optimal Loading Operations Hybrid Metaheuristics, 8th Int. Workshop, HM 2013 (M. J. Blesa, others, eds.), volume 7919 of LNCS, pages 130–143, 2013, Springer. |
| [472] | A Memetic Algorithm with Two Distinct Solution Representations for the Partition Graph Coloring Problem Computer Aided Systems Theory – EUROCAST 2013 (Roberto Moreno-Díaz, Franz Pichler, Alexis Quesada-Arencibia, eds.), volume 8111 of LNCS, pages 219–226, 2013, Springer. |
| [471] | A Memetic Algorithm for the Partition Graph Coloring Problem Extended Abstracts of the 14th International Conference on Computer Aided Systems Theory, pages 167–169, 2013. |
| [470] | On The Usability of Lombardi Graph Drawings Graph Drawing (GD'12) (Walter Didimo, Maurizio Patrignani, eds.), volume 7704 of LNCS, pages 451–462, 2013, Springer Berlin Heidelberg. |
| [469] | A PILOT/VND/GRASP Hybrid for the Static Balancing of Public Bicycle Sharing Systems Computer Aided Systems Theory – EUROCAST 2013 (Roberto Moreno-Díaz, Franz Pichler, Alexis Quesada-Arencibia, eds.), volume 8111 of LNCS, pages 372–379, 2013, Springer. |
| [468] | A PILOT/VND/GRASP Hybrid for Balancing Bicycle Sharing Systems Extended Abstracts of the 14th International Conference on Computer Aided Systems Theory, pages 223–225, 2013. |
| [467] | Edge-weighted contact representations of planar graphs Graph Drawing (GD'12) (Walter Didimo, Maurizio Patrignani, eds.), volume 7704 of LNCS, pages 224–235, 2013, Springer Berlin Heidelberg. |
| [466] | Euclidean Greedy Drawings of Trees Algorithms (ESA'13) (H. L. Bodlaender, G. F. Italiano, eds.), volume 8125 of LNCS, pages 767–778, 2013, Springer Berlin Heidelberg. |
| [465] | Drawing Planar Graphs with a Prescribed Inner Face Graph Drawing (GD'13) (Stephen Wismath, Alexander Wolff, eds.), volume 8242 of LNCS, pages 316–327, 2013, Springer Berlin Heidelberg. |
| [464] | Planar Lombardi Drawings of Outerpaths Graph Drawing (GD'12) (Walter Didimo, Maurizio Patrignani, eds.), volume 7704 of LNCS, pages 561–562, 2013, Springer Berlin Heidelberg. Note: Poster abstract |
| [463] | Circular-Arc Cartograms IEEE Pacific Visualization Symposium (PacificVis'13), pages 1–8, 2013, IEEE. |
| [462] | Clique and Independent Set Based GRASP Approaches for the Regenerator Location Problem Proceedings of the 10th Metaheuristics International Conference (H.C. Lau, P. Van Hentenryck, G.R. Raidl, eds.), pages 30/1–30/10, 2013. |
| [461] | A Memetic Algorithm for the Virtual Network Mapping Problem Proceedings of the 10th Metaheuristics International Conference (H.C. Lau, P. Van Hentenryck, G.R. Raidl, eds.), pages 28/1–28/10, 2013. |
| [460] | GRASP and Variable Neighborhood Search for the Virtual Network Mapping Problem Hybrid Metaheuristics, 8th Int. Workshop, HM 2013 (M. J. Blesa, others, eds.), volume 7919 of LNCS, pages 159–173, 2013, Springer. |
| [459] | Solving the Virtual Network Mapping Problem with Construction Heuristics, Local Search and Variable Neighborhood Descent Evolutionary Computation in Combinatorial Optimisation – 13th European Conference, EvoCOP 2013 (M. Middendorf, C. Blum, eds.), volume 7832 of LNCS, pages 250-261, 2013, Springer. |
| [458] | Using Optimized Virtual Network Embedding for Network Dimensioning Proceedings of Networked Systems 2013, pages 118–125, 2013, IEEE. |
| [457] | A Mixed Integer Model for the Stamina-Aware Sightseeing Tour Problem Extended Abstracts of the 14th International Conference on Computer Aided Systems Theory, pages 200–202, 2013. |
| [456] | Trajectory-Based Dynamic Map Labeling Algorithms and Computation (ISAAC'13) (Leizhen Cai, Siu-Wing Cheng, Tak-Wah Lam, eds.), volume 8283 of LNCS, pages 413–423, 2013, Springer Berlin Heidelberg. |
| [455] | Drawing Metro Maps using Bézier Curves Graph Drawing (GD'12) (Walter Didimo, Maurizio Patrignani, eds.), volume 7704 of LNCS, pages 463–474, 2013, Springer Berlin Heidelberg. |
| [454] | Strict Confluent Drawing Graph Drawing (GD'13) (Stephen Wismath, Alexander Wolff, eds.), volume 8242 of LNCS, pages 352–363, 2013, Springer Berlin Heidelberg. |
| [453] | Enhancing a Genetic Algorithm with a Solution Archive to Reconstruct Cross Cut Shredded Text Documents Computer Aided Systems Theory – EUROCAST 2013 (Roberto Moreno-Díaz, Franz Pichler, Alexis Quesada-Arencibia, eds.), volume 8111 of LNCS, pages 380–387, 2013, Springer. |
| [452] | Reconstructing Cross Cut Shredded Documents with a Genetic Algorithm with Solution Archive Extended Abstracts of the 14th International Conference on Computer Aided Systems Theory, pages 226–228, 2013. |
| [451] | Progress on Partial Edge Drawings Graph Drawing (GD'12) (Walter Didimo, Maurizio Patrignani, eds.), volume 7704 of LNCS, pages 67–78, 2013, Springer Berlin Heidelberg. |
| [450] | Many-to-One Boundary Labeling with Backbones Graph Drawing (GD'13) (Stephen Wismath, Alexander Wolff, eds.), volume 8242 of LNCS, pages 244–255, 2013, Springer Berlin Heidelberg. |
| [449] | Using ILP/SAT to determine pathwidth, visibility representations, and other grid-based graph drawings Graph Drawing (GD'13) (Stephen Wismath, Alexander Wolff, eds.), volume 8242 of LNCS, pages 460–471, 2013, Springer Berlin Heidelberg. |
| [448] | Visualizing Large Hierarchically Clustered Graphs with a Landscape Metaphor Graph Drawing (GD'12) (Walter Didimo, Maurizio Patrignani, eds.), volume 7704 of LNCS, pages 553–554, 2013, Springer Berlin Heidelberg. Note: Poster abstract |
| [447] | Capturing Structure in Hard Combinatorial Problems 2013 IEEE 25th International Conference on Tools with Artificial Intelligence, Herndon, VA, USA, November 4-6, 2013, pages 897-898, 2013. Note: invited keynote talk |
| [446] | The Parameterized Complexity of Constraint Satisfaction and Reasoning Applications of Declarative Programming and Knowledge Management - 19th International Conference, INAP 2011, and 25th Workshop on Logic Programming, WLP 2011, Vienna, Austria, September 28-30, 2011, Revised Selected Papers (Hans Tompits, Salvador Abreu, Johannes Oetsch, Jörg Pührer, Dietmar Seipel, Masanobu Umeda, Armin Wolf, eds.), volume 7773 of Lecture Notes in Computer Science, pages 27-37, 2013, Springer Verlag. |
| [445] | Model Counting for Formulas of Bounded Clique-Width Algorithms and Computation - 24th International Symposium, ISAAC 2013, Hong Kong, China, December 16-18, 2013, Proceedings (Leizhen Cai, Siu-Wing Cheng, Tak Wah Lam, eds.), volume 8283 of Lecture Notes in Computer Science, pages 677-687, 2013, Springer Verlag. |
| [444] | Backdoors to Abduction Proceedings of IJCAI 2013, the 23th International Joint Conference on Artificial Intelligence, August 3-9, 2013, Beijing, China, 2013. |
| [443] | Model Counting for CNF Formulas of Bounded Modular Treewidth 30th International Symposium on Theoretical Aspects of Computer Science, STACS 2013, February 27 - March 2, 2013, Kiel, Germany (Natacha Portier, Thomas Wilke, eds.), volume 20 of LIPIcs, pages 55-66, 2013, Leibniz-Zentrum fuer Informatik. |
| [442] | Revisiting Space in Proof Complexity: Treewidth and Pathwidth Mathematical Foundations of Computer Science 2013 - 38th International Symposium, MFCS 2013, Klosterneuburg, Austria, August 26-30, 2013. Proceedings (Krishnendu Chatterjee, Jiri Sgall, eds.), volume 8087 of Lecture Notes in Computer Science, pages 704-716, 2013, Springer Verlag. |
| [441] | Upper and Lower Bounds for Weak Backdoor Set Detection Theory and Applications of Satisfiability Testing - SAT 2013 - 16th International Conference, Helsinki, Finland, July 8-12, 2013. Proceedings (Matti Järvisalo, Allen Van Gelder, eds.), volume 7962 of Lecture Notes in Computer Science, pages 394-402, 2013, Springer Verlag. |
| [440] | Hardness of r-dominating set on Graphs of Diameter (r + 1) Parameterized and Exact Computation - 8th International Symposium, IPEC 2013, Sophia Antipolis, France, September 4-6, 2013, Revised Selected Papers, pages 255–267, 2013. |
| [439] | The Complexity of Repairing, Adjusting, and Aggregating of Extensions in Abstract Argumentation Theory and Applications of Formal Argumentation - Second International Workshop, TAFA 2013, Beijing, China, August 3-5, 2013, Revised Selected papers (Elizabeth Black, Sanjay Modgil, Nir Oren, eds.), volume 8306 of Lecture Notes in Computer Science, pages 158-175, 2013, Springer Verlag. |
| [438] | On the Subexponential Time Complexity of CSP Proceedings of AAAI 2013, the 27th AAAI Conference on Artificial Intelligence, July 14-18, 2013, Bellevue, Washington, USA (Marie des Jardins, Michael L. Littman, eds.), pages 459-465, 2013, The AAAI Press. |
| [437] | Parameterized Complexity of Directed Steiner Tree on Sparse Graphs Algorithms - ESA 2013 - 21st Annual European Symposium, Sophia Antipolis, France, September 2-4, 2013. Proceedings, pages 671–682, 2013. |
| [436] | A SAT Approach to Clique-Width Theory and Applications of Satisfiability Testing - SAT 2013 - 16th International Conference, Helsinki, Finland, July 8-12, 2013. Proceedings (Matti Järvisalo, Allen Van Gelder, eds.), volume 7962 of Lecture Notes in Computer Science, pages 318-334, 2013, Springer Verlag. |
| [435] | Strong Backdoors to Bounded Treewidth SAT 54th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2013, 26-29 October, 2013, Berkeley, CA, USA, pages 489-498, 2013, IEEE Computer Society. |
| [434] | Backdoors to q-Horn 30th International Symposium on Theoretical Aspects of Computer Science, STACS 2013, February 27 - March 2, 2013, Kiel, Germany (Natacha Portier, Thomas Wilke, eds.), volume 20 of LIPIcs, pages 67-79, 2013, Leibniz-Zentrum fuer Informatik. |
| [433] | Meta-kernelization with Structural Parameters Mathematical Foundations of Computer Science 2013 - 38th International Symposium, MFCS 2013, Klosterneuburg, Austria, August 26-30, 2013. Proceedings (Krishnendu Chatterjee, Jiri Sgall, eds.), volume 8087 of Lecture Notes in Computer Science, pages 457-468, 2013, Springer Verlag. |
| [432] | Expanding the Expressive Power of Monadic Second-Order Logic on Restricted Graph Classes Combinatorial Algorithms - 24th International Workshop, IWOCA 2013, Rouen, France, July 10-12, 2013, Revised Selected Papers, volume 8288 of Lecture Notes in Computer Science, pages 164–177, 2013, Springer Verlag. |
| [431] | FO Model Checking of Interval Graphs Automata, Languages, and Programming - 40th International Colloquium, ICALP 2013, Riga, Latvia, July 8-12, 2013, Proceedings, Part II, volume 7966 of Lecture Notes in Computer Science, pages 250–262, 2013, Springer Verlag. |
| [430] | Kernelization Using Structural Parameters on Sparse Graph Classes Algorithms - ESA 2013 - 21st Annual European Symposium, Sophia Antipolis, France, September 2-4, 2013. Proceedings (Hans L. Bodlaender, Giuseppe F. Italiano, eds.), volume 8125 of Lecture Notes in Computer Science, pages 529–540, 2013, Springer Verlag. |
| [429] | Backdoors to Normality for Disjunctive Logic Programs Proceedings of AAAI 2013, the 27th AAAI Conference on Artificial Intelligence, July 14-18, 2013, Bellevue, Washington, USA (Marie des Jardins, Michael L. Littman, eds.), pages 320-337, 2013, The AAAI Press. |
| [428] | Parameterized Complexity Results for Plan Reuse Proceedings of AAAI 2013, the 27th AAAI Conference on Artificial Intelligence, July 14-18, 2013, Bellevue, Washington, USA (Marie des Jardins, Michael L. Littman, eds.), pages 224-231, 2013, The AAAI Press. |
| [427] | Local Backbones Theory and Applications of Satisfiability Testing - SAT 2013 - 16th International Conference, Helsinki, Finland, July 8-12, 2013. Proceedings (Matti Järvisalo, Allen Van Gelder, eds.), volume 7962 of Lecture Notes in Computer Science, pages 377-393, 2013, Springer Verlag. |
| [426] | Fixed-Parameter Tractability of Workflow Satisfiability in the Presence of Seniority Constraints Frontiers in Algorithmics \emphand Algorithmic Aspects in Information and Management, Third Joint International Conference, FAW-AAIM 2013, Dalian, China, June 26-28, 2013. Proceedings, pages 198–209, 2013. |
| [425] | Faster Exact Algorithms for Some Terminal Set Problems Parameterized and Exact Computation - 8th International Symposium, IPEC 2013, Sophia Antipolis, France, September 4-6, 2013, Revised Selected Papers, pages 150–162, 2013. |
| [424] | Partially Polynomial Kernels for Set Cover and Test Cover IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2013, December 12-14, 2013, Guwahati, India, pages 67–78, 2013. |
| [423] | Parameterized Complexity and Kernel Bounds for Hard Planning Problems Algorithms and Complexity, 8th International Conference, CIAC 2013, Barcelona, Spain, May 22-24, 2013. Proceedings (Paul G. Spirakis, Maria J. Serna, eds.), volume 7878 of Lecture Notes in Computer Science, pages 13-24, 2013, Springer Verlag. |
| [422] | Optimization Challenges of the Future Federated Internet Oct 2013, PhD thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms. Note: supervised by G. R. Raidl and K. Tutschku |
| [421] | The Rooted Delay-Constrained Steiner Tree Problem with Uncertain Delays Dec 2013, Master's thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms. Note: supervised by G. Raidl, M. Leitner, and M. Ruthmair |
| [420] | Two-Phase Local Search for the Bi-objective Connected Facility Location Problem Dec 2013, Master's thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms. Note: supervised by G. Raidl and M. Leitner |
| [419] | Balancing Bike Sharing Systems Dec 2013, Master's thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms. Note: supervised by G. Raidl |
| [418] | Metaheuristic Optimization of Electro-Hybrid Powertrains Using Machine Learning Techniques Aug 2013, Master's thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms. Note: supervised by G. Raidl and T. Krenek. \textbf3rd price Johann Puch Innovation Award 2013 (Magna Steyr) |
| [417] | Analyse und Implementierung von Fallzusammenführungen diagnosebezogener Fallgruppen aus Sicht eines Krankenhausinformationssystems Aug 2013, Master's thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms. Note: supervised by G. Raidl and D. Ljubic |
| [416] | Selective Graph Coloring Problem Apr 2013, Master's thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms. Note: supervised by G. Raidl and B. Hu |
| [415] | Critical Links Detection using CUDA Apr 2013, Master's thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms. Note: supervised by G. Raidl and B. Hu |
| [414] | Metaheuristics for the Regenerator Location Problem Mar 2013, Master's thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms. Note: supervised by G. Raidl |
| [413] | PILOT, GRASP, and VNS Approaches for the Static Balancing of Bicycle Sharing Systems 2013, Technical report TR 186–1–13–01, Institute of Computer Graphics and Algorithms, Vienna University of Technology. |
| 2012 | |
| [412] | Computational Models of Argument - Proceedings of COMMA 2012, Vienna, Austria, September 10-12, 2012 (Bart Verheij, Stefan Szeider, Stefan Woltran, eds.), volume 245 of Frontiers in Artificial Intelligence and Applications, 2012, IOS Press. Note: ISBN 978-1-61499-110-6 |
| [411] | On graph contractions and induced minors Discr. Appl. Math., volume 160, number 6, pages 799-809, 2012. |
| [410] | Solving the Post Enrolment Course Timetabling Problem by Ant Colony Optimization Annals of Operations Research, volume 194, number 1, pages 325–339, 2012. Note: previous technical report version at https://www.ac.tuwien.ac.at/files/pub/nothegger-12.pdf |
| [409] | Lombardi Drawings of Graphs J. Graph Algorithms Appl., volume 16, number 1, pages 85–108, 2012. |
| [408] | Algorithms for Computing the Maximum Weight Region Decomposable into Elementary Shapes Computer Vision and Image Understanding, volume 116, number 7, pages 803–814, 2012. |
| [407] | Drawing (Complete) Binary Tanglegrams Algorithmica, volume 62, number 1–2, pages 309–332, 2012. |
| [406] | Cover Contact Graphs J. Computational Geometry, volume 3, number 1, pages 102–131, 2012. |
| [405] | Editing graphs to satisfy degree constraints: a parameterized approach Journal of Computer and System Sciences, volume 78, number 1, pages 179-191, 2012. |
| [404] | Parameterized Complexity Results for General Factors in Bipartite Graphs with an Application to Constraint Programming Algorithmica, volume 64, number 1, pages 112-125, 2012. |
| [403] | Augmenting tractable fragments of abstract argumentation Artificial Intelligence, volume 186, pages 157-173, 2012. |
| [402] | Finite RDP-algebras: duality, coproducts and logic J. Log. Comput., volume 22, number 3, pages 417–450, 2012. |
| [401] | On the Expression Complexity of Equivalence and Isomorphism of Primitive Positive Formulas Theory Comput. Syst., volume 50, number 2, pages 329–353, 2012. |
| [400] | Lewis Dichotomies in Many-Valued Logics Studia Logica, volume 100, number 6, pages 1271–1290, 2012. |
| [399] | A Variable Neighborhood Search Approach for the Two-Echelon Location-Routing Problem Evolutionary Computation in Combinatorial Optimisation – EvoCOP 2012 (J.-K. Hao, M. Middendorf, eds.), volume 7245 of LNCS, pages 13–24, 2012, Springer, Heidelberg. |
| [398] | Variable Neighborhood Search and GRASP for Three-Layer Hierarchical Ring Network Design Parallel Problem Solving from Nature–PPSN XII (C. A. Coello Coello, others, eds.), volume 7492 of LNCS, pages 458–467, 2012, Springer. |
| [397] | On Solving the Rooted Delay- and Delay-Variation-Constrained Steiner Tree Problem Proceedings of the 2nd International Symposium on Combinatorial Optimization (A.R. Mahjoub, others, eds.), volume 7422 of LNCS, pages 225–236, 2012, Springer. |
| [396] | A Memetic Algorithm and a Solution Archive for the Rooted Delay-Constrained Minimum Spanning Tree Problem Proceedings of the 13th International Conference on Computer Aided Systems Theory: Part I (R. Moreno-Díaz, others, eds.), volume 6927 of LNCS, pages 351–358, 2012, Springer. |
| [395] | Hybrid Heuristics for Multimodal Homecare Scheduling 9th International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CPAIOR'12) (Nicolas Beldiceanu, Narendra Jussien, Éric Pinson, eds.), pages 339–355, 2012, Springer. |
| [394] | Improved Packing and Routing of Vehicles with Compartments Computer Aided Systems Theory – EUROCAST 2011: 13th International Conference, Las Palmas de Gran Canaria, Spain, February 6–11, 2011, Revised Selected Papers, Part I (R. Moreno-Díaz, others, eds.), volume 6927 of LNCS, pages 392–399, 2012, Springer. |
| [393] | Variable Neighborhood and Greedy Randomized Adaptive Search for Capacitated Connected Facility Location Proceedings of the 13th International Conference on Computer Aided Systems Theory: Part I (R. Moreno-Díaz, others, eds.), volume 6927 of LNCS, pages 295–302, 2012, Springer. |
| [392] | Applying (Hybrid) Metaheuristics to Fuel Consumption Optimization of Hybrid Electric Vehicles Applications of Evolutionary Computation – EvoApplications 2012 (C. Di Chio, others, eds.), volume 7248 of LNCS, pages 376–385, 2012, Springer, Heidelberg. |
| [391] | Automatic Generation of 2-AntWars Players with Genetic Programming Proceedings of the 13th International Conference on Computer Aided Systems Theory: Part I (R. Moreno-Díaz, F. Pichler, A. Quesada-Arencibia, eds.), volume 6927 of LNCS, pages 248–255, 2012, Springer. |
| [390] | An Evolutionary Algorithm with Solution Archive for the Generalized Minimum Spanning Tree Problem Proceedings of the 13th International Conference on Computer Aided Systems Theory: Part I (R. Moreno-Díaz, F. Pichler, A. Quesada-Arencibia, eds.), volume 6927 of LNCS, pages 287–294, 2012, Springer. |
| [389] | An Evolutionary Algorithm with Solution Archives and Bounding Extension for the Generalized Minimum Spanning Tree Problem Proceedings of the 14th Annual Conference on Genetic and Evolutionary Computation (GECCO), pages 393–400, 2012, ACM Press. |
| [388] | A Multilevel Heuristic for the Rooted Delay-Constrained Minimum Spanning Tree Problem Proceedings of the 13th International Conference on Computer Aided Systems Theory: Part I (R. Moreno-Díaz, F. Pichler, A. Quesada-Arencibia, eds.), volume 6927 of LNCS, pages 256–263, 2012, Springer. |
| [387] | Computing Resolution-Path Dependencies in Linear Time Theory and Applications of Satisfiability Testing - SAT 2012 - 15th International Conference, Trento, Italy, June 17-20, 2012. Proceedings (Alessandro Cimatti, Roberto Sebastiani, eds.), volume 7317 of Lecture Notes in Computer Science, pages 58-71, 2012, Springer Verlag. |
| [386] | LP can be a cure for Parameterized Problems 29th International Symposium on Theoretical Aspects of Computer Science, STACS 2012, February 29th - March 3rd, 2012, Paris, France, pages 338–349, 2012. |
| [385] | Parameterized Algorithms for Even Cycle Transversal Graph-Theoretic Concepts in Computer Science - 38th International Workshop, WG 2012, Jerusalem, Israel, June 26-28, 2012, Revised Selcted Papers, pages 172–183, 2012. |
| [384] | Parameterized Tractability of Multiway Cut with Parity Constraints Automata, Languages, and Programming - 39th International Colloquium, ICALP 2012, Warwick, UK, July 9-13, 2012, Proceedings, Part I, pages 750–761, 2012. |
| [383] | Valued-Based Argumentation for Tree-like Value Graphs Computational Models of Argument - Proceedings of COMMA 2012, Vienna, Austria, September 10-12, 2012 (Bart Verheij, Stefan Szeider, Stefan Woltran, eds.), volume 245 of Frontiers in Artificial Intelligence and Applications, pages 378–389, 2012, IOS Press. |
| [382] | Strong Backdoors to Nested Satisfiability Theory and Applications of Satisfiability Testing - SAT 2012 - 15th International Conference, Trento, Italy, June 17-20, 2012. Proceedings (Alessandro Cimatti, Roberto Sebastiani, eds.), volume 7317 of Lecture Notes in Computer Science, pages 72-85, 2012, Springer Verlag. |
| [381] | Backdoors to Acyclic SAT Automata, Languages, and Programming - 39th International Colloquium, ICALP 2012, Warwick, UK, July 9-13, 2012, Proceedings, Part I (Artur Czumaj, Kurt Mehlhorn, Andrew M. Pitts, Roger Wattenhofer, eds.), volume 7391 of Lecture Notes in Computer Science, pages 363-374, 2012, Springer Verlag. |
| [380] | Backdoors to Satisfaction The Multivariate Algorithmic Revolution and Beyond - Essays Dedicated to Michael R. Fellows on the Occasion of His 60th Birthday (Hans L. Bodlaender, Rod Downey, Fedor V. Fomin, Dániel Marx, eds.), volume 7370 of Lecture Notes in Computer Science, pages 287-317, 2012, Springer Verlag. |
| [379] | On Finding Optimal Polytrees Proceedings of the Twenty-Sixth AAAI Conference on Artificial Intelligence, July 22-26, 2012, Toronto, Ontario, Canada (Jörg Hoffmann, Bart Selman, eds.), 2012, AAAI Press. |
| [378] | Don't Be Strict in Local Search! Proceedings of the Twenty-Sixth AAAI Conference on Artificial Intelligence, July 22-26, 2012, Toronto, Ontario, Canada (Jörg Hoffmann, Bart Selman, eds.), 2012, AAAI Press. |
| [377] | When Trees Grow Low: Shrubs and Fast MSO1 Mathematical Foundations of Computer Science 2012 - 37th International Symposium, MFCS 2012, Bratislava, Slovakia, August 27-31, 2012. Proceedings, volume 7464 of Lecture Notes in Computer Science, pages 419–430, 2012, Springer Verlag. |
| [376] | Lower Bounds on the Complexity of MSO1 Model-Checking 29th International Symposium on Theoretical Aspects of Computer Science, STACS 2012, February 29th - March 3rd, 2012, Paris, France, volume 14 of LIPIcs, pages 326–337, 2012, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik. |
| [375] | k-Gap Interval Graphs LATIN 2012: Theoretical Informatics - 10th Latin American Symposium, Arequipa, Peru, April 16-20, 2012. Proceedings (David Fernández-Baca, ed.), volume 7256 of Lecture Notes in Computer Science, pages 350-361, 2012, Springer Verlag. |
| [374] | Abstract Argumentation via Monadic Second Order Logic Scalable Uncertainty Management - 6th International Conference, SUM 2012, Marburg, Germany, September 17-19, 2012. Proceedings (Eyke Hüllermeier, Sebastian Link, Thomas Fober, Bernhard Seeger, eds.), volume 7520 of Lecture Notes in Computer Science, pages 85-98, 2012, Springer Verlag. |
| [373] | The Complexity of Planning Revisited - A Parameterized Analysis Proceedings of the Twenty-Sixth AAAI Conference on Artificial Intelligence, July 22-26, 2012, Toronto, Ontario, Canada (Jörg Hoffmann, Bart Selman, eds.), 2012, AAAI Press. |
| [372] | On Solving Constrained Tree Problems and an Adaptive Layers Framework pages 187, May 2012, PhD thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms. Note: supervised by G. R. Raidl and U. Pferschy |
| [371] | Hybrid Metaheuristics and Matheuristics for Problems in Bioinformatics and Transportation May 2012, PhD thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms. Note: supervised by G. R. Raidl and K. F. Dörner |
| [370] | The Vehicle Routing Problem with Compartments Oct 2012, Master's thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms. Note: supervised by G. Raidl and S. Pirkwieser |
| [369] | Extending the Gecode Framework with Interval Constraint Programming Oct 2012, Master's thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms. Note: supervised by G. Raidl and L. Di Gaspero |
| [368] | Improving the Protein Identification Performance in High-Resolution Mass Spectrometry Data Oct 2012, Master's thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms. Note: supervised by G. Raidl, K. Mechtler, and P. Pichler |
| [367] | Solving Multimodal Resource Constrained Project Scheduling Problems Sep 2012, Master's thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms. Note: supervised by G. Raidl |
| [366] | Enhancing an Evolutionary Algorithm with a Solution Archive to Reconstruct Cross Cut Shredded Text Documents May 2012, Master's thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms. Note: supervised by G. Raidl and C. Schauer and B. Hu |
| [365] | Metaheuristics for a Multimodal Home-Health Care Scheduling Problem May 2012, Master's thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms. Note: supervised by G. Raidl and J. Puchinger |
| [364] | Description Logic Based Reasoning on Programming Languages 2012, Master's thesis, Technische Universität Wien. |
| [363] | Backdoors to Tractable Answer-Set Programming 2012, Technical report 1104.2788, Arxiv.org. Note: Extended and updated version of a paper that appeared in the proceedings of IJCAI 2011, the 22nd International Joint Conference on Artificial Intelligence |
| 2011 | |
| [362] | Drawing and Labeling High-Quality Metro Maps by Mixed-Integer Programming IEEE Trans. Visualization and Computer Graphics, volume 17, number 5, pages 626-641, 2011. |
| [361] | Branch-and-Cut-and-Price for Capacitated Connected Facility Location Journal of Mathematical Modelling and Algorithms, volume 10, number 3, pages 245–267, 2011, Springer. Note: previous technical report version at https://www.ac.tuwien.ac.at/files/pub/leitner-10b.pdf |
| [360] | Solving the Minimum Label Spanning Tree Problem by Mathematical Programming Techniques Advances in Operations Research, volume 2011, number 143732, pages 1–38, 2011. |
| [359] | Hybrid Metaheuristics in Combinatorial Optimization: A Survey Applied Soft Computing, volume 11, pages 4135–4151, 2011. Note: previous technical report version at https://www.ac.tuwien.ac.at/files/pub/blum-11.pdf |
| [358] | The parameterized complexity of k-flip local search for SAT and MAX SAT Discrete Optim., volume 8, number 1, pages 139-145, 2011. |
| [357] | Monadic Second Order Logic on Graphs with Local Cardinality Constraints ACM Transactions on Computational Logic, volume 12, number 2, pages article 12, 2011. |
| [356] | Tractable cases of the extended global cardinality constraint Constraints, volume 16, number 1, pages 1-24, 2011. |
| [355] | Algorithms and Complexity Results for Persuasive Argumentation Artificial Intelligence, volume 175, pages 1722-1736, 2011. |
| [354] | A probabilistic approach to problems parameterized above or below tight bounds Journal of Computer and System Sciences, volume 77, number 2, pages 422-429, 2011. |
| [353] | On the complexity of some colorful problems parameterized by treewidth Information and Computation, volume 209, number 2, pages 143-153, 2011. |
| [352] | Parameterized Proof Complexity Computational Complexity, volume 20, number 1, pages 51-85, 2011. |
| [351] | Solving MAX-r-SAT above a tight lower bound Algorithmica, volume 61, number 3, pages 638-655, 2011. |
| [350] | Stabilized Branch-and-Price for the Rooted Delay-Constrained Steiner Tree Problem Network Optimization: 5th International Conference, INOC 2011 (J. Pahl, T. Reiners, S. Voß, eds.), volume 6701 of LNCS, pages 124–138, Jun 2011, Springer. |
| [349] | Stabilized Column Generation for the Rooted Delay-Constrained Steiner Tree Problem Proceedings of the VII ALIO/EURO – Workshop on Applied Combinatorial Optimization, pages 250–253, May 2011. |
| [348] | A Layered Graph Model and an Adaptive Layers Framework to Solve Delay-Constrained Minimum Tree Problems Fifteenth Conference on Integer Programming and Combinatorial Optimization (IPCO XV) (O. Günlük, G.J. Woeginger, eds.), volume 6655 of LNCS, pages 376–388, 2011, Springer, Heidelberg. |
| [347] | Using a Solution Archive to Enhance Metaheuristics for the Rooted Delay-Constrained Minimum Spanning Tree Problem Extended Abstracts of EUROCAST 2011 – 13th International Conference on Computer Aided Systems Theory (Alexis Quesada-Arencibia, others, eds.), pages 285–287, 2011. |
| [346] | Tackling the Loading Aspect of the Vehicle Routing Problem with Compartments Proceedings of the 9th Metaheuristics International Conference (Luca Di Gaspero, Andrea Schaerf, Thomas Stützle, eds.), pages 679–681, 2011. |
| [345] | Improved Packing and Routing of Vehicles with Compartments Extended Abstracts of EUROCAST 2011 – 13th International Conference on Computer Aided Systems Theory (Alexis Quesada-Arencibia, others, eds.), pages 302–304, 2011. |
| [344] | A Timeslot-Filling Based Heuristic Approach to Construct High-School Timetables Proceedings of the 9th Metaheuristics International Conference (Luca Di Gaspero, Andrea Schaerf, Thomas Stützle, eds.), pages 349–358, 2011. |
| [343] | Variable Neighborhood Search for Capacitated Connected Facility Location Extended Abstracts of EUROCAST 2011 – 13th International Conference on Computer Aided Systems Theory (A. Quesada-Arencibia, others, eds.), pages 261–263, 2011. |
| [342] | Connecting Two Trees with Optimal Routing Cost Canadian Conference on Computational Geometry (CCCG '11), pages 43–47, 2011, University of Toronto. |
| [341] | Introducing the Virtual Network Mapping Problem with Delay, Routing and Location Constraints Network Optimization: 5th International Conference, INOC 2011 (J. Pahl, T. Reiners, S. Voß, eds.), volume 6701 of LNCS, pages 105–117, 2011, Springer. |
| [340] | Automatic Generation of 2-AntWars Players with Genetic Programming Extended Abstracts of EUROCAST 2011 – 13th International Conference on Computer Aided Systems Theory (Alexis Quesada-Arencibia, others, eds.), pages 244–246, 2011. |
| [339] | An Evolutionary Algorithm with Solution Archive for the Generalized Minimum Spanning Tree Problem Extended Abstracts of EUROCAST 2011 – 13th International Conference on Computer Aided Systems Theory (Alexis Quesada-Arencibia, others, eds.), pages 256–259, 2011. |
| [338] | Sliding Labels for Dynamic Point Labeling Canadian Conference on Computational Geometry (CCCG '11), pages 205–210, 2011, University of Toronto. |
| [337] | Consistent Labeling of Rotating Maps Algorithms and Data Structures (WADS'11) (Frank Dehne, John Iacono, Jörg-Rüdiger Sack, eds.), volume 6844 of LNCS, pages 451–462, 2011, Springer Berlin Heidelberg. |
| [336] | On d-regular Schematization of Embedded Paths Theory and Practice of Computer Science (SOFSEM'11), volume 6543 of LNCS, pages 260–271, 2011, Springer Berlin Heidelberg. |
| [335] | Automatic Generation of Route Sketches Graph Drawing (GD'10) (Ulrik Brandes, Sabine Cornelsen, eds.), volume 6502 of LNCS, pages 391–392, 2011, Springer Berlin Heidelberg. Note: Poster abstract |
| [334] | Boundary-Labeling Algorithms for Panorama Images Advances in Geographic Information Systems (SIGSPATIAL'11), pages 289–298, 2011, ACM. |
| [333] | Optimal 3D Angular Resolution for Low-Degree Graphs Graph Drawing (GD'10) (Ulrik Brandes, Sabine Cornelsen, eds.), volume 6502 of LNCS, pages 208-219, 2011, Springer Berlin Heidelberg. |
| [332] | Lombardi Drawings of Graphs Graph Drawing (GD'10) (Ulrik Brandes, Sabine Cornelsen, eds.), volume 6502 of LNCS, pages 195–207, 2011, Springer Berlin Heidelberg. |
| [331] | Drawing Trees with Perfect Angular Resolution and Polynomial Area Graph Drawing (GD'10) (Ulrik Brandes, Sabine Cornelsen, eds.), volume 6502 of LNCS, pages 183–194, 2011, Springer Berlin Heidelberg. |
| [330] | A Branch-and-Cut-and-Price Algorithm for a Fingerprint-Template Compression Application Proceedings of the 2011 Federated Conference on Computer Science and Information Systems (FedCSIS) (M. Ganzha, others, eds.), pages 239–246, 2011, IEEE Digital Library. |
| [329] | A Multilevel Heuristic for the Rooted Delay-Constrained Minimum Spanning Tree Problem Extended Abstracts of EUROCAST 2011 – 13th International Conference on Computer Aided Systems Theory (Alexis Quesada-Arencibia, others, eds.), pages 247–249, 2011. |
| [328] | Adjacency-Preserving Spatial Treemaps Algorithms and Data Structures (WADS'11) (Frank Dehne, John Iacono, Jörg-Rüdiger Sack, eds.), volume 6844 of LNCS, pages 159–170, 2011, Springer Berlin Heidelberg. |
| [327] | Limits of Preprocessing Proceedings of the Twenty-Fifth Conference on Artificial Intelligence, AAAI 2011, pages 93-98, 2011, AAAI Press, Menlo Park, California. |
| [326] | Paths, Flowers and Vertex Cover Algorithms - ESA 2011 - 19th Annual European Symposium, Saarbrücken, Germany, September 5-9, 2011. Proceedings, pages 382–393, 2011. |
| [325] | Augmenting Tractable Fragments of Abstract Argumentation Proceedings of the 22nd International Joint Conference on Artificial Intelligence, IJCAI 2011 (Toby Walsh, ed.), pages 1033-1038, 2011, AAAI Press/IJCAI. |
| [324] | Satisfiability of Acyclic and almost Acyclic CNF Formulas (II) Theory and Applications of Satisfiability Testing - SAT 2011 - 14th International Conference, SAT 2011, Ann Arbor, MI, USA, June 19-22, 2011. Proceedings (Karem A. Sakallah, Laurent Simon, eds.), volume 6695 of Lecture Notes in Computer Science, pages 47-60, 2011, Springer Verlag. |
| [323] | A Polynomial Kernel for Feedback Arc Set on Bipartite Tournaments Algorithms and Computation - 22nd International Symposium, ISAAC 2011, Yokohama, Japan, December 5-8, 2011. Proceedings, pages 333–343, 2011. |
| [322] | Kernels for Global Constraints IJCAI 2011, Proceedings of the 22nd International Joint Conference on Artificial Intelligence, Barcelona, Catalonia, Spain, July 16-22, 2011 (Toby Walsh, ed.), pages 540-545, 2011, IJCAI/AAAI. |
| [321] | The Parameterized Complexity of Local Consistency Proceedings of the 17th International Conference on Principles and Practice of Constraint Programming (CP 2011) (Jimmy Ho-Man Lee, ed.), volume 6876 of Lecture Notes in Computer Science, pages 302-316, 2011, Springer Verlag. |
| [320] | Clique-width: When Hard Does Not Mean Impossible 28th International Symposium on Theoretical Aspects of Computer Science, STACS 2011, March 10-12, 2011, Dortmund, Germany, volume 9 of LIPIcs, pages 404–415, 2011, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik. |
| [319] | Twin-Cover: Beyond Vertex Cover in Parameterized Algorithmics Parameterized and Exact Computation - 6th International Symposium, IPEC 2011, Saarbrücken, Germany, September 6-8, 2011. Revised Selected Papers, volume 7112 of Lecture Notes in Computer Science, pages 259–271, 2011, Springer Verlag. |
| [318] | New Results on the Complexity of the Max- and Min-Rep Problems SOFSEM 2011: Theory and Practice of Computer Science - 37th Conference on Current Trends in Theory and Practice of Computer Science, Nový Smokovec, Slovakia, January 22-28, 2011. Proceedings, volume 6543 of Lecture Notes in Computer Science, pages 238–247, 2011, Springer Verlag. |
| [317] | Backdoors to Tractable Answer-Set Programming Proceedings of the 22nd International Joint Conference on Artificial Intelligence, IJCAI 2011 (Toby Walsh, ed.), pages 863-868, 2011, AAAI Press/IJCAI. |
| [316] | Generic Expression Hardness Results for Primitive Positive Formula Comparison Automata, Languages and Programming - 38th International Colloquium, ICALP 2011, Zurich, Switzerland, July 4-8, 2011, Proceedings, Part II, pages 344–355, 2011. |
| [315] | A Multilevel Refinement Approach to the Rooted Delay-Constrained Steiner Tree Problem Sep 2011, Master's thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms. Note: supervised by G. Raidl and M. Ruthmair |
| [314] | Heuristic Methods for the Hop Constrained Survivable Network Design Problem Sep 2011, Master's thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms. Note: supervised by G. Raidl and M. Leitner |
| [313] | Ein Lösungsarchiv mit Branch-and-Bound-Erweiterung für das Generalized Minimum Spanning Tree Problem Sep 2011, Master's thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms. Note: supervised by G. Raidl and B. Hu |
| [312] | Branch-and-Price for the Steiner Tree Problem with Revenues, Budget and Hop Constraints Aug 2011, Master's thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms. Note: supervised by G. Raidl and M. Leitner |
| [311] | Optimierung der periodischen Tourenplanung in der Müllentsorgung Jul 2011, Master's thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms. Note: supervised by G. Raidl and M. Ruthmair |
| [310] | Verbrauchsminimierung eines Hybridfahrzeuges im Neuen Europäischen Fahrzyklus Jul 2011, Master's thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms. Note: supervised by G. Raidl and M. Ruthmair |
| [309] | Anwendung von kombinatorischen Optimierungsmethoden zur Rekonstruktion von in Streifen geschnittenen Papierdokumenten Jul 2011, Master's thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms. Note: supervised by G. Raidl and C. Schauer |
| [308] | On Stabilized Branch-and-Price for Constrained Tree Problems 2011, Technical report TR 186–1–11–01, Vienna University of Technology. |
| [307] | Backdoors to Satisfaction 10 2011, Technical report 1110.6387, Arxiv.org. |
| [306] | Backdoors to Acyclic SAT 10 2011, Technical report 1110.6384, Arxiv.org. |
| 2010 | |
| [305] | Hybrid Metaheuristics, 7th Int. Workshop, HM 2010 (Maria J. Blesa, Christian Blum, Günther R. Raidl, Andrea Roli, Michael Sampels, eds.), volume 6373 of LNCS, 2010, Springer. |
| [304] | Theory and Applications of Satisfiability Testing - SAT 2010, 13th International Conference, SAT 2010, Edinburgh, UK, July 11-14, 2010. Proceedings (Ofer Strichman, Stefan Szeider, eds.), volume 6175 of Lecture Notes in Computer Science, 2010, Springer Verlag. |
| [303] | The Multidimensional Knapsack Problem: Structure and Algorithms INFORMS Journal on Computing, volume 22, number 2, pages 250–265, 2010. Note: previous technical report version at https://www.ac.tuwien.ac.at/files/pub/puchinger-07.pdf |
| [302] | The Generalized Minimum Edge Biconnected Network Problem: Efficient Neighborhood Structures for Variable Neighborhood Search Networks, volume 55, number 3, pages 256–275, 2010. Note: previous technical report version at https://www.ac.tuwien.ac.at/files/pub/hu-07.pdf |
| [301] | Optimizing Active Ranges for Consistent Dynamic Map Labeling Comput. Geom. Theory Appl., volume 43, number 3, pages 312–328, 2010. |
| [300] | Boundary Labeling with Octilinear Leaders Algorithmica, volume 57, pages 436–461, 2010. |
| [299] | Constraint satisfaction with bounded treewidth revisited Journal of Computer and System Sciences, volume 76, number 2, pages 103-114, 2010. |
| [298] | Algorithms for propositional model counting J. Discrete Algorithms, volume 8, number 1, pages 50-64, 2010. |
| [297] | On parse trees and Myhill-Nerode-type tools for handling graphs of bounded rank-width Discrete Applied Mathematics, volume 158, number 7, pages 851–867, 2010. |
| [296] | The coherence of Łukasiewicz assessments is NP-complete Int. J. Approx. Reasoning, volume 51, number 3, pages 294–304, 2010. |
| [295] | The free n-generated BL-algebra Ann. Pure Appl. Logic, volume 161, number 9, pages 1144–1170, 2010. |
| [294] | Metaheuristic Hybrids Chapter in Handbook of Metaheuristics (Michel Gendreau, Jean Yves Potvin, eds.), volume 146 of International Series in Operations Research & Management Science, pages 469–496, 2010, Springer. Note: previous technical report version at https://www.ac.tuwien.ac.at/files/pub/raidl-08a.pdf |
| [293] | Visualisierung von Netzen: Algorithmen, Anwendungen und Komplexität Chapter in Ausgezeichnete Informatikdissertationen 2009 (Steffen Hölldobler, ed.), volume D-10 of Lecture Notes in Informatics (LNI), 2010, Gesellschaft für Informatik e.V. (GI). |
| [292] | Trend-Based Similarity Search in Time-Series Data Proceedings of the Second International Conference on Advances in Database, Knowledge, and Data Applications – DBKDA 2010, pages 97–106, 2010, IEEE CPS. |
| [291] | A Memetic Algorithm for Reconstructing Cross-Cut Shredded Text Documents Hybrid Metaheuristics, 7th Int. Workshop, HM 2010 (M. J. Blesa, others, eds.), volume 6373 of LNCS, pages 103–117, 2010, Springer. |
| [290] | Variable Neighborhood Search and Ant Colony Optimization for the Rooted Delay-Constrained Minimum Spanning Tree Problem Parallel Problem Solving from Nature – PPSN XI, Part II (R. Schaefer, others, eds.), volume 6239 of LNCS, pages 391–400, 2010, Springer. |
| [289] | Enhancing Genetic Algorithms by a Trie-Based Complete Solution Archive Evolutionary Computation in Combinatorial Optimisation – EvoCOP 2010 (Peter Cowling, Peter Merz, eds.), volume 6022 of LNCS, pages 239–251, 2010, Springer. Note: best paper award winner |
| [288] | Variable Neighborhood Search Coupled with ILP-based Large Neighborhood Searches for the (Periodic) Location-Routing Problem Hybrid Metaheuristics, 7th Int. Workshop, HM 2010 (M. J. Blesa, others, eds.), volume 6373 of LNCS, pages 174–189, 2010, Springer. |
| [287] | Matheuristics for the Periodic Vehicle Routing Problem with Time Windows Proceedings of Matheuristics 2010: Third International Workshop on Model-Based Metaheuristics, pages 83–95, 2010. |
| [286] | Multilevel Variable Neighborhood Search for Periodic Routing Problems Evolutionary Computation in Combinatorial Optimisation – EvoCOP 2010 (Peter Cowling, Peter Merz, eds.), volume 6022 of LNCS, pages 226–238, 2010, Springer. |
| [285] | A Memetic Algorithm with Population Management for the Generalized Minimum Vertex-Biconnected Network Problem 2nd International Conference on Intelligent Networking and Collaborative Systems, Workshop on Information Network Design (F. Xhafa, others, eds.), pages 356–361, 2010, Conference Publishing Services. |
| [284] | Similarity Searching in Sequences of Complex Events Proceedings of the Fourth International Conference on Research Challenges in Information Science – RCIS 2010, pages 631–639, 2010, IEEE CPS. |
| [283] | Dynamic One-Sided Boundary Labeling Advances in Geographic Information Systems (SIGSPATIAL'10), pages 310–319, 2010, ACM. |
| [282] | An Improved Algorithm for the Metro-Line Crossing Minimization Problem Graph Drawing (GD'09) (David Eppstein, Emden R. Gansner, eds.), volume 5849 of LNCS, pages 381–392, 2010, Springer Berlin Heidelberg. |
| [281] | Shooting Bricks with Orthogonal Laser Beams: A First Step towards Internal/External Map Labeling Canadian Conference on Computational Geometry (CCCG '10), pages 203–206, 2010, University of Manitoba. |
| [280] | Strong Lower Bounds for a Survivable Network Design Problem ISCO 2010 – International Symposium on Combinatorial Optimization (M. Haouari, A. R. Mahjoub, eds.), volume 36 of Electronic Notes in Discrete Mathematics, pages 295–302, 2010, Elsevier. |
| [279] | Path Schematization for Route Sketches Algorithm Theory (SWAT'10) (H. Kaplan, ed.), volume 6139 of LNCS, pages 285–296, 2010, Springer Berlin Heidelberg. |
| [278] | Solving the Minimum Label Spanning Tree Problem by Ant Colony Optimization Proceedings of the 2010 International Conference on Genetic and Evolutionary Methods, GEM 2010 (H. Arabnia, A. M. G. Solo, eds.), 2010, CSREA Press. |
| [277] | Fitting Multi-Planet Transit Models to Photometric Time-Data Series by Evolution Strategies GECCO 2010: Proceedings of the 12th Annual Conference on Genetic and Evolutionary Computation (Jürgen Branke, Martin Pelikan, eds.), pages 377–384, 2010, ACM Press. |
| [276] | A Brief Survey on Hybrid Metaheuristics Proceedings of BIOMA 2010 – 4th International Conference on Bioinspired Optimization Methods and their Applications (B. Filipic, J. Silc, eds.), pages 3–16, 2010. |
| [275] | Tractable Answer-Set Programming with Weight Constraints: Bounded Treewidth Is not Enough Principles of Knowledge Representation and Reasoning: Proceedings of the Twelfth International Conference, KR 2010, Toronto, Ontario, Canada, May 9-13, 2010 (Fangzhen Lin, Ulrike Sattler, Miroslaw Truszczynski, eds.), 2010, AAAI Press. |
| [274] | Algorithms and Complexity Results for Exact Bayesian Structure Learning Proceedings of UAI 2010, The 26th Conference on Uncertainty in Artificial Intelligence, Catalina Island, California, USA, July 8-11, 2010 (Peter Grünwald, Peter Spirtes, eds.), 2010, AUAI Press, Corvallis, Oregon. |
| [273] | Satisfiability of Acyclic and Almost Acyclic CNF Formulas IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2010, December 15-18, 2010, Chennai, India (Kamal Lodaya, Meena Mahajan, eds.), volume 8 of LIPIcs, pages 84-95, 2010, Leibniz-Zentrum fuer Informatik. |
| [272] | Algorithms and Complexity Results for Persuasive Argumentation Computational Models of Argumentation, Proceedings of COMMA 2010 (Pietro Baroni, Federico Cerutti, Massimiliano Giacomin, Guillermo R. Simari, eds.), volume 216 of Frontiers in Artificial Intelligence and Applications, pages 311-322, 2010. |
| [271] | On Contracting Graphs to Fixed Pattern Graphs SOFSEM 2010: Theory and Practice of Computer Science, 36th Conference on Current Trends in Theory and Practice of Computer Science, Spindleruv Mlýn, Czech Republic, January 23-29, 2010. Proceedings (Jan van Leeuwen, Anca Muscholl, David Peleg, Jaroslav Pokorný, Bernhard Rumpe, eds.), volume 5901 of Lecture Notes in Computer Science, pages 503-514, 2010, Springer Verlag. |
| [270] | Parameterized Complexity Results for General Factors in Bipartite Graphs with an Application to Constraint Programming Parameterized and Exact Computation - 5th International Symposium, IPEC 2010, Chennai, India, December 13-15, 2010. Proceedings (Venkatesh Raman, Saket Saurabh, eds.), volume 6478 of Lecture Notes in Computer Science, pages 158-169, 2010, Springer Verlag. |
| [269] | Better Algorithms for Satisfiability Problems for Formulas of Bounded Rank-width IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2010, December 15-18, 2010, Chennai, India, volume 8 of LIPIcs, pages 73–83, 2010, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik. |
| [268] | New Results on the Complexity of Oriented Colouring on Restricted Digraph Classes SOFSEM 2010: Theory and Practice of Computer Science, 36th Conference on Current Trends in Theory and Practice of Computer Science, Spindleruv Mlýn, Czech Republic, January 23-29, 2010. Proceedings, volume 5901 of Lecture Notes in Computer Science, pages 428–439, 2010, Springer Verlag. |
| [267] | Are There Any Good Digraph Width Measures? Parameterized and Exact Computation - 5th International Symposium, IPEC 2010, Chennai, India, December 13-15, 2010. Proceedings, volume 6478 of Lecture Notes in Computer Science, pages 135–146, 2010, Springer Verlag. |
| [266] | Thread Graphs, Linear Rank-Width and Their Algorithmic Applications Combinatorial Algorithms - 21st International Workshop, IWOCA 2010, London, UK, July 26-28, 2010, Revised Selected Papers, volume 6460 of Lecture Notes in Computer Science, pages 38–42, 2010, Springer Verlag. |
| [265] | Reasoning in Argumentation Frameworks of Bounded Clique-Width Computational Models of Argumentation, Proceedings of COMMA 2010 (Pietro Baroni, Federico Cerutti, Massimiliano Giacomin, Guillermo R. Simari, eds.), volume 216 of Frontiers in Artificial Intelligence and Applications, pages 219-230, 2010. |
| [264] | On the Kernelization Complexity of Colorful Motifs Parameterized and Exact Computation - 5th International Symposium, IPEC 2010, Chennai, India, December 13-15, 2010. Proceedings, pages 14–25, 2010. |
| [263] | Solving MAX-r-SAT Above a Tight Lower Bound Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2010, Austin, Texas, USA, January 17-19, 2010 (Moses Charikar, ed.), pages 511-517, 2010, Society for Industrial and Applied Mathematics (SIAM). |
| [262] | Schauder Hats for the Two-Variable Fragment of BL 40th IEEE International Symposium on Multiple-Valued Logic, ISMVL 2010, Barcelona, Spain, 26-28 May 2010, pages 27–32, 2010. |
| [261] | On the Minimum Label Spanning Tree Problem: Solution Methods and Applications May 2010, PhD thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms. Note: supervised by G. R. Raidl and U. Pferschy |
| [260] | Solving Two Network Design Problems by Mixed Integer Programming and Hybrid Optimization Methods May 2010, PhD thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms. Note: supervised by G. R. Raidl and U. Pferschy |
| [259] | A Timeslot-Based Heuristic Approach to Construct High-School Timetables Dec 2010, Master's thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms. Note: supervised by G. Raidl and B. Melian |
| [258] | Ein neues Lösungsarchiv für das Generalized Minimum Spanning Tree-Problem Sep 2010, Master's thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms. Note: supervised by G. Raidl and B. Hu |
| [257] | Solving the k-Node Minimum Label Spanning Arborescence Problem with Exact and Heuristic Methods Aug 2010, Master's thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms. Note: supervised by G. Raidl and A. Chwatal |
| [256] | Multilevel Heuristiken für das Rooted Delay-Constrained Minimum Spanning Tree Problem Jul 2010, Master's thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms. Note: supervised by G. Raidl and M. Ruthmair |
| [255] | Automatic Generation of 2-AntWars Players with Genetic Programming Jul 2010, Master's thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms. Note: supervised by G. Raidl |
| [254] | Reconstructing Cross-Cut Shredded Documents by means of Evolutionary Algorithms May 2010, Master's thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms. Note: supervised by G. Raidl and M. Prandtstetter |
| [253] | Compressing Fingerprint Templates by Solving the k-Node Minimum Label Spanning Arborescence Problem by Branch-and-Price Feb 2010, Master's thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms. Note: supervised by G. Raidl and A. Chwatal |
| [252] | Heuristic methods for solving two Generalized Network Problems Feb 2010, Master's thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms. Note: supervised by G. Raidl and B. Hu |
| [251] | Branch-and-Cut-and-Price for Capacitated Connected Facility Location 2010, Technical report TR 186–1–10–01, Vienna University of Technology. |
| 2009 | |
| [250] | GECCO 2009: Proceedings of the 11th Annual Conference on Genetic and Evolutionary Computation (Günther R. Raidl, others, eds.), 2009, ACM Press. |
| [249] | Consistent Digital Rays Discrete and Computational Geometry, volume 42, number 3, pages 359–378, 2009. |
| [248] | Solving an Extended Minimum Label Spanning Tree Problem to Compress Fingerprint Templates Journal of Mathematical Modelling and Algorithms, volume 8, number 3, pages 293–334, 2009. Note: previous technical report version at https://www.ac.tuwien.ac.at/files/pub/chwatal-08a.pdf |
| [247] | Algorithms for Multi-Criteria Boundary Labeling J. Graph Algorithms Appl., volume 13, number 3, pages 289-317, 2009. |
| [246] | Matched Formulas and Backdoor Sets J on Satisfiability, Boolean Modeling and Computation, volume 6, pages 1-12, 2009. |
| [245] | Backdoor sets of quantified Boolean formulas Journal of Automated Reasoning, volume 42, number 1, pages 77–97, 2009. |
| [244] | Covering graphs with few complete bipartite subgraphs Theoretical Computer Science, volume 410, number 21-23, pages 2045-2053, 2009. |
| [243] | Clique-width is NP-complete SIAM J. Discrete Math., volume 23, number 2, pages 909-939, 2009. |
| [242] | The consequence relation in the logic of commutative GBL-algebras is PSPACE-complete Theor. Comput. Sci., volume 410, number 12-13, pages 1143–1158, 2009. |
| [241] | MetaBoosting: Enhancing Integer Programming Techniques by Metaheuristics Chapter in Matheuristics – Hybridizing Metaheuristics and Mathematical Programming (V. Maniezzo, T. Stützle, S. Voss, eds.), volume 10 of Annals of Information Systems, pages 71–102, 2009, Springer. Note: previous technical report version at https://www.ac.tuwien.ac.at/files/pub/puchinger-09.pdf |
| [240] | Combining Lagrangian Decomposition with Very Large Scale Neighborhoood Search for Capacitated Connected Facility Location Chapter in Post-Conference Book of the Eight Metaheuristics International Conference – MIC 2009, 2009. Note: to appear |
| [239] | (Meta-)Heuristic Separation of Jump Cuts in a Branch&Cut Approach for the Bounded Diameter Minimum Spanning Tree Problem Chapter in Matheuristics – Hybridizing Metaheuristics and Mathematical Programming (V. Maniezzo, T. Stützle, S. Voss, eds.), volume 10 of Annals of Information Systems, pages 209–230, 2009, Springer. |
| [238] | Hybrid Metaheuristics Chapter in CPAIOR 10th Anniversary (M. Milano, P. Van Hentenryck, eds.), 2009, Springer. Note: to appear |
| [237] | Solving a Multi-Constrained Network Design Problem by Lagrangean Decomposition and Column Generation International Network Optimization Conference 2009 (Maria Grazia Scutellà, others, eds.), Apr 2009. |
| [236] | Accelerating Column Generation for a Survivable Network Design Problem Proceedings of the International Network Optimization Conference 2009 (M. G. Scutellá, others, eds.), Apr 2009. |
| [235] | Solving a Video-Server Load Re-Balancing Problem by Mixed Integer Programming and Hybrid Variable Neighborhood Search Hybrid Metaheuristics 2009 (M. J. Blesa, others, eds.), volume 5818 of LNCS, pages 84–99, 2009, Springer. |
| [234] | A Kruskal-Based Heuristic for the Rooted Delay-Constrained Minimum Spanning Tree Problem Computer Aided Systems Theory – EUROCAST 2009 (R. Moreno-Díaz, others, eds.), volume 5717 of LNCS, pages 713–720, 2009, Springer. |
| [233] | A Kruskal-Based Heuristic for the Rooted Delay-Constrained Minimum Spanning Tree Problem Extended Abstracts of the Twelfth International Conference on Computer Aided Systems Theory (EUROCAST 2009) (A. Quesada-Arencibia, others, eds.), pages 244–246, 2009. |
| [232] | Cooperative Hybrids for Combinatorial Optimization Nature Inspired Cooperative Strategies for Optimization (NICSO 2008) (Natalio Krasnogor, others, eds.), volume 236 of Studies in Computational Intelligence, pages X, 2009, Springer. Note: abstract |
| [231] | Computing Optimized Stock (Re-)Placements in Last-In, First-Out Warehouses Logistik Management: Systeme, Methoden, Integration (Stefan Voss, others, eds.), pages 279–298, 2009, Physica Verlag. |
| [230] | Meta-Heuristics for Reconstructing Cross Cut Shredded Text Documents GECCO 2009: Proceedings of the 11th Annual Conference on Genetic and Evolutionary Computation (Günther R. Raidl, others, eds.), pages 349–356, 2009, ACM Press. |
| [229] | A Hybrid Algorithm for Computing Tours in a Spare Parts Warehouse Evolutionary Computation in Combinatorial Optimisation – EvoCOP 2009 (Carlos Cotta, Peter Cowling, eds.), volume 5482 of LNCS, pages 25–36, 2009, Springer. |
| [228] | Multiple Variable Neighborhood Search Enriched with ILP Techniques for the Periodic Vehicle Routing Problem with Time Windows Hybrid Metaheuristics 2009 (M. J. Blesa, others, eds.), volume 5818 of LNCS, pages 175–189, 2009, Springer. |
| [227] | Boosting a Variable Neighborhood Search for the Periodic Vehicle Routing Problem with Time Windows by ILP Techniques Proceedings of the 8th Metaheuristic International Conference (Stefan Voss, Marco Caserta, eds.), 2009. |
| [226] | A Column Generation Approach for the Periodic Vehicle Routing Problem with Time Windows Proceedings of the International Network Optimization Conference 2009 (Maria Grazia Scutellà, others, eds.), 2009. |
| [225] | Drawing Binary Tanglegrams: An Experimental Evaluation Algorithm Engineering and Experiments (ALENEX'09) (Irene Finocchi, John Hershberger, eds.), pages 106–119, 2009, SIAM. |
| [224] | A Lagrangian Decomposition Based Heuristic for Capacitated Connected Facility Location Proceedings of the 8th Metaheuristics International Conference (Stefan Voss, Marco Caserta, eds.), 2009. |
| [223] | A Memetic Algorithm for the Generalized Minimum Vertex-Biconnected Network Problem 9th International Conference on Hybrid Intelligent Systems – HIS 2009, pages 63–68, 2009. Note: best paper award winner |
| [222] | Exploiting Hierarchical Clustering for Finding Bounded Diameter Minimum Spanning Trees on Euclidean Instances GECCO 2009: Proceedings of the 11th Annual Conference on Genetic and Evolutionary Computation (Günther R. Raidl, others, eds.), pages 263–270, 2009, ACM Press. |
| [221] | Solving the Euclidean Bounded Diameter Minimum Spanning Tree Problem by Clustering-Based (Meta-)Heuristics Computer Aided Systems Theory – EUROCAST 2009 (R. Moreno-Díaz, others, eds.), volume 5717 of LNCS, pages 665–672, 2009, Springer. |
| [220] | Cluster-Based (Meta-)Heuristics for the Euclidean Bounded Diameter Minimum Spanning Tree Problem Extended Abstracts of the Twelfth International Conference on Computer Aided Systems Theory (EUROCAST 2009) (A. Quesada-Arencibia, others, eds.), pages 228–231, 2009. |
| [219] | Fitting Rectangular Signals to Time Series Data by Metaheuristic Algorithms Computer Aided Systems Theory – EUROCAST 2009 (R. Moreno-Díaz, others, eds.), volume 5717 of LNCS, pages 649–656, 2009, Springer. |
| [218] | Fitting Rectangular Signals to Time Series Data by Metaheuristic Algorithms Extended Abstracts of the Twelfth International Conference on Computer Aided Systems Theory (EUROCAST 2009) (A. Quesada-Arencibia, others, eds.), pages 222–225, 2009. |
| [217] | Drawing (Complete) Binary Tanglegrams: Hardness, Approximation, Fixed-Parameter Tractability Graph Drawing (GD'08) (Ioannis G. Tollis, Maurizio Patrignani, eds.), volume 5417 of LNCS, pages 324–335, 2009, Springer Berlin Heidelberg. |
| [216] | The Parameterized Complexity of k-Flip Local Search for SAT and MAX SAT Theory and Applications of Satisfiability Testing - SAT 2009, 12th International Conference, SAT 2009, Swansea, UK, June 30 - July 3, 2009. Proceedings (Oliver Kullmann, ed.), volume 5584 of Lecture Notes in Computer Science, pages 276-283, 2009, Springer Verlag. |
| [215] | A Probabilistic Approach to Problems Parameterized above or below Tight Bounds Parameterized and Exact Computation, 4th International Workshop, IWPEC 2009, Copenhagen, Denmark, September 10-11, 2009, Revised Selected Papers (Jianer Chen, Fedor V. Fomin, eds.), volume 5917 of Lecture Notes in Computer Science, pages 234-245, 2009, Springer Verlag. |
| [214] | Better Polynomial Algorithms on Graphs of Bounded Rank-Width Combinatorial Algorithms, 20th International Workshop, IWOCA 2009, Hradec nad Moravicí, Czech Republic, June 28-July 2, 2009, Revised Selected Papers, pages 266–277, 2009, Springer Verlag. |
| [213] | On Digraph Width Measures in Parameterized Algorithmics Parameterized and Exact Computation, 4th International Workshop, IWPEC 2009, Copenhagen, Denmark, September 10-11, 2009, Revised Selected Papers, volume 5917 of Lecture Notes in Computer Science, pages 185–197, 2009, Springer Verlag. |
| [212] | The Parameterized Complexity of Oriented Colouring Annual Doctoral Workshop on Mathematical and Engineering Methods in Computer Science, MEMICS 2009, November 13-15, 2009, Prestige Hotel, Znojmo, Czech Republic, 2009, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, Germany. |
| [211] | Soft Constraints Processing over Divisible Residuated Lattices Symbolic and Quantitative Approaches to Reasoning with Uncertainty, 10th European Conference, ECSQARU 2009, Verona, Italy, July 1-3, 2009. Proceedings, pages 887–898, 2009. |
| [210] | Applications of Finite Duality to Locally Finite Varieties of BL-Algebras Logical Foundations of Computer Science, International Symposium, LFCS 2009, Deerfield Beach, FL, USA, January 3-6, 2009. Proceedings, pages 1–15, 2009. |
| [209] | Fitting Multi-Planet Transit Models to CoRoT Time-Data Series by Evolutionary Algorithms 02 2009, Poster presentation, First CoRoT International Symposium. |
| [208] | Hybrid Optimization Methods for Warehouse Logistics and the Reconstruction of Destroyed Paper Documents Dec 2009, PhD thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms. Note: supervised by G. Raidl |
| [207] | Exact and Heuristic Approaches for Solving the Bounded Diameter Minimum Spanning Tree Problem May 2009, PhD thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms. Note: supervised by G. Raidl |
| [206] | Network Visualization: Algorithms, Applications, and Complexity feb 2009, PhD thesis, Fakultät für Informatik, Universität Karlsruhe (TH). |
| [205] | Ein Lösungsarchiv-unterstützter evolutionärer Algorithmus für das Generalized Minimum Spanning Tree-Problem Jul 2009, Master's thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms. Note: supervised by G. Raidl and B. Hu |
| [204] | Ein hybrides Verfahren basierend auf Variabler Nachbarschaftssuche und Dynamischer Programmierung zur Tourenfindung in einem Ersatzteillager mit domänenspezifischen Nebenbedingungen Apr 2009, Master's thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms. Note: supervised by G. Raidl and M. Prandtstetter |
| [203] | Exakte und heuristische Optimierungsmethoden zur Lösung von Video Server Load Re-Balancing Apr 2009, Master's thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms. Note: supervised by G. Raidl and M. Ruthmair |
| [202] | Event Based Similarity Search and its Applications in Business Analytics Mar 2009, Master's thesis, Vienna University of Technology, Institute of Computer Graphic s and Algorithms. Note: supervised by G. Raidl |
| [201] | Similarity Searching in Complex Business Events and Sequences thereof Mar 2009, Master's thesis, Vienna University of Technology, Institute of Computer Graphic s and Algorithms. Note: supervised by G. Raidl |
| [200] | Enhancing a Genetic Algorithm by a Complete Solution Archive Based on a Trie Data Structure Feb 2009, Master's thesis, Vienna University of Technology, Institute of Computer Graphic s and Algorithms. Note: supervised by G. Raidl |
| [199] | Combining Lagrangian Decomposition with Very Large Scale Neighborhood Search for Capacitated Connected Facility Location 2009, Technical report TR 186–1–09–02, Institute of Computer Graphics and Algorithms, Vienna University of Technology. |
| 2008 | |
| [198] | Bringing Order into the Neighborhoods: Relaxation Guided Variable Neighborhood Search Journal of Heuristics, volume 14, number 5, pages 457–472, 2008. |
| [197] | An Integer Linear Programming Approach and a Hybrid Variable Neighborhood Search for the Car Sequencing Problem European Journal of Operational Research, volume 191, number 3, pages 1004–1022, 2008. Note: previous technical report version at https://www.ac.tuwien.ac.at/files/pub/prandtstetter-05a.pdf |
| [196] | Morphing Polylines: A Step Towards Continuous Generalization Computers, Environment and Urban Systems, volume 32, number 4, pages 248–260, 2008. |
| [195] | Combining Variable Neighborhood Search with Integer Linear Programming for the Generalized Minimum Spanning Tree Problem Journal of Heuristics, volume 14, number 5, pages 473–499, 2008. |
| [194] | Fixed-parameter complexity of minimum profile problems Algorithmica, volume 52, number 2, pages 133-152, 2008. |
| [193] | Fixed-parameter algorithms for artificial intelligence, constraint satisfaction, and database problems The Computer Journal, volume 51, number 3, pages 303-325, 2008. Note: Survey paper |
| [192] | Proof search in Hájek's basic logic ACM Trans. Comput. Log., volume 9, number 3, 2008. |
| [191] | Combining (Integer) Linear Programming Techniques and Metaheuristics for Combinatorial Optimization Chapter in Hybrid Metaheuristics – An Emergent Approach for Combinatorial Optimization (C. Blum, M. J. Blesa Augilera, A. Roli, M. Sampels, eds.), volume 114 of Studies in Computational Intelligence, pages 31–62, 2008, Springer. |
| [190] | A Lagrangian Decomposition/Evolutionary Algorithm Hybrid for the Knapsack Constrained Maximum Spanning Tree Problem Chapter in Recent Advances in Evolutionary Computation for Combinatorial Optimization (C. Cotta, J. van Hemert, eds.), volume 153 of Studies in Computational Intelligence, pages 69–85, 2008, Springer. Note: previous technical report version at https://www.ac.tuwien.ac.at/files/pub/pirkwieser-07a.pdf |
| [189] | Parameterized SAT Chapter in Encyclopedia of Algorithms (Ming-Yang Kao, ed.), 2008, Springer Verlag. |
| [188] | A Lagrangian Relax-and-Cut Approach for the Bounded Diameter Minimum Spanning Tree Problem Numerical Analysis and Applied Mathematics (T. E. Simos, others, eds.), volume 1048 of AIP Conference Proceedings, pages 446–449, 2008, American Institute of Physics. |
| [187] | Combining Forces to Reconstruct Strip Shredded Text Documents Hybrid Metaheuristics 2008 (M. J. Blesa, others, eds.), volume 5296 of LNCS, pages 175–189, 2008, Springer. |
| [186] | A Variable Neighborhood Search for the Periodic Vehicle Routing Problem with Time Windows Proceedings of the 9th EU/MEeting on Metaheuristics for Logistics and Vehicle Routing (Caroline Prodhon, others, eds.), 2008. |
| [185] | Exact Methods and Metaheuristic Approaches for Deriving High Quality Fully Resolved Consensus Trees BIRD'08, 2nd International Conference on Bioinformatics Research and Development, Poster Presentations (J. Küng, K. Schneider, R. Wagner, eds.), volume 26 of Schriftenreihe Informatik, pages 115–124, 2008, Trauner Verlag. |
| [184] | Finding Consensus Trees by Evolutionary, Variable Neighborhood Search, and Hybrid Algorithms GECCO '08: Proceedings of the 10th Annual Conference on Genetic and Evolutionary Computation (Maarten Keijzer, others, eds.), pages 323–330, 2008, ACM. |
| [183] | Solving the Post Enrolment Course Timetabling Problem by Ant Colony Optimization Proceedings of the 7th International Conference on the Practice and Theory of Automated Timetabling (Edmund Burke, others, eds.), 2008. |
| [182] | Lagrangian Decomposition, Metaheuristics, and Hybrid Approaches for the Design of the Last Mile in Fiber Optic Networks Hybrid Metaheuristics 2008 (M. J. Blesa, others, eds.), volume 5296 of LNCS, pages 158–174, 2008, Springer. |
| [181] | Variable Neighborhood Search for a Prize Collecting Capacity Constrained Connected Facility Location Problem Proceedings of the 2008 International Symposium on Applications and the Internet, SAINT 2008, pages 233–236, 2008, IEEE Computer Society. |
| [180] | Solving the Railway Traveling Salesman Problem via a Transformation into the Classical Traveling Salesman Problem Proceedings of the 8th International Conference on Hybrid Intelligent Systems – HIS 2008 (Fatos Xhafa, others, eds.), pages 73–77, 2008. |
| [179] | Effective Neighborhood Structures for the Generalized Traveling Salesman Problem Evolutionary Computation in Combinatorial Optimisation – EvoCOP 2008 (Jano van Hemert, Carlos Cotta, eds.), volume 4972 of LNCS, pages 36–47, 2008, Springer. Note: best paper award winner |
| [178] | (Meta-)Heuristic Separation of Jump Cuts for the Bounded Diameter Minimum Spanning Tree Problem Proceedings of Matheuristics 2008: Second International Workshop on Model Based Metaheuristics (P. Hansen, others, eds.), 2008. |
| [177] | Heuristic Cut Separation in a Branch&Cut Approach for the Bounded Diameter Minimum Spanning Tree Problem Proceedings of the 2008 International Symposium on Applications and the Internet, SAINT 2008, pages 261–264, 2008, IEEE Computer Society. |
| [176] | Consistent Digital Rays Computational Geometry (SoCG'08), pages 355–364, 2008, ACM. |
| [175] | Optimizing Active Ranges for Consistent Dynamic Map Labeling Computational Geometry (SoCG'08), pages 10–19, 2008, ACM. |
| [174] | Boundary Labeling with Octilinear Leaders Algorithm Theory (SWAT'08) (Joachim Gudmundsson, ed.), volume 5124 of LNCS, pages 234–245, 2008, Springer Berlin Heidelberg. |
| [173] | Algorithms for Multi-Criteria One-Sided Boundary Labeling Graph Drawing (GD'07) (Seok-Hee Hong, Takao Nishizeki, eds.), volume 4875 of LNCS, pages 243–254, 2008, Springer Berlin Heidelberg. |
| [172] | Cover Contact Graphs Graph Drawing (GD'07) (Seok-Hee Hong, Takao Nishizeki, eds.), volume 4875 of LNCS, pages 171–182, 2008, Springer Berlin Heidelberg. |
| [171] | Not So Easy Problems For Tree Decomposable Graphs (invited talk) ICDM 2008, International Conference on Discrete Mathematics, June 6-10, 2008, Mysore, India, Proceedings, pages 161-171, 2008. |
| [170] | Monadic Second Order Logic on Graphs with Local Cardinality Constraints Mathematical Foundations of Computer Science 2008, 33rd International Symposium, MFCS 2008, Torun, Poland, August 25-29, 2008, Proceedings, volume 5162 of Lecture Notes in Computer Science, pages 601-612, 2008, Springer Verlag. |
| [169] | Backdoor Trees AAAI 08, Twenty-Third Conference on Artificial Intelligence, Chicago, Illinois, July 13-17, 2008, pages 363-368, 2008, AAAI Press. |
| [168] | Tractable Cases of the Extended Global Cardinality Constraint Proceedings of CATS 2008, Computing: The Australasian Theory Symposium, University of Wollongong, New South Wales, Australia, January 22-25, 2008 (J. Harland, P. Manyem, eds.), volume 77 of Conferences in Research and Practice in Information Technology, pages 67-74, 2008, Australian Computer Society. |
| [167] | Parameterized Graph Editing with Chosen Vertex Degrees Combinatorial Optimization and Applications, Second International Conference, COCOA 2008, St. John's, NL, Canada, August 21-24, 2008. Proceedings (Boting Yang, Ding-Zhu Du, Cao An Wang, eds.), volume 5165 of Lecture Notes in Computer Science, pages 13-22, 2008, Springer Verlag. |
| [166] | The Parameterized Complexity of Regular Subgraph Problems and Generalizations Proceedings of CATS 2008, Computing: The Australasian Theory Symposium, University of Wollongong, New South Wales, Australia, January 22-25, 2008 (J. Harland, P. Manyem, eds.), volume 77 of Conferences in Research and Practice in Information Technology, pages 79-86, 2008, Australian Computer Society. |
| [165] | Automata approach to graphs of bounded rank-width Proceedings of the 19th International Workshop on Combinatorial Algorithms, IWOCA 2008, September 13-15, 2008, Nagoya, Japan, pages 4–15, 2008, College Publications. |
| [164] | Hybrid Metaheuristics for Generalized Network Design Problems Dec 2008, PhD thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms. Note: supervised by G. R. Raidl and U. Pferschy |
| [163] | Design eines sicherheits-, zeit- und kostenkritischen Kommunikationsnetzwerkes mittels Lagrange Relaxierung und Spaltengenerierung Dec 2008, Master's thesis, Vienna University of Technology, Institute of Computer Graphic s and Algorithms. Note: supervised by G. Raidl and A. Chwatal |
| [162] | Generierung von Ein- und Umlagervorschlägen in Lagern mit einer Last-In First-Out Strategie und kundenspezifischen Auslagerpräferenzen Dec 2008, Master's thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms. Note: supervised by G. Raidl and M. Prandtstetter |
| [161] | Parallel Variable Neighborhood Search for the Car Sequencing Problem Oct 2008, Master's thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms. Note: supervised by G. Raidl and M. Prandtstetter |
| [160] | Webbasierte Darstellung großer Datenmengen als Pivot-Tabelle mithilfe ressourcenoptimierter Aggregationsverfahren Oct 2008, Master's thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms. Note: supervised by G. Raidl and M. Gruber |
| [159] | Ein hybrides Verfahren zur automatischen Rekonstruktion von handzerrissenen Dokumentenseiten mittels geometrischer Informationen Sep 2008, Master's thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms. Note: supervised by G. Raidl and M. Prandtstetter |
| [158] | Evaluation and Reconstruction of Strip-Shredded Text Documents may 2008, Master's thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms. Note: supervised by G. Raidl and M. Prandtstetter |
| [157] | Combinatorial Optimization for the Compression of Biometric Templates may 2008, Master's thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms. Note: supervised by G. Raidl and A. Chwatal |
| [156] | Lagrangian Relax-and-Cut and Hybrid methods for the Bounded Diameter and the Hop Constrained Minimum Spanning Tree Problems may 2008, Master's thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms. Note: supervised by G. Raidl and M. Gruber |
| [155] | An Incremental Dynamic Programming Approach for Multidimensional Allocation Problems may 2008, Master's thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms. Note: supervised by G. Raidl |
| [154] | A Complete Archive Genetic Algorithm for the Multidimensional Knapsack Problem may 2008, Master's thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms. Note: supervised by G. Raidl |
| [153] | Reconstructing Borders of Manually Torn Paper Scheets Using Integer Linear Programming jan 2008, Master's thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms. Note: supervised by G. Raidl and M. Prandtstetter |
| [152] | (Meta-)Heuristic Separation of Jump Cuts in a Branch&Cut Approach for the Bounded Diameter Minimum Spanning Tree Problem 2008, Technical report TR 186–1–08–02, Institute of Computer Graphics and Algorithms, Vienna University of Technology. |
| [151] | Solving an Extended Minimum Label Spanning Tree Problem to Compress Fingerprint Templates Sep 2008, Technical report TR 186–1–08–01, Vienna University of Technology, Institute of Computer Graphics and Algorithms. |
| 2007 | |
| [150] | Models and Algorithms for Three-Stage Two-Dimensional Bin Packing European Journal of Operational Research, volume 183, number 3, pages 1304–1327, 2007. Note: previous technical report version at https://www.ac.tuwien.ac.at/files/pub/puchinger-04b.pdf |
| [149] | CyMATE: A New Tool for Methylation Analysis of Plant Genomic DNA after Bisulfite Sequencing The Plant Journal, volume 51, number 3, pages 526–536, 2007. |
| [148] | Solving #SAT using Vertex Covers Acta Informatica, volume 44, number 7-8, pages 509-523, 2007. |
| [147] | The Linear Arrangement Problem Parameterized Above Guaranteed Value Theory Comput. Syst., volume 41, pages 521-538, 2007. |
| [146] | Geographic Visualization Chapter in Human-Centered Visualization Environments (Andreas Kerren, Achim Ebert, Joerg Meyer, eds.), volume 4417 of LNCS, pages 257-294, 2007, Springer Berlin Heidelberg. |
| [145] | Improved Algorithms for Length-Minimal One-Sided Boundary Labeling European Workshop on Computational Geometry (EuroCG'07), pages 190–193, mar 2007. |
| [144] | A Directed Cut Model for the Design of the Last Mile in Real-World Fiber Optic Networks Proceedings of the International Network Optimization Conference 2007 (Bernard Fortz, ed.), pages 103/1–6, 2007. |
| [143] | A Multi-Commodity Flow Approach for the Design of the Last Mile in Real-World Fiber Optic Networks Operations Research Proceedings 2006 (Karl-Heinz Waldmann, Ulrike M. Stocker, eds.), 2007, Springer. |
| [142] | Fingerprint Template Compression by Solving a Minimum Label k-Node Subtree Problem Numerical Analysis and Applied Mathematics (T. E. Simos, ed.), volume 936 of AIP Conference Proceedings, pages 444–447, 2007, American Institute of Physics. |
| [141] | Combining Lagrangian Decomposition with an Evolutionary Algorithm for the Knapsack Constrained Maximum Spanning Tree Problem Evolutionary Computation in Combinatorial Optimization – EvoCOP 2007 (Carlos Cotta, Jano van Hemert, eds.), volume 4446 of LNCS, pages 176–187, 2007, Springer. |
| [140] | Morphing Polygonal Lines: A Step Towards Continuous Generalization Geographic Information Science Research Conference UK (GISRUK'07) (Adam Winstanley, ed.), pages 390–399, 2007. |
| [139] | Variable Neighborhood Search for the Generalized Minimum Edge Biconnected Network Problem Proceedings of the International Network Optimization Conference 2007 (Bernard Fortz, ed.), pages 69/1–6, 2007. |
| [138] | Determining Orbital Elements of Extrasolar Planets by Evolution Strategies Computer Aided Systems Theory – EUROCAST 2007 (R. Moreno-Díaz, others, eds.), volume 4739 of LNCS, pages 870–877, 2007, Springer. |
| [137] | Compressing Fingerprint Templates by Solving an Extended Minimum Label Spanning Tree Problem Proceedings of MIC2007, the 7th Metaheuristics International Conference, pages 105/1–3, 2007. |
| [136] | Minimizing Intra-Edge Crossings in Wiring Diagrams and Public Transportation Maps Graph Drawing (GD'06) (M. Kaufmann, D. Wagner, eds.), volume 4372 of LNCS, pages 270-281, 2007, Springer-Verlag. |
| [135] | Without Loss of Generality - Symmetric Reasoning for Resolution Systems (Invited Talk) Proceedings of SymCon'07, Seventh International Workshop on Symmetry and Constraint Satisfaction Problems, satellite workshop of CP 2007, September 23, 2007, Providence, RI, USA (B. Benhamou, ed.), pages 5-8, 2007. |
| [134] | Matched Formulas and Backdoor Sets Proceedings of SAT 2007, Tenth International Conference on Theory and Applications of Satisfiability Testing, May 28-31, 2007, Lisbon, Portugal, (J. Marques-Silva, K. A. Sakallah, eds.), volume 4501 of Lecture Notes in Computer Science, pages 94-99, 2007. |
| [133] | Algorithms for Propositional Model Counting Proceedings of LPAR 2007, 14th International Conference on Logic for Programming, Artificial Intelligence and Reasoning, October 15-19, 2007 Yerevan, Armenia, volume 4790 of Lecture Notes in Computer Science, pages 484-498, 2007, Springer Verlag. |
| [132] | Backdoor Sets of Quantified Boolean Formulas Proceedings of SAT 2007, Tenth International Conference on Theory and Applications of Satisfiability Testing, May 28-31, 2007, Lisbon, Portugal, (J. Marques-Silva, K. A. Sakallah, eds.), volume 4501 of Lecture Notes in Computer Science, pages 230–243, 2007. |
| [131] | Covering Graphs with Few Complete Bipartite Subgraphs FSTTCS 2007: Foundations of Software Technology and Theoretical Computer Science, 27th International Conference, New Delhi, India, December 12-14, 2007, Proceedings (Vikraman Arvind, Sanjiva Prasad, eds.), volume 4855 of Lecture Notes in Computer Science, pages 340-351, 2007, Springer Verlag. |
| [130] | On the Complexity of Some Colorful Problems Parameterized by Treewidth Proceedings of COCOA 2007, Combinatorial Optimization and Applications, First International Conference, Xi'an, China, August 14-16, 2007, volume 4616 of Lecture Notes in Computer Science, pages 366-377, 2007, Springer Verlag. |
| [129] | Parameterized Proof Complexity Proceedings of the 48th Annual Symposium on Foundations of Computer Science (FOCS 2007), October 20-23, 2007, Providence, RI, USA, pages 150-160, 2007, IEEE Press. |
| [128] | Improved Protein Identification After Fast Elimination of Non-Interpretable Peptide MS/MS Spectra and Noise Reduction May 2007, PhD thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms. Note: supervised by G. Raidl and F. Eisenhaber |
| [127] | Map-Matching und Wegsuche in einem geografischen Informationssystem Dec 2007, Master's thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms. Note: supervised by G. Raidl |
| [126] | Subgradient Optimization Based Lagrangian Relaxation and Relax-and-Cut Approaches for the Bounded Diameter Minimum Spanning Tree Problem Oct 2007, Master's thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms. Note: supervised by G. Raidl |
| [125] | Algorithmic Approaches to the String Barcoding Problem Oct 2007, Master's thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms. Note: supervised by G. Raidl |
| [124] | Metaheuristic Approaches for Designing Survivable Fiber-Optic Networks Mar 2007, Master's thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms. Note: supervised by G. Raidl and D. Wagner |
| [123] | A Lagrangian Decomposition/Evolutionary Algorithm Hybrid for the Knapsack Constrained Maximum Spanning Tree Problem 2007, Technical report TR 186–1–07–03, Institute of Computer Graphics and Algorithms, Vienna University of Technology. |
| [122] | The Generalized Minimum Edge Biconnected Network Problem: Efficient Neighborhood Structures for Variable Neighborhood Search 2007, Technical report TR 186–1–07–02, Institute of Computer Graphics and Algorithms, Vienna University of Technology. |
| [121] | The Multidimensional Knapsack Problem: Structure and Algorithms 2007, Technical report TR 186–1–07–02, Institute of Computer Graphics and Algorithms, Vienna University of Technology. |
| 2006 | |
| [120] | Evolutionary Computation in Combinatorial Optimization – EvoCOP 2006 (J. Gottlieb, G. R. Raidl, eds.), volume 3906 of LNCS, 2006, Springer. |
| [119] | Biased Mutation Operators for Subgraph-Selection Problems IEEE Transactions on Evolutionary Computation, volume 10, number 2, pages 145–156, 2006, IEEE Press. Note: previous technical report version at https://www.ac.tuwien.ac.at/files/pub/raidl-05.pdf |
| [118] | Cleaning of Raw Peptide MS/MS Spectra: Improved Protein Identification Following Deconvolution of Multiply Charged Peaks, Isotope Clusters, and Removal of Background Noise Proteomics, volume 6, number 19, pages 5117–5131, 2006, Wiley. |
| [117] | A note on unsatisfiable k-CNF formulas with few occurrences per variable SIAM J. Discrete Math., volume 20, number 2, pages 523-528, 2006. |
| [116] | On Finding Short Resolution Refutations and Small Unsatisfiable Subsets Theoretical Computer Science, volume 351, number 3, pages 351-359, 2006. |
| [115] | A Unified View on Hybrid Metaheuristics Proceedings of the Hybrid Metaheuristics Workshop (Francisco Almeida, others, eds.), volume 4030 of LNCS, pages 1–12, 2006, Springer. |
| [114] | The Core Concept for the Multidimensional Knapsack Problem Evolutionary Computation in Combinatorial Optimization – EvoCOP 2006 (Jens Gottlieb, Günther R. Raidl, eds.), volume 3906 of LNCS, pages 195–208, 2006, Springer. |
| [113] | Evolutionary Approach to Constrained Minimum Spanning Tree Problem Evolutionary Computation and Global Optimization 2006 (Jaroslawa Arabasa, ed.), pages 331–341, 2006. |
| [112] | A Mixed-Integer Program for Drawing High-Quality Metro Maps Graph Drawing (GD'05) (Patrick Healy, Nikola S. Nikolov, eds.), volume 3843 of LNCS, pages 321–333, 2006, Springer Berlin Heidelberg. |
| [111] | Variable Neighborhood Descent with Self-Adaptive Neighborhood-Ordering Proceedings of the 7th EU/MEeting on Adaptive, Self-Adaptive, and Multi-Level Metaheuristics (Carlos Cotta, Antonio J. Fernandez, Jose E. Gallardo, eds.), 2006. |
| [110] | Neighborhood Searches for the Bounded Diameter Minimum Spanning Tree Problem Embedded in a VNS, EA, and ACO Proceedings of the Genetic and Evolutionary Computation Conference – GECCO 2006 (Maarten Keijzer, others, eds.), pages 1187–1194, 2006, ACM. |
| [109] | Constraint satisfaction with bounded treewidth revisited Proceedings of CP 2006 , Twelfth International Conference on Principles and Practice of Constraint Programming, September 24-29, 2006, Nantes, France, volume 4204 of Lecture Notes in Computer Science, pages 499-513, 2006. Note: Full version appeared in Constraints |
| [108] | Solving #SAT using Vertex Covers Proceedings of SAT 2006, Ninth International Conference on Theory and Applications of Satisfiability Testing, August 12-15, 2006, Seattle, Washington, USA, volume 4121 of Lecture Notes in Computer Science, pages 396-409, 2006. |
| [107] | Fixed-Parameter Complexity of Minimum Profile Problems Proceedings of IWPEC 2006, 2nd International Workshop on Parameterized and Exact Computation, volume 4169 of Lecture Notes in Computer Science, pages 60-71, 2006, Springer Verlag. |
| [106] | The Linear Arrangement Problem Parameterized Above Guaranteed Value Algorithms and Complexity, 6th Italian Conference, CIAC 2006, Rome, Italy, May 29-31, 2006, Proceedings (Tiziana Calamoneri, Irene Finocchi, Giuseppe F. Italiano, eds.), volume 3998 of Lecture Notes in Computer Science, pages 356-367, 2006, Springer Verlag. |
| [105] | Clique-width Minimization is NP-hard Proceedings of STOC 2006; the 38th ACM Symposium on Theory of Computing, Seattle, Washington, USA, pages 354–362, 2006, Assoc. Comput. Mach., New York. |
| [104] | Combining Metaheuristics and Integer Programming for Solving Cutting and Packing Problems Jan 2006, PhD thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms. Note: supervised by G. R. Raidl and U. Pferschy |
| [103] | Cluster Planarity Testing for the Case of Not Necessarily Connected Clusters Dec 2006, Master's thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms. Note: supervised by G. Raidl, R. Weiskircher, and M. Percan |
| [102] | A Lagrangian Decomposition Approach Combined with Metaheuristics for the Knapsack Constrained Maximum Spanning Tree Problem Oct 2006, Master's thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms. Note: supervised by G. Raidl and J. Puchinger |
| [101] | Solving Two Generalized Network Design Problems with Exact and Heuristic Methods May 2006, Master's thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms. Note: supervised by G. Raidl and B. Hu |
| [100] | Bestimmung der Bahnelemente von extrasolaren Planeten aufgrund von Radialgeschwindigkeitsmessdaten mittels evolutionärer Algorithmen Jan 2006, Master's thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms. Note: supervised by G. Raidl |
| [99] | An Ant Colony Optimisation Algorithm for the Bounded Diameter Minimum Spanning Tree Problem Jan 2006, Master's thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms. Note: supervised by G. Raidl and M. Gruber |
| [98] | Bringing Order into the Neighborhoods: Relaxation Guided Variable Neighborhood Search 2006, Technical report TR 186–1–06–02, Institute of Computer Graphics and Algorithms, Vienna University of Technology. |
| [97] | Combining Variable Neighborhood Search with Integer Linear Programming for the Generalized Minimum Spanning Tree Problem 2006, Technical report TR 186–1–06–01, Institute of Computer Graphics and Algorithms, Vienna University of Technology. |
| 2005 | |
| [96] | Proceedings of the Genetic and Evolutionary Computation Conference, GECCO-2005 (H.-G. Beyer, U.-M. O'Reilly, D.V. Arnold, W. Banzhaf, C. Blum, E.W. Bonabeau, E. Cantú Paz, D. Dasgupta, K. Deb, J.A. Foster, E.D. de Jong, H. Lipson, X. Llora, S. Mancoridis, M. Pelikan, G.R. Raidl, T. Soule, A. Tyrrell, J.-P. Watson, E. Zitzler, eds.), 2005, ACM Press. |
| [95] | Evolutionary Computation in Combinatorial Optimization – EvoCOP 2005 (G. R. Raidl, J. Gottlieb, eds.), volume 3448 of LNCS, 2005, Springer. |
| [94] | Proceedings of the 2005 IEEE Congress on Evolutionary Computation (David Corne, Zbigniew Michalewicz, Marco Dorigo, Gusz Eiben, David Fogel, Carlos Fonseca, Garrison Greenwood, Tan Kay Chen, Günther Raidl, Ali Zalzala, Simon Lucas, Ben Paechter, Jennifier Willies, Juan J. Merelo Guervos, Eugene Eberbach, Bob McKay, Alastair Channon, Ashutosh Tiwari, L. Gwenn Volkert, Dan Ashlock, Marc Schoenauer, eds.), 2005, IEEE Press. |
| [93] | Evolutionary Computation: An Overview and Recent Trends ÖGAI Journal, volume 24, pages 2–7, 2005, Österreichische Gesellschaft für Artificial Intelligence. |
| [92] | Empirical Analysis of Locality, Heritability and Heuristic Bias in Evolutionary Algorithms: A Case Study for the Multidimensional Knapsack Problem Evolutionary Computation Journal, volume 13, number 4, pages 441–475, 2005. |
| [91] | The Complexity of Resolution with Generalized Symmetry Rules Theory Comput. Syst., volume 38, number 2, pages 171-188, 2005. |
| [90] | Backdoor Sets for DLL Subsolvers Journal of Automated Reasoning, volume 35, number 1-3, pages 73-88, 2005. Note: Reprinted as Chapter 4 of the book SAT 2005 - Satisfiability Research in the Year 2005, edited by E. Giunchiglia and T. Walsh, Springer Verlag, 2006 |
| [89] | Generalizations of matched CNF formulas Ann. Math. Artif. Intell., volume 43, number 1-4, pages 223-238, 2005. |
| [88] | Computing unsatisfiable k-SAT instances with few occurrences per variable Theoretical Computer Science, volume 337, number 1-3, pages 347-359, 2005. Note: Supplementary material is available at https://www.ac.tuwien.ac.at/files/pub/HoorySzeider05.tar.gz |
| [87] | On Edge-Colored Graphs Covered by Properly Colored Cycles Graphs and Combinatorics, volume 21, number 3, pages 301-206, 2005. |
| [86] | Relaxation Guided Variable Neighborhood Search Proceedings of the 18th Mini Euro Conference on Variable Neighborhood Search (Pierre Hansen, Nenad Mladenović, José A. Moreno Pérez, Belén Melián Batista, J. Marcos Moreno-Vega, eds.), 2005. |
| [85] | Cooperating Memetic and Branch-and-Cut Algorithms for Solving the Multidimensional Knapsack Problem Proceedings of MIC2005, the 6th Metaheuristics International Conference, pages 775–780, 2005. |
| [84] | Combining Metaheuristics and Exact Algorithms in Combinatorial Optimization: A Survey and Classification Proceedings of the First International Work-Conference on the Interplay Between Natural and Artificial Computation, Part II, volume 3562 of LNCS, pages 41–53, 2005, Springer. |
| [83] | A Variable Neighborhood Search Approach for Solving the Car Sequencing Problem Proceedings of the 18th Mini Euro Conference on Variable Neighborhood Search (Pierre Hansen, Nenad Mladenović, José A. Moreno Pérez, Belén Melián Batista, J. Marcos Moreno-Vega, eds.), 2005. |
| [82] | Computing Generalized Minimum Spanning Trees with Variable Neighborhood Search Proceedings of the 18th Mini Euro Conference on Variable Neighborhood Search (Pierre Hansen, Nenad Mladenović, José A. Moreno Pérez, Belén Melián Batista, J. Marcos Moreno-Vega, eds.), 2005. |
| [81] | Variable Neighborhood Search for the Bounded Diameter Minimum Spanning Tree Problem Proceedings of the 18th Mini Euro Conference on Variable Neighborhood Search (Pierre Hansen, Nenad Mladenović, José A. Moreno Pérez, Belén Melián Batista, J. Marcos Moreno-Vega, eds.), 2005. |
| [80] | A New 0–1 ILP Approach for the Bounded Diameter Minimum Spanning Tree Problem Proceedings of the 2nd International Network Optimization Conference 2005 (L Gouveia, C. Mourão, eds.), pages 178–185, 2005. |
| [79] | Dynamische Reihenfolgeoptimierung mittels Simulation und Meta-Heuristiken Aug 2005, Master's thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms. Note: supervised by G. Raidl and W. Stöcher, Profactor Produktionsforschungs GmbH, Steyr, Austria |
| [78] | Automated Drawing of Metro Maps AUG 2005, Master's thesis, Fakultät für Informatik, Universität Karlsruhe (TH). |
| [77] | Eine generische Bibliothek für Metaheuristiken und ihre Anwendung auf das Quadratic Assignment Problem Aug 2005, Master's thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms. Note: supervised by G. Raidl |
| [76] | Multiple Structural RNA Alignment with Affine Gap Costs Based on Lagrangian Relaxation Aug 2005, Master's thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms. Note: supervised by G. Raidl and G. Klau |
| [75] | Exact and Heuristic Methods for Solving the Car Sequencing Problem Aug 2005, Master's thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms. Note: supervised by G. Raidl and B. Hu |
| [74] | An Application of Dijkstra's Algorithm for a (On-Board) Route (Re-)Planning Module Jul 2005, Master's thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms. Note: supervised by G. Raidl and J. Puchinger, in cooperation with the European Aeronautic Defence and Space Company (EADS), Munich, Germany |
| [73] | An Extended Local Branching Framework and its Application to the Multidimensional Knapsack Problem Mar 2005, Master's thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms. Note: supervised by G. Raidl and J. Puchinger |
| [72] | Option Pricing by Means of Genetic Programming Feb 2005, Master's thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms. Note: supervised by G. Raidl |
| [71] | An Integer Linear Programming Approach and a Hybrid Variable Neighborhood Search for the Car Sequencing Problem 2005, Technical report TR 186–1–05–01, Institute of Computer Graphics and Algorithms, Vienna University of Technology. |
| 2004 | |
| [70] | Special Issue on Evolutionary Computation in Combinatorial Optimization (J. Gottlieb, E. Hart, M. Middendorf, G. R. Raidl, C. Reeves, eds.), volume 4(3) of Journal of Mathematical Modelling and Algorithms, 2004, Kluwer Academic Publishers. |
| [69] | Applications of Evolutionary Computing: EvoWorkshops 2004 (Günther R. Raidl, Stefano Cagnoni, Jürgen Branke, David W. Corne, Rolf Drechsler, Yaochu Jin, Colin Johnson, Penousal Machado, Elena Marchiori, Franz Rothlauf, George D. Smith, Giovanni Squillero, eds.), volume 3005 of LNCS, 2004, Springer. |
| [68] | Evolutionary Computation in Combinatorial Optimization – EvoCOP 2004 (J. Gottlieb, G. R. Raidl, eds.), volume 3004 of LNCS, 2004, Springer. |
| [67] | Minimal unsatisfiable formulas with bounded clause-variable difference are fixed-parameter tractable Journal of Computer and System Sciences, volume 69, number 4, pages 656-674, 2004. |
| [66] | On Theorems Equivalent with Kotzig's Result on Graphs with Unique 1-Factors Ars Combinatoria, volume 73, pages 53-64, 2004. |
| [65] | Validation in the Cluster Analysis of Gene Expression Data Workshop Fuzzy-Systeme und Computational Intelligence (R. Mikut, M. Reischl, eds.), pages 13-32, NOV 2004, Universitätsverlag Karlsruhe. |
| [64] | An Improved Hybrid Genetic Algorithm for the Generalized Assignment Problem Proceedings of the 2003 ACM Symposium on Applied Computing (H. M. Haddadd, others, eds.), pages 990–995, 2004, ACM Press. |
| [63] | An Evolutionary Algorithm for Column Generation in Integer Programming: an Effective Approach for 2D Bin Packing Parallel Problem Solving from Nature – PPSN VIII (X. Yao et. al, ed.), volume 3242 of LNCS, pages 642–651, 2004, Springer. |
| [62] | Solving a Real-World Glass Cutting Problem Evolutionary Computation in Combinatorial Optimization – EvoCOP 2004 (Jens Gottlieb, Günther R. Raidl, eds.), volume 3004 of LNCS, pages 162–173, 2004, Springer. |
| [61] | An Evolutionary Algorithm for the Maximum Weight Trace Formulation of the Multiple Sequence Alignment Problem Parallel Problem Solving from Nature – PPSN VIII (Xin Yao, others, eds.), volume 3242 of LNCS, pages 302–311, 2004, Springer-Verlag. |
| [60] | Combining a Memetic Algorithm with Integer Programming to Solve the Prize-Collecting Steiner Tree Problem Genetic and Evolutionary Computation – GECCO 2004 (K. Deb, others, eds.), volume 3102 of LNCS, pages 1304–1315, 2004, Springer. |
| [59] | On fixed-parameter tractable parameterizations of SAT Theory and Applications of Satisfiability, 6th International Conference, SAT 2003, Selected and Revised Papers (Enrico Giunchiglia, Armando Tacchella, eds.), volume 2919 of Lecture Notes in Computer Science, pages 188-202, 2004, Springer Verlag. |
| [58] | The Parameterized Complexity of SAT Backdoors Computing: The Australasian Theory Symposium (CATS 2004) (Mike Atkinson, ed.), pages 252-261, 2004. Note: Informal Proceedings |
| [57] | Detecting Backdoor Sets with Respect to Horn and Binary Clauses Proceedings of SAT 2004 (Seventh International Conference on Theory and Applications of Satisfiability Testing, 10-13 May, 2004, Vancouver, BC, Canada), pages 96-103, 2004. |
| [56] | Computing Unsatisfiable k-SAT Instances with Few Occurrences per Variable SAT 2004 - The Seventh International Conference on Theory and Applications of Satisfiability Testing, 10-13 May 2004, Vancouver, BC, Canada, Online Proceedings, 2004. |
| [55] | On Finding Short Resolution Refutations and Small Unsatisfiable Subsets 1st International Workshop on Parameterized and Exact Computation (IWPEC 2004) (Rod Downey, Michael Fellows, Frank Dehne, eds.), volume 3162 of Lecture Notes in Computer Science, pages 223-234, 2004, Springer Verlag. |
| [54] | Ein Genetischer Algorithmus für das Optimum Communication Spanning Tree Problem Nov 2004, Master's thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms. Note: supervised by G. Raidl |
| [53] | An Alignment Graph based Evolutionary Algorithm for the Multiple Sequence Alignment Problem Feb 2004, Master's thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms. Note: supervised by G. Raidl and G. Koller |
| [52] | Biased Mutation Operators for Subgraph-Selection Problems 2004, Technical report TR 186–1–04–06, Institute of Computer Graphics and Algorithms, Vienna University of Technology. |
| [51] | Empirical Analysis of Locality, Heritability and Heuristic Bias in Evolutionary Algorithms: A Case Study for the Multidimensional Knapsack Problem 2004, Technical report TR 186–1–04–05, Institute of Computer Graphics and Algorithms, Vienna University of Technology. |
| [50] | Models and Algorithms for Three-Stage Two-Dimensional Bin Packing 2004, Technical report TR 186–1–04–04, Institute of Computer Graphics and Algorithms, Vienna University of Technology. |
| 2003 | |
| [49] | Applications of Evolutionary Computing: EvoWorkshops 2003 (G. Raidl, S. Cagnoni, J. J. R. Cardalda, D. Corne, J. Gottlieb, Agnes Guillot, Emma Hart, Colin G. Johnson, Elena Marchiori, Jean-Arcady Meyer, Martin Middendorf, eds.), volume 2611 of LNCS, 2003, Springer. |
| [48] | Edge-Sets: An Effective Evolutionary Coding of Spanning Trees IEEE Transactions on Evolutionary Computation, volume 7, number 3, pages 225–239, 2003. Note: previous technical report version at https://www.ac.tuwien.ac.at/files/pub/raidl-01.pdf |
| [47] | A Memetic Algorithm for Minimum-Cost Vertex-Biconnectivity Augmentation of Graphs Journal of Heuristics, volume 9, pages 401–427, 2003, Kluwer Academic Publishers. Note: previous technical report version at https://www.ac.tuwien.ac.at/files/pub/ljubic-02.pdf |
| [46] | Homomorphisms of Conjunctive Normal Forms Discr. Appl. Math., volume 130, number 2, pages 351-365, 2003. |
| [45] | Finding paths in graphs avoiding forbidden transitions Discr. Appl. Math., volume 126, number 2-3, pages 239-251, 2003. |
| [44] | Greedy Heuristics and an Evolutionary Algorithm for the Bounded-Diameter Minimum Spanning Tree Problem Proceedings of the 2003 ACM Symposium on Applied Computing (G. Lamont, others, eds.), pages 747–752, 2003, ACM Press. |
| [43] | A Permutation-Coded Evolutionary Algorithm for the Bounded-Diameter Minimum Spanning Tree Problem in 2003 Genetic and Evolutionary Computation Conference's Workshops Proceedings, Workshop on Analysis and Design of Representations (A. Barry, F. Rothlauf, D. Thierens, others, eds.), pages 2–7, 2003. Note: best paper award winner of the workshop |
| [42] | Minimal unsatisfiable formulas with bounded clause-variable difference are fixed-parameter tractable Proceedings of the 9th International Computing and Combinatorics Conference (COCOON'03) (T. Warnow, B. Zhu, eds.), volume 2697 of Lecture Notes in Computer Science, pages 548-558, 2003, Springer Verlag. |
| [41] | The complexity of resolution with generalized symmetry rules Proceedings of the 20th International Symposium on Theoretical Aspects of Computer Science (STACS'03) (Helmut Alt, Michel Habib, eds.), volume 2607 of Lecture Notes in Computer Science, pages 475-486, 2003. |
| [40] | Hybrid Evolutionary Algorithms for Combinatorial Optimization Mar 2003, Habilitation thesis at the Vienna University of Technology. |
| [39] | Ein evolutionärer Algorithmus zur Lösung des Vertex-Biconnectivity Augmentation Problems Sep 2003, Master's thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms. Note: supervised by G. Raidl |
| [38] | Neue heuristische Lösungsansätze für das Multiple Sequence Alignment Problem May 2003, Master's thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms. Note: supervised by G. Raidl and G. Koller |
| [37] | Verfahren zur Lösung eines Glasverschnittproblems May 2003, Master's thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms. Note: supervised by G. Raidl and G. Koller |
| [36] | Ein Genetischer Algorithmus für das Generalized Assignment Problem Apr 2003, Master's thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms. Note: supervised by G. Raidl |
| [35] | Minimal unsatisfiable formulas with bounded clause-variable difference are fixed-parameter tractable 2003, Technical report TR03-002, Revision 1, Electronic Colloquium on Computational Complexity (ECCC). |
| 2002 | |
| [34] | Applications of Evolutionary Computing: EvoWorkshops 2002 (S. Cagnoni, J. Gottlieb, E. Hart, M. Middendorf, G. R. Raidl, eds.), volume 2279 of LNCS, 2002, Springer. |
| [33] | Evolutionary Local Search for the Edge-Biconnectivity Augmentation Problem Information Processing Letters, volume 82, number 1, pages 39–45, 2002. Note: previous technical report version at https://www.ac.tuwien.ac.at/files/pub/raidl-02.pdf |
| [32] | Polynomial-time recognition of minimal unsatisfiable formulas with fixed clause-variable difference Theoretical Computer Science, volume 289, number 1, pages 503-516, 2002. |
| [31] | Generalizations of matched CNF formulas Proceedings of the Fifth International Symposium on the Theory and Applications of Satisfiability Testing (SAT 2002) Cincinnati, Ohio, USA, May 6-9, 2002 (John Franco, ed.), pages 292-307, 5 2002. |
| [30] | Letting Ants Labeling Point Features Proceedings of the 2002 IEEE Congress on Evolutionary Computation (D. Fogel, others, eds.), pages 1564–1569, 2002, IEEE Press. |
| [29] | On Weight-Biased Mutation for Graph Problems Parallel Problem Solving from Nature – PPSN VII (J. J. Merelo Guervos, P. Adamidis, H.-G. Beyer, J.-L. Fernández-Villacañas, H.-P. Schwefel, eds.), volume 2439 of LNCS, pages 204–213, 2002. |
| [28] | A Memetic Algorithm for Vertex-Biconnectivity Augmentation Applications of Evolutionary Computing: EvoWorkshops 2002 (S. Cagnoni, others, eds.), volume 2279 of LNCS, pages 102–111, 2002, Springer. |
| [27] | Initialization is Robust in Evolutionary Algorithms that Encode Spanning Trees as Sets of Edges Proceedings of the 2002 ACM Symposium on Applied Computing (G. Lamont, others, eds.), pages 547–552, 2002, ACM Press. |
| 2001 | |
| [26] | Applications of Evolutionary Computing: EvoWorkshops 2001 (E. J.-W. Boers, S. Cagnoni, J. Gottlieb, E. Hart, P. L. Lanzi, G. R. Raidl, R. E. Smith, H. Tijink, eds.), volume 2037 of LNCS, 2001, Springer. |
| [25] | An Evolutionary Algorithm with Stochastic Hill-Climbing for the Edge-Biconnectivity Augmentation Problem Applications of Evolutionary Computing: EvoWorkshops 2001 (E. J.-W. Boers, others, eds.), volume 2037 of LNCS, pages 20–29, 2001, Springer. |
| [24] | Weight-Biased Edge-Crossover in Evolutionary Algorithms for Two Graph Problems Proceedings of the 16th ACM Symposium on Applied Computing (G. Lamont, others, eds.), pages 321–326, 2001, ACM Press. |
| [23] | Prüfer Numbers: A Poor Representation of Spanning Trees for Evolutionary Search Proceedings of the 2001 Genetic and Evolutionary Computation Conference (L. Spector, others, eds.), pages 343–350, 2001, Morgan Kaufmann. |
| [22] | NP-Completeness of Refutability by Literal-Once Resolution IJCAR 2001, Proceedings of the International Joint Conference on Automated Reasoning (R. Goré, A. Leitsch, T. Nipkow, eds.), volume 2083 of Lecture Notes in Artificial Intelligence, pages 168-181, 2001, Springer Verlag. |
| [21] | Conjunctive Normal Forms with Bounded Deficiency 9 2001, PhD thesis, University of Vienna. |
| 2000 | |
| [20] | An Efficient Evolutionary Algorithm for the Degree-Constrained Minimum Spanning Tree Problem Proceedings of the 2000 IEEE Congress on Evolutionary Computation (C. Fonseca, others, eds.), pages 104–111, 2000, IEEE Press. |
| [19] | A Predecessor Coding in an Evolutionary Algorithm for the Capacitated Minimum Spanning Tree Problem Late Breaking Papers at the 2000 Genetic and Evolutionary Computation Conference, pages 309–316, 2000. |
| [18] | A Weighted Coding in a Genetic Algorithm for the Degree-Constrained Minimum Spanning Tree Problem Proceedings of the 2000 ACM Symposium on Applied Computing (J. Carroll, others, eds.), pages 440–445, 2000, ACM Press. |
| [17] | A Hybrid GA for the Edge-Biconnectivity Augmentation Problem Parallel Problem Solving from Nature – PPSN VI (K. Deb, others, eds.), volume 1917 of LNCS, pages 641–650, 2000, Springer. |
| [16] | The Effects of Locality on the Dynamics of Decoder-Based Evolutionary Search Proceedings of the 2000 Genetic and Evolutionary Computation Conference (D. Whitley, others, eds.), pages 283–290, 2000, Morgan Kaufmann. |
| 1999 | |
| [15] | The Multiple Container Packing Problem: A Genetic Algorithm Approach with Weighted Codings ACM SIGAPP Applied Computing Review, volume 7, number 2, pages 22–31, 1999, ACM Press. |
| [14] | On the Importance of Phenotypic Duplicate Elimination in Decoder-Based Evolutionary Algorithms Late Breaking Papers at the 1999 Genetic and Evolutionary Computation Conference (Scott Brave, Annie S. Wu, eds.), pages 204–211, 1999. |
| [13] | An Evolutionary Approach to Point-Feature Label Placement Proceedings of the 1999 Genetic and Evolutionary Computation Conference (Wolfgang Banzhaf, others, eds.), pages 807, 1999, Morgan Kaufmann. Note: short paper |
| [12] | Weight-Codings in a Genetic Algorithm for the Multiconstraint Knapsack Problem Proceedings of the 1999 IEEE Congress on Evolutionary Computation (Peter J. Angeline, others, eds.), pages 596–603, 1999, IEEE Press. |
| [11] | A Weight-Coded Genetic Algorithm for the Multiple Container Packing Problem Proceedings of the 1999 ACM Symposium on Applied Computing (Janice Carroll, others, eds.), pages 291–296, 1999, ACM Press. |
| [10] | Characterizing Locality in Decoder-Based EAs for the Multidimensional Knapsack Problem Proceedings of Artificial Evolution: Fourth European Conference (Cyril Fonlupt, others, eds.), volume 1829 of LNCS, pages 38–52, 1999, Springer. |
| 1998 | |
| [9] | Proceedings of the International Conference on Imaging Science, Systems, and Technology (H. R. Arabnia, P.-C. Chung, J. B. Farison, G. R. Raidl, M. Sarfraz, Z. Zhang, eds.), 1998, CSREA Press. |
| [8] | Transforming an Analytically Defined Color Space to Match Psychophysically Gained Color Distances Proceedings of the SPIE's 10th International Symposium on Electronic Imaging: Science and Technology (G. B. Beretta, R. Eschbach, eds.), pages 98–106, 1998. |
| [7] | A Genetic Algorithm for Labeling Point Features Proceedings of the International Conference on Imaging Science, Systems and Technology (H. R. Arabnia, P.-C. Chung, J. B. Farison, G. R. Raidl, M. Sarfraz, Z. Zhang, eds.), pages 189–196, 1998, CSREA Press. |
| [6] | Approximation with Evolutionary Optimized Tensor Product Bernstein Polynomials Proceedings of the International Conference on Artificial Intelligence in Industry: From Theory to Practice (J. Sarnovsky, others, eds.), pages 247–256, 1998. |
| [5] | A Hybrid GP Approach for Numerically Robust Symbolic Regression Proceedings of the 3rd Annual Genetic Programming Conference (J. Koza, others, eds.), pages 323–328, 1998, Morgan Kaufmann. |
| [4] | An Improved Genetic Algorithm for the Multiconstrained 0–1 Knapsack Problem Proceedings of the 5th IEEE International Conference on Evolutionary Computation (D. Fogel, others, eds.), pages 207–211, 1998, IEEE Press. |
| [3] | Genetic Algorithms for the Multiple Container Packing Problem Proceedings of the 5th International Conference on Parallel Problem Solving from Nature – PPSN V (Agoston E. Eiben, others, eds.), volume 1498 of LNCS, pages 875–884, 1998, Springer. |
| [2] | Evolutionary Optimized Tensor Product Bernstein Polynomials versus Backpropagation Networks Proceedings of the International ICSC/IFAC Symposium on Neural Computation, pages 885–890, 1998. |
| 1994 | |
| [1] | Progressives, adaptives Ray-Tracing von Bildern mit hoher zeitlicher Kohärenz 1994, PhD thesis, Vienna University of Technology. |
