default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID39. MFCS 2014: Budapest, Hungary
- Erzsébet Csuhaj-Varjú, Martin Dietzfelbinger, Zoltán Ésik:
Mathematical Foundations of Computer Science 2014 - 39th International Symposium, MFCS 2014, Budapest, Hungary, August 25-29, 2014. Proceedings, Part II. Lecture Notes in Computer Science 8635, Springer 2014, ISBN 978-3-662-44464-1
Algorithms, Complexity and Games
- Hasan Abasi, Nader H. Bshouty, Ariel Gabizon, Elad Haramaty:
On r-Simple k-Path. 1-12 - Eric Allender
, Nikhil Balaji, Samir Datta:
Low-Depth Uniform Threshold Circuits and the Bit-Complexity of Straight Line Programs. 13-24 - Eric Allender, Bireswar Das:
Zero Knowledge and Circuit Minimization. 25-32 - Andris Ambainis, Krisjanis Prusis:
A Tight Lower Bound on Certificate Complexity in Terms of Block Sensitivity and Sensitivity. 33-44 - Tetsuo Asano, David G. Kirkpatrick, Kotaro Nakagawa, Osamu Watanabe:
Õ(√n)-Space and Polynomial-Time Algorithm for Planar Directed Graph Reachability. 45-56 - Rémy Belmonte, Pim van 't Hof, Marcin Jakub Kaminski, Daniël Paulusma:
Forbidden Induced Subgraphs and the Price of Connectivity for Feedback Vertex Set. 57-68 - René van Bevern, Robert Bredereck, Jiehua Chen, Vincent Froese, Rolf Niedermeier, Gerhard J. Woeginger:
Network-Based Dissolution. 69-80 - Olaf Beyersdorff, Leroy Chew, Mikolas Janota:
On Unification of QBF Resolution-Based Calculi. 81-93 - Ivona Bezáková, Zachary Langley:
Minimum Planar Multi-sink Cuts with Connectivity Priors. 94-105 - Vittorio Bilò, Angelo Fanelli, Michele Flammini, Gianpiero Monaco, Luca Moscardelli:
The Price of Envy-Freeness in Machine Scheduling. 106-117 - Beate Bollig:
On the Complexity of Some Ordering Problems. 118-129 - Joan Boyar, Magnus Gausdal Find:
The Relationship between Multiplicative Complexity and Nonlinearity. 130-140 - Leizhen Cai, Junjie Ye:
Dual Connectedness of Edge-Bicolored Graphs and Beyond. 141-152 - Jiehua Chen, Piotr Faliszewski, Rolf Niedermeier, Nimrod Talmon:
Combinatorial Voter Control in Elections. 153-164 - Ruiwen Chen, Valentine Kabanets, Nitin Saurabh:
An Improved Deterministic #SAT Algorithm for Small De Morgan Formulas. 165-176 - Suryajith Chillara, Partha Mukhopadhyay:
On the Limits of Depth Reduction at Depth 3 Over Small Finite Fields. 177-188 - Marek Cygan, Dániel Marx, Marcin Pilipczuk, Michal Pilipczuk:
Hitting Forbidden Subgraphs in Graphs of Bounded Treewidth. 189-200 - Maurits de Graaf, Bodo Manthey:
Probabilistic Analysis of Power Assignments. 201-212 - Julie De Pril, János Flesch, Jeroen Kuipers, Gijs Schoenmakers, Koos Vrieze:
Existence of Secure Equilibrium in Multi-player Games with Perfect Information. 213-225 - Thomas Decker, Gábor Ivanyos, Raghav Kulkarni, Youming Qiao, Miklos Santha:
An Efficient Quantum Algorithm for Finding Hidden Parabolic Subgroups in the General Linear Group. 226-238 - Nicolas Delfosse, Zhentao Li, Stéphan Thomassé:
A Note on the Minimum Distance of Quantum LDPC Codes. 239-250 - Josep Díaz, George B. Mertzios:
Minimum Bisection Is NP-hard on Unit Disk Graphs. 251-262 - Thomas Erlebach, Michael Hoffmann, Frank Kammer:
Query-Competitive Algorithms for Cheapest Set Problems under Uncertainty. 263-274 - Stefan Fafianie, Stefan Kratsch:
Streaming Kernelization. 275-286 - Carl Feghali, Matthew Johnson, Daniël Paulusma:
A Reconfigurations Analogue of Brooks' Theorem. 287-298 - Stefan Felsner, Kolja B. Knauer, George B. Mertzios, Torsten Ueckerdt:
Intersection Graphs of L-Shapes and Segments in the Plane. 299-310 - Christian Glaßer, Maximilian Witek:
Autoreducibility and Mitoticity of Logspace-Complete Sets for NP and Other Classes. 311-323 - Petr A. Golovach:
Editing to a Connected Graph of Given Degrees. 324-335 - Kristoffer Arnsfelt Hansen, Balagopal Komarath, Jayalal Sarma, Sven Skyum, Navid Talebanfard:
Circuit Complexity of Properties of Graphs with Constant Planar Cutwidth. 336-347 - Shuichi Hirahara, Akitoshi Kawamura:
On Characterizations of Randomized Computation Using Plain Kolmogorov Complexity. 348-359 - Chien-Chung Huang, Sebastian Ott:
New Results for Non-Preemptive Speed Scaling. 360-371 - Dmitry Itsykson, Dmitry Sokolov:
Lower Bounds for Splittings by Linear Combinations. 372-383 - Riko Jacob, Tobias Lieber, Nodari Sitchinava:
On the Complexity of List Ranking in the Parallel External Memory Model. 384-395 - Matthew Johnson, Daniël Paulusma, Anthony Stewart:
Knocking Out P k -free Graphs. 396-407 - Peter Jonsson, Victor Lagerkvist, Johannes Schmidt, Hannes Uppman:
Relating the Time Complexity of Optimization Problems in Light of the Exponential-Time Hypothesis. 408-419 - Peter Jonsson, Johan Thapper:
Affine Consistency and the Complexity of Semilinear Constraints. 420-431 - Akitoshi Kawamura, Hiroyuki Ota:
Small Complexity Classes for Computable Analysis. 432-444 - Hartmut Klauck, Supartha Podder:
Two Results about Quantum Messages. 445-456 - Sudeshna Kolay, Pranabendu Misra, M. S. Ramanujan, Saket Saurabh:
Parameterized Approximations via d-Skew-Symmetric Multicut. 457-468 - Ivan Kovác, Ivana Selecéniová, Monika Steinová:
On the Clique Editing Problem. 469-480 - Gergely Kovásznai, Helmut Veith, Andreas Fröhlich, Armin Biere:
On the Complexity of Symbolic Verification and Decision Problems in Bit-Vector Logic. 481-492 - Jan Kratochvíl, Jan Arne Telle, Marek Tesar:
Computational Complexity of Covering Three-Vertex Multigraphs. 493-504 - Nils M. Kriege, Petra Mutzel:
Finding Maximum Common Biconnected Subgraphs in Series-Parallel Graphs. 505-516 - Jeremy Kun, Lev Reyzin:
On Coloring Resilient Graphs. 517-528 - Moshe Lewenstein, J. Ian Munro, Yakov Nekrich, Sharma V. Thankachan:
Document Retrieval with One Wildcard. 529-540 - Akaki Mamageishvili, Matús Mihalák, Simone Montemezzani:
An H n/2 Upper Bound on the Price of Stability of Undirected Network Design Games. 541-552 - Othon Michail, Paul G. Spirakis:
Traveling Salesman Problems in Temporal Graphs. 553-564 - Yuto Nakashima, Takashi Okabe, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Inferring Strings from Lyndon Factorization. 565-576 - Meghana Nasre, Matteo Pontecorvi, Vijaya Ramachandran:
Betweenness Centrality - Incremental and Faster. 577-588 - Ron Y. Pinter, Hadas Shachnai, Meirav Zehavi:
Deterministic Parameterized Algorithms for the Graph Motif Problem. 589-600 - Vyas Ram Selvam:
The Two Queries Assumption and Arthur-Merlin Classes. 601-612 - Hadas Shachnai, Ariella Voloshin, Shmuel Zaks:
Flexible Bandwidth Assignment with Application to Optical Networks - (Extended Abstract). 613-624 - Georgios Stamoulis:
Approximation Algorithms for Bounded Color Matchings via Convex Decompositions. 625-636
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-01-16 21:48 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
