| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Andreas Björklund, Petteri Kaski, Lukasz Kowalik |
Probably Optimal Graph Motifs.  |
STACS  |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Meghana Nasre |
Popular Matchings: Structure and Cheating Strategies. |
STACS |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Kurt Mehlhorn |
Physarum Computations (Invited talk). |
STACS |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Artur Jez |
Recompression: a simple and powerful technique for word equations. |
STACS |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Konstantin Kutzkov |
Deterministic algorithms for skewed matrix products. |
STACS |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Magnus Wahlström |
Abusing the Tutte Matrix: An Algebraic Instance Compression for the K-set-cycle Problem. |
STACS |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Jisu Jeong, O-joung Kwon, Sang-il Oum |
Excluded vertex-minors for graphs of linear rank-width at most k.. |
STACS |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Julien Clément, Thu Hien Nguyen Thi, Brigitte Vallée |
A general framework for the realistic analysis of sorting and searching algorithms. Application to some popular algorithms. |
STACS |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Huschenbett |
The Rank of Tree-Automatic Linear Orderings. |
STACS |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Daniël Paulusma, Friedrich Slivovsky, Stefan Szeider |
Model Counting for CNF Formulas of Bounded Modular Treewidth. |
STACS |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Serge Gaspers, Sebastian Ordyniak, M. S. Ramanujan, Saket Saurabh, Stefan Szeider |
Backdoors to q-Horn. |
STACS |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Danny Z. Chen, Haitao Wang |
L_1 Shortest Path Queries among Polygonal Obstacles in the Plane. |
STACS |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Pawel Gawrychowski, Florin Manea, Robert Mercas, Dirk Nowotka, Catalin Tiseanu |
Finding Pseudo-repetitions. |
STACS |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Markus Jalsenius, Benny Porat, Benjamin Sach |
Parameterized Matching in the Streaming Model. |
STACS |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Michal Pilipczuk |
Computing cutwidth and pathwidth of semi-complete digraphs via degree orderings. |
STACS |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Albert Atserias, Sergi Oliva |
Bounded-width QBF is PSPACE-complete. |
STACS |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Martijn Baartse, Klaus Meer |
The PCP theorem for NP over the reals. |
STACS |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Fedor V. Fomin, Stefan Kratsch, Marcin Pilipczuk, Michal Pilipczuk, Yngve Villanger |
Tight bounds for Parameterized Complexity of Cluster Editing. |
STACS |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Yuval Ishai, Eyal Kushilevitz, Omer Strulovich |
Lossy Chains and Fractional Secret Sharing. |
STACS |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Dániel Marx |
Algorithmic Graph Structure Theory (Tutorial). |
STACS |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, Dimitrios M. Thilikos |
Linear kernels for (connected) dominating set on graphs with excluded topological subgraphs. |
STACS |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Tengyu Ma, Bo Tang 0003, Yajun Wang |
The Simulated Greedy Algorithm for Several Submodular Matroid Secretary Problems. |
STACS |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Andris Ambainis, Arturs Backurs, Juris Smotrovs, Ronald de Wolf |
Optimal quantum query bounds for almost all Boolean functions. |
STACS |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Amin Karbasi, Morteza Zadimoghaddam |
Constrained Binary Identification Problem. |
STACS |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Adam Case, Jack H. Lutz |
Mutual Dimension. |
STACS |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Hartmut Klauck, Ronald de Wolf |
Fooling One-Sided Quantum Protocols. |
STACS |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Edith Hemaspaandra, Lane A. Hemaspaandra, Curtis Menton |
Search versus Decision for Election Manipulation Problems. |
STACS |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Natacha Portier, Thomas Wilke |
Author Index. |
STACS |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Sarah Cannon, Erik D. Demaine, Martin L. Demaine, Sarah Eisenstat, Matthew J. Patitz, Robert T. Schweller, Scott M. Summers, Andrew Winslow |
Two Hands Are Better Than One (up to constant factors): Self-Assembly In The 2HAM vs. aTAM. |
STACS |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Konstantin Makarychev |
Local Search is Better than Random Assignment for Bounded Occurrence Ordering k-CSPs. |
STACS |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Florent Capelli, Arnaud Durand, Stefan Mengel |
The arithmetic complexity of tensor contractions. |
STACS |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Luis Barba, Matias Korman, Stefan Langerman, Rodrigo I. Silveira, Kunihiko Sadakane |
Space-Time Trade-offs for Stack-Based Algorithms. |
STACS |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Mikolaj Bojanczyk, Tomasz Idziaszek, Michal Skrzypczak |
Regular languages of thin trees. |
STACS |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Natacha Portier, Thomas Wilke (eds.) |
30th International Symposium on Theoretical Aspects of Computer Science, STACS 2013, February 27 - March 2, 2013, Kiel, Germany |
STACS |
2013 |
DBLP BibTeX RDF |
|
| 1 | Zachary Abel, Erik D. Demaine, Martin L. Demaine, Sarah Eisenstat, Anna Lubiw, André Schulz, Diane L. Souvaine, Giovanni Viglietta, Andrew Winslow |
Algorithms for Designing Pop-Up Cards. |
STACS |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Nathanaël François, Frédéric Magniez |
Streaming Complexity of Checking Priority Queues. |
STACS |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Yoichi Iwata, Yuichi Yoshida |
Exact and Approximation Algorithms for the Maximum Constraint Satisfaction Problem over the Point Algebra. |
STACS |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Loïck Magnin, Jérémie Roland |
Explicit relation between all lower bound techniques for quantum query complexity. |
STACS |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Manfred Kufleitner, Alexander Lauser |
Quantifier Alternation in Two-Variable First-Order Logic with Successor Is Decidable. |
STACS |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter |
Fast Algorithms for Abelian Periods in Words and Greatest Common Divisor Queries. |
STACS |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Xi Chen, Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum, Pinyan Lu, Colin McQuillan, David Richerby |
The complexity of approximating conservative counting CSPs. |
STACS |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Luc Dartois, Charles Paperman |
Two-variable first order logic with modular predicates over words. |
STACS |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Amir M. Ben-Amram |
Mortality of Iterated Piecewise Affine Functions over the Integers: Decidability and Complexity (extended abstract). |
STACS |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Balagopal Komarath, Jayalal M. N. Sarma |
Pebbling, Entropy and Branching Program Size Lower Bounds. |
STACS |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Malte Darnstädt, Hans Ulrich Simon, Balázs Szörényi |
Unlabeled Data Does Provably Help. |
STACS |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Nicolas Bousquet, Aurélie Lagoutte, Stéphan Thomassé |
Graph coloring, communication complexity and the stubborn problem (Invited talk). |
STACS |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Fedor V. Fomin, Yngve Villanger |
Searching for better fill-in. |
STACS |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Mark Braverman, Gal Oshri |
Search using queries on indistinguishable items. |
STACS |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Marcin Pilipczuk, Michal Pilipczuk, Piotr Sankowski, Erik Jan van Leeuwen |
Subexponential-Time Parameterized Algorithm for Steiner Tree on Planar Graphs. |
STACS |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Marek Cygan, Fabrizio Grandoni, Telikepalli Kavitha |
On Pairwise Spanners. |
STACS |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Emmanuel Jeandel, Pascal Vanier |
Hardness of Conjugacy, Embedding and Factorization of multidimensional Subshifts of Finite Type. |
STACS |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Stefan Kratsch |
On Polynomial Kernels for Sparse Integer Linear Programs. |
STACS |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Ines Klimann |
The finiteness of a group generated by a 2-letter invertible-reversible Mealy automaton is decidable. |
STACS |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Thomas Colcombet, Laure Daviaud |
Approximate comparison of distance automata. |
STACS |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Yonatan Bilu, Amit Daniely, Nati Linial, Michael Saks |
On the practically interesting instances of MAXCUT. |
STACS |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | György Dósa, Jiri Sgall |
First Fit bin packing: A tight analysis. |
STACS |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Thomas Watson |
Advice Lower Bounds for the Dense Model Theorem. |
STACS |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Kousha Etessami |
The complexity of analyzing infinite-state Markov chains, Markov decision processes, and stochastic games (Invited talk). |
STACS |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Leah Epstein, Asaf Levin, Danny Segev, Oren Weimann |
Improved Bounds for Online Preemptive Matching. |
STACS |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Wieslaw Szwast, Lidia Tendera |
FO^2 with one transitive relation is decidable. |
STACS |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Natacha Portier, Thomas Wilke |
Frontmatter, Table of Contents, Preface, Workshop Organization. |
STACS |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Frédérique Bassino, Julien David, Andrea Sportiello |
Asymptotic enumeration of Minimal Automata. |
STACS |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Christoph Dürr, Thomas Wilke (eds.) |
29th International Symposium on Theoretical Aspects of Computer Science, STACS 2012, February 29th - March 3rd, 2012, Paris, France |
STACS |
2012 |
DBLP BibTeX RDF |
|
| 1 | Volker Diekert, Jürn Laun, Alexander Ushakov |
Efficient algorithms for highly compressed data: The Word Problem in Higman's group is in P. |
STACS |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Yuval Filmus, Justin Ward |
The Power of Local Search: Maximum Coverage over a Matroid. |
STACS |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Katarzyna E. Paluch, Khaled M. Elbassioni, Anke van Zuylen |
Simpler Approximation of the Maximum Asymmetric Traveling Salesman Problem. |
STACS |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | George Giakkoupis, Thomas Sauerwald, He Sun 0001, Philipp Woelfel |
Low Randomness Rumor Spreading via Hashing. |
STACS |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Frederik Harwath, Nicole Schweikardt |
Regular tree languages, cardinality predicates, and addition-invariant FO. |
STACS |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | László Babai, Youming Qiao |
Polynomial-time Isomorphism Test for Groups with Abelian Sylow Towers. |
STACS |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Ioannis Koutis, Alex Levin, Richard Peng |
Improved Spectral Sparsification and Numerical Algorithms for SDD Matrices. |
STACS |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | N. S. Narayanaswamy, Venkatesh Raman, M. S. Ramanujan, Saket Saurabh |
LP can be a cure for Parameterized Problems. |
STACS |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Kai-Min Chung, Henry Lam, Zhenming Liu, Michael Mitzenmacher |
Chernoff-Hoeffding Bounds for Markov Chains: Generalized and Simplified. |
STACS |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Gerth Stølting Brodal, Casper Kejlberg-Rasmussen |
Cache-Oblivious Implicit Predecessor Dictionaries with the Working-Set Property. |
STACS |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Paul Bonsma |
Surface Split Decompositions and Subgraph Isomorphism in Graphs on Surfaces. |
STACS |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Maurice J. Jansen, Rahul Santhanam |
Stronger Lower Bounds and Randomness-Hardness Trade-Offs Using Associated Algebraic Complexity Classes. |
STACS |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Marcin Kaminski, Dimitrios M. Thilikos |
Contraction checking in graphs on surfaces. |
STACS |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Ning Chen |
On Computing Pareto Stable Assignments. |
STACS |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Faried Abu Zaid, Erich Grädel, Lukasz Kaiser |
The Field of Reals is not omega-Automatic. |
STACS |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Kei Kimura, Kazuhisa Makino |
Trichotomy for Integer Linear Systems Based on Their Sign Patterns. |
STACS |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Tomás Brázdil, Stefan Kiefer |
Stabilization of Branching Queueing Networks. |
STACS |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | R. Ravi |
Iterative Methods in Combinatorial Optimization (Invited Talk). |
STACS |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Sanjay Jain, Efim B. Kinber |
Mind Change Speed-up for Learning Languages from Positive Data. |
STACS |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Timothy M. Chan, Stephane Durocher, Kasper Green Larsen, Jason Morrison, Bryan T. Wilkinson |
Linear-Space Data Structures for Range Mode Query in Arrays. |
STACS |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Shafi Goldwasser |
Pseudo-deterministic Algorithms (Invited Talk). |
STACS |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | André Arnold, Henryk Michalewski, Damian Niwinski |
On the separation question for tree languages. |
STACS |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Samir Datta, Arjun Gopalan, Raghav Kulkarni, Raghunath Tewari |
Improved Bounds for Bipartite Matching on Surfaces. |
STACS |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Antoine Durand-Gasselin, Peter Habermehl |
Ehrenfeucht-Fraïssé goes elementarily automatic for structures of bounded degree. |
STACS |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Mathieu Hoyrup |
The dimension of ergodic random sequences. |
STACS |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Marcin Mucha |
13/9-approximation for Graphic TSP. |
STACS |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Wolfgang Merkle, Jason Teutsch |
Constant compression and random weights. |
STACS |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Fedor V. Fomin, Petr A. Golovach |
Parameterized Complexity of Connected Even/Odd Subgraph Problems. |
STACS |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Elberfeld, Andreas Jakoby, Till Tantau |
Algorithmic Meta Theorems for Circuit Classes of Constant and Logarithmic Depth. |
STACS |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Olivier Finkel |
The Determinacy of Context-Free Games. |
STACS |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Artur Jez |
Compressed Membership for NFA (DFA) with Compressed Labels is in NP (P). |
STACS |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Dieter Mitsche, Guillem Perarnau |
On the treewidth and related parameters of random geometric graphs. |
STACS |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Stefan Göller, Anthony Widjaja Lin |
Concurrency Makes Simple Theories Hard. |
STACS |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Andreas Bärtschi, Subhash Suri |
Conflict-free Chromatic Art Gallery Coverage. |
STACS |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Carsten Witt |
Optimizing Linear Functions with Randomized Search Heuristics - The Robustness of Mutation. |
STACS |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Thomas Colcombet |
Forms of Determinism for Automata (Invited Talk). |
STACS |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Christopher H. Broadbent |
The Limits of Decidability for First Order Logic on CPDA Graphs. |
STACS |
2012 |
DBLP DOI BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")