MFCS B

74 papers

YearTitle / Authors
2013A Constant Factor Approximation for the Generalized Assignment Problem with Minimum Quantities and Unit Size Items.
Marco Bender, Clemens Thielen, Stephan Westphal
2013A Constructive Proof of the Topological Kruskal Theorem.
Jean Goubault-Larrecq
2013A More Efficient Simulation Algorithm on Kripke Structures.
Francesco Ranzato
2013A Note on Deterministic Poly-Time Algorithms for Partition Functions Associated with Boolean Matrices with Prescribed Row and Column Sums.
Leonid Gurvits
2013A Parameterized Complexity Analysis of Combinatorial Feature Selection Problems.
Vincent Froese, René van Bevern, Rolf Niedermeier, Manuel Sorge
2013A Planarity Test via Construction Sequences.
Jens M. Schmidt
2013A Polychromatic Ramsey Theory for Ordinals.
Martin Huschenbett, Jiamou Liu
2013Alternation Trading Proofs and Their Limitations.
Sam Buss
2013An Unusual Temporal Logic.
Alexander Rabinovich
2013Approximation Algorithms for Generalized Plant Location.
Alexander Souza
2013Arithmetic Branching Programs with Memory.
Stefan Mengel
2013Auctions for Partial Heterogeneous Preferences.
Piero A. Bonatti, Marco Faella, Clemente Galdi, Luigi Sauro
2013Bin Packing Games with Selfish Items.
Leah Epstein
2013Bringing Order to Special Cases of Klee's Measure Problem.
Karl Bringmann
2013Clustering on k-Edge-Colored Graphs.
Eric Angel, Evripidis Bampis, Alexander V. Kononov, Dimitris Paparas, Emmanouil Pountourakis, Vassilis Zissimopoulos
2013Complexity of Checking Bisimilarity between Sequential and Parallel Processes.
Wojciech Czerwinski, Petr Jancar, Martin Kot, Zdenek Sawa
2013Computing Behavioral Distances, Compositionally.
Giorgio Bacci, Giovanni Bacci, Kim G. Larsen, Radu Mardare
2013Detecting Regularities on Grammar-Compressed Strings.
Tomohiro I, Wataru Matsubara, Kouji Shimohira, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda, Kazuyuki Narisawa, Ayumi Shinohara
2013Determinacy and Rewriting of Top-Down and MSO Tree Transformations.
Michael Benedikt, Joost Engelfriet, Sebastian Maneth
2013Feasible Combinatorial Matrix Theory.
Ariel Germán Fernández, Michael Soltys
2013Guarding Orthogonal Art Galleries Using Sliding Cameras: Algorithmic and Hardness Results.
Stephane Durocher, Saeed Mehrabi
2013Hardness of Classically Simulating Quantum Circuits with Unbounded Toffoli and Fan-Out Gates.
Yasuhiro Takahashi, Takeshi Yamazaki, Kazuyuki Tanaka
2013Helly Circular-Arc Graph Isomorphism Is in Logspace.
Johannes Köbler, Sebastian Kuhnert, Oleg Verbitsky
2013How to Pack Your Items When You Have to Buy Your Knapsack.
Antonios Antoniadis, Chien-Chung Huang, Sebastian Ott, José Verschae
2013Improved Bounds for Reduction to Depth 4 and Depth 3.
Sébastien Tavenas
2013Improved Complexity Results on k-Coloring P t -Free Graphs.
Shenwei Huang
2013In-Place Binary Counters.
Amr Elmasry, Jyrki Katajainen
2013Learning Reductions to Sparse Sets.
Harry Buhrman, Lance Fortnow, John M. Hitchcock, Bruno Loff
2013Length-Increasing Reductions for PSPACE-Completeness.
John M. Hitchcock, Aduri Pavan
2013Linear-Space Data Structures for Range Frequency Queries on Arrays and Trees.
Stephane Durocher, Rahul Shah, Matthew Skala, Sharma V. Thankachan
2013Logic and Branching Automata.
Nicolas Bedon
2013Logical Aspects of the Lexicographic Order on 1-Counter Languages.
Dietrich Kuske
2013Logical and Structural Approaches to the Graph Isomorphism Problem.
Martin Grohe
2013Mathematical Foundations of Computer Science 2013 - 38th International Symposium, MFCS 2013, Klosterneuburg, Austria, August 26-30, 2013. Proceedings
Krishnendu Chatterjee, Jirí Sgall
2013Meta-kernelization with Structural Parameters.
Robert Ganian, Friedrich Slivovsky, Stefan Szeider
2013Minimal Indices for Successor Search - (Extended Abstract).
Sarel Cohen, Amos Fiat, Moshik Hershcovitch, Haim Kaplan
2013New Polynomial Cases of the Weighted Efficient Domination Problem.
Andreas Brandstädt, Martin Milanic, Ragnar Nevries
2013Noninterference with Local Policies.
Sebastian Eggert, Henning Schnoor, Thomas Wilke
2013On Fixed-Polynomial Size Circuit Lower Bounds for Uniform Polynomials in the Sense of Valiant.
Hervé Fournier, Sylvain Perifel, Rémi de Joannis de Verclos
2013On Stochastic Games with Multiple Objectives.
Taolue Chen, Vojtech Forejt, Marta Z. Kwiatkowska, Aistis Simaitis, Clemens Wiltsche
2013On the Parameterized Complexity of Cutting a Few Vertices from a Graph.
Fedor V. Fomin, Petr A. Golovach, Janne H. Korhonen
2013On the Parameterized Complexity of the Maximum Edge 2-Coloring Problem.
Prachi Goyal, Vikram Kamat, Neeldhara Misra
2013On the Quantifier-Free Dynamic Complexity of Reachability.
Thomas Zeume, Thomas Schwentick
2013On the Recognition of Four-Directional Orthogonal Ray Graphs.
Stefan Felsner, George B. Mertzios, Irina Mustata
2013On the Speed of Constraint Propagation and the Time Complexity of Arc Consistency Testing.
Christoph Berkholz, Oleg Verbitsky
2013Ordering Metro Lines by Block Crossings.
Martin Fink, Sergey Pupyrev
2013Paradigms for Parameterized Enumeration.
Nadia Creignou, Arne Meier, Julian-Steffen Müller, Johannes Schmidt, Heribert Vollmer
2013Parameterized Algorithms for Module Motif.
Meirav Zehavi
2013Parity Games and Propositional Proofs.
Arnold Beckmann, Pavel Pudlák, Neil Thapen
2013Polynomial Threshold Functions and Boolean Threshold Circuits.
Kristoffer Arnsfelt Hansen, Vladimir V. Podolskii
2013Prime Languages.
Orna Kupferman, Jonathan Mosheiff
2013Prior-Free Auctions of Digital Goods.
Elias Koutsoupias
2013Probabilistic Automata with Isolated Cut-Points.
Rohit Chadha, A. Prasad Sistla, Mahesh Viswanathan
2013Random Shortest Paths: Non-euclidean Instances for Metric Optimization Problems.
Karl Bringmann, Christian Engels, Bodo Manthey, B. V. Raghavendra Rao
2013Reachability Analysis of Recursive Quantum Markov Chains.
Yuan Feng, Nengkun Yu, Mingsheng Ying
2013Reachability in Higher-Order-Counters.
Alexander Heußner, Alexander Kartzow
2013Reachability in Register Machines with Polynomial Updates.
Alain Finkel, Stefan Göller, Christoph Haase
2013Rent or Buy Problems with a Fixed Time Horizon.
Leah Epstein, Hanan Zebedat-Haider
2013Reversibility of Computations in Graph-Walking Automata.
Michal Kunc, Alexander Okhotin
2013Revisiting Space in Proof Complexity: Treewidth and Pathwidth.
Moritz Müller, Stefan Szeider
2013Rewriting Guarded Negation Queries.
Vince Bárány, Michael Benedikt, Balder ten Cate
2013Semilinearity and Context-Freeness of Languages Accepted by Valence Automata.
P. Buckheister, Georg Zetzsche
2013Separating Hierarchical and General Hub Labelings.
Andrew V. Goldberg, Ilya P. Razenshteyn, Ruslan Savchenko
2013Separating Regular Languages by Piecewise Testable and Unambiguous Languages.
Thomas Place, Lorijn van Rooijen, Marc Zeitoun
2013Small Depth Proof Systems.
Andreas Krebs, Nutan Limaye, Meena Mahajan, Karteek Sreenivasaiah
2013Solving 3-Superstring in 3 n/3 Time.
Alexander Golovnev, Alexander S. Kulikov, Ivan Mihajlin
2013Space-Efficient Parallel Algorithms for Combinatorial Search Problems.
Andrea Pietracaprina, Geppino Pucci, Francesco Silvestri, Fabio Vandin
2013Strong Completeness for Markovian Logics.
Dexter Kozen, Radu Mardare, Prakash Panangaden
2013Subexponential Algorithm for d-Cluster Edge Deletion: Exception or Rule?
Neeldhara Misra, Fahad Panolan, Saket Saurabh
2013Synthesis from Temporal Specifications: New Applications in Robotics and Model-Driven Development.
Nir Piterman
2013Unlimited Decidability of Distributed Synthesis with Limited Missing Knowledge.
Anca Muscholl, Sven Schewe
2013Validity of Tree Pattern Queries with Respect to Schema Information.
Henrik Björklund, Wim Martens, Thomas Schwentick
2013Which Finitely Ambiguous Automata Recognize Finitely Sequential Functions? - (Extended Abstract).
Sebastian Bala
2013Zeno, Hercules and the Hydra: Downward Rational Termination Is Ackermannian.
Ranko Lazic, Joël Ouaknine, James Worrell