| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Maxim A. Babenko, Alexey Gusakov |
New Exact and Approximation Algorithms for the Star Packing Problem in Undirected Graphs.  |
STACS  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Hubert Comon-Lundh, Véronique Cortier |
How to prove security of communication protocols? A discussion on the soundness of formal models w.r.t. computational ones. |
STACS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Thomas Schwentick, Christoph Dürr |
Frontmatter, Table of Contents, Preface, Conference Organization. |
STACS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Dominik D. Freydenberger |
Extended Regular Expressions: Succinctness and Decidability. |
STACS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Robert Ganian, Petr Hlinený, Jan Obdrzálek |
Clique-width: When Hard Does Not Mean Impossible. |
STACS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Fedor V. Fomin, Daniel Lokshtanov, Neeldhara Misra, Geevarghese Philip, Saket Saurabh |
Hitting forbidden minors: Approximation and Kernelization. |
STACS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Haim Kaplan, Yahav Nussbaum |
Minimum s-t cut in undirected planar graphs when the source and the sink are close. |
STACS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Liah Kor, Amos Korman, David Peleg |
Tight Bounds For Distributed MST Verification. |
STACS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Stefan Gulan |
Graphs Encoded by Regular Expressions. |
STACS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Alex Borello, Gaétan Richard, Véronique Terrier |
A speed-up of oblivious multi-head finite automata by cellular automata. |
STACS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | George Giakkoupis |
Tight bounds for rumor spreading in graphs of a given conductance. |
STACS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrey Yu. Rumyantsev |
Everywhere complex sequences and the probabilistic method. |
STACS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Bart M. P. Jansen, Hans L. Bodlaender |
Vertex Cover Kernelization Revisited: Upper and Lower Bounds for a Refined Parameter. |
STACS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Sze-Hang Chan, Tak Wah Lam, Lap-Kei Lee |
Scheduling for Weighted Flow Time and Energy with Rejection Penalty. |
STACS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Jiun-Jie Wang, Xin He |
Compact Visibility Representation of Plane Graphs. |
STACS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Christian Eggermont, Alexander Schrijver, Gerhard J. Woeginger |
Analysis of multi-stage open shop processing systems. |
STACS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Dariusz Dereniowski |
From Pathwidth to Connected Pathwidth. |
STACS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Laurent Bienvenu, Wolfgang Merkle, André Nies |
Solovay functions and K-triviality. |
STACS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Jérémie Chalopin, Shantanu Das, Yann Disser, Matús Mihalák, Peter Widmayer |
Telling convex from reflex allows to map a polygon. |
STACS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Christian Knauer, Hans Raj Tiwary, Daniel Werner |
On the computational complexity of Ham-Sandwich cuts, Helly sets, and related problems. |
STACS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Samir Datta, Raghav Kulkarni, Raghunath Tewari, N. Variyam Vinodchandran |
Space Complexity of Perfect Matching in Bounded Genus Bipartite Graphs. |
STACS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Nazim Fatès |
Stochastic Cellular Automata Solve the Density Classification Problem with an Arbitrary Precision. |
STACS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Youming Qiao, Jayalal M. N. Sarma, Bangsheng Tang |
On Isomorphism Testing of Groups with Normal Hall Subgroups. |
STACS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Antonios Antoniadis, Falk Hüffner, Pascal Lenzner, Carsten Moldenhauer, Alexander Souza |
Balanced Interval Coloring. |
STACS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Thomas Schwentick, Christoph Dürr (eds.) |
28th International Symposium on Theoretical Aspects of Computer Science, STACS 2011, March 10-12, 2011, Dortmund, Germany |
STACS |
2011 |
DBLP BibTeX RDF |
|
| 1 | George B. Mertzios |
The Recognition of Triangle Graphs. |
STACS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Ana Busic, Jean Mairesse, Irene Marcovici |
Probabilistic cellular automata, invariant measures, and perfect sampling. |
STACS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Pawel Parys |
Collapse Operation Increases Expressive Power of Deterministic Higher Order Pushdown Automata. |
STACS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Timon Hertli, Robin A. Moser, Dominik Scheder |
Improving PPSZ for 3-SAT using Critical Variables. |
STACS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Luc Segoufin, Szymon Torunczyk |
Automata based verification over linearly ordered data domains. |
STACS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrew M. Childs, Robin Kothari |
Quantum query complexity of minor-closed graph properties. |
STACS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Marcel R. Ackermann, Johannes Blömer, Daniel Kuntze, Christian Sohler |
Analysis of Agglomerative Clustering. |
STACS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin E. Dyer, David Richerby |
The #CSP Dichotomy is Decidable. |
STACS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Heng Guo, Sangxia Huang, Pinyan Lu, Mingji Xia |
The Complexity of Weighted Boolean #CSP Modulo k. |
STACS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Jakub Kallas, Manfred Kufleitner, Alexander Lauser |
First-order Fragments with Successor over Infinite Words. |
STACS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Anna Gál, Andrew Mills |
Three Query Locally Decodable Codes with Higher Correctness Require Exponential Length. |
STACS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Balder ten Cate, Luc Segoufin |
Unary negation. |
STACS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrew McGregor, Atri Rudra, Steve Uurtamo |
Polynomial Fitting of Data Streams with Applications to Codeword Testing. |
STACS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Petr Kolman, Christian Scheideler |
Towards Duality of Multicommodity Multiroute Cuts and Flows: Multilevel Ball-Growing. |
STACS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Markus Aschinger, Conrad Drescher, Georg Gottlob, Peter Jeavons, Evgenij Thorstensen |
Structural Decomposition Methods and What They are Good For. |
STACS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | John Case, Timo Kötzing |
Measuring Learning Complexity with Criteria Epitomizers. |
STACS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Denis Kuperberg |
Linear temporal logic for regular cost functions. |
STACS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Mundhenk, Felix Weiß |
The model checking problem for propositional intuitionistic logic with one variable is AC^1-complete. |
STACS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Adrian Dumitrescu, André Schulz, Adam Sheffer, Csaba D. Tóth |
Bounds on the maximum multiplicity of some common geometric graphs. |
STACS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Dominik D. Freydenberger, Hossein Nevisi, Daniel Reidenbach |
Weakly Unambiguous Morphisms. |
STACS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Howard J. Karloff, Flip Korn, Konstantin Makarychev, Yuval Rabani |
On Parsimonious Explanations For 2-D Tree- and Linearly-Ordered Data. |
STACS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Jonathan A. Kelner, Alex Levin |
Spectral Sparsification in the Semi-Streaming Setting. |
STACS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Alejandro López-Ortiz, Claude-Guy Quimper |
A Fast Algorithm for Multi-Machine Scheduling Problems with Jobs of Equal Processing Times. |
STACS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Bruno Grenet, Erich Kaltofen, Pascal Koiran, Natacha Portier |
Symmetric Determinantal Representation of Weakly-Skew Circuits. |
STACS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Magnús M. Halldórsson, Boaz Patt-Shamir, Dror Rawitz |
Online Scheduling with Interval Conflicts. |
STACS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Orna Kupferman, Yoad Lustig, Moshe Y. Vardi, Mihalis Yannakakis |
Temporal Synthesis for Bounded Systems and Environments. |
STACS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Erik D. Demaine, Matthew J. Patitz, Robert T. Schweller, Scott M. Summers |
Self-Assembly of Arbitrary Shapes Using RNAse Enzymes: Meeting the Kolmogorov Bound with Small Scale Factor (extended abstract). |
STACS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Mikolaj Bojanczyk |
Data Monoids. |
STACS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Markus Bläser, Christian Engels |
Randomness Efficient Testing of Sparse Black Box Identities of Unbounded Degree over the Reals. |
STACS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Francine Blanchet-Sadri, John Lensmire |
On Minimal Sturmian Partial Words. |
STACS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Hans L. Bodlaender, Bart M. P. Jansen, Stefan Kratsch |
Cross-Composition: A New Technique for Kernelization Lower Bounds. |
STACS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Saverio Caminiti, Irene Finocchi, Emanuele G. Fusco |
Local dependency dynamic programming in the presence of memory faults. |
STACS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Diego Figueira, Luc Segoufin |
Bottom-up automata on data trees and vertical XPath. |
STACS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Susanne Albers |
Algorithms for Dynamic Speed Scaling. |
STACS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Nader H. Bshouty, Hanna Mazzawi |
Optimal Query Complexity for Reconstructing Hypergraphs. |
STACS |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | László Babai, Anandam Banerjee, Raghav Kulkarni, Vipul Naik |
Evasiveness and the Distribution of Prime Numbers. |
STACS |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Jens M. Schmidt |
Construction Sequences and Certifying 3-Connectedness. |
STACS |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Kowalczyk, Jin-yi Cai |
Holant Problems for Regular Graphs with Complex Edge Functions. |
STACS |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Leah Epstein, Asaf Levin, Julián Mestre, Danny Segev |
Improved Approximation Guarantees for Weighted Matching in the Semi-Streaming Model. |
STACS |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Frederic Dorn, Fedor V. Fomin, Daniel Lokshtanov, Venkatesh Raman, Saket Saurabh |
Beyond Bidimensionality: Parameterized Subexponential Algorithms on Directed Graphs. |
STACS |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Shiri Chechik, David Peleg |
Robust Fault Tolerant Uncapacitated Facility Location. |
STACS |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Julien Cervelle, Enrico Formenti, Pierre Guillon |
Ultimate Traces of Cellular Automata. |
STACS |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | László Egri, Andrei A. Krokhin, Benoit Larose, Pascal Tesson |
The Complexity of the List Homomorphism Problem for Graphs. |
STACS |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Paul Dütting, Monika Henzinger, Ingmar Weber |
Sponsored Search, Market Equilibria, and the Hungarian Method. |
STACS |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Mikolaj Bojanczyk |
Beyond omega-Regular Languages. |
STACS |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Neelesh Khanna, Surender Baswana |
Approximate Shortest Paths Avoiding a Failed Vertex: Optimal Size Data Structures for Unweighted Graphs. |
STACS |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Andreas Björklund |
Exact Covers via Determinants. |
STACS |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Ryan Williams |
Alternation-Trading Proofs, Linear Programming, and Lower Bounds. |
STACS |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Serge Grigorieff, Pierre Valarcher |
Evolving Multialgebras Unify All Usual Sequential Computation Models. |
STACS |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Vladimir Braverman, Kai-Min Chung, Zhenming Liu, Michael Mitzenmacher, Rafail Ostrovsky |
AMS Without 4-Wise Independence on Product Domains. |
STACS |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Jean-Yves Marion, Thomas Schwentick |
Foreword -- 27th International Symposium on Theoretical Aspects of Computer Science. |
STACS |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Rustem Takhanov |
A Dichotomy Theorem for the General Minimum Cost Homomorphism Problem. |
STACS |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Jean-Yves Marion, Thomas Schwentick (eds.) |
27th International Symposium on Theoretical Aspects of Computer Science, STACS 2010, March 4-6, 2010, Nancy, France |
STACS |
2010 |
DBLP BibTeX RDF |
|
| 1 | Lukasz Jez |
Randomized Algorithm for Agreeable Deadlines Packet Scheduling. |
STACS |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Sergey Bravyi, Aram Wettroth Harrow, Avinatan Hassidim |
Quantum Algorithms for Testing Properties of Distributions. |
STACS |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Lutz Schröder, Dirk Pattinson |
Named Models in Coalgebraic Hybrid Logic. |
STACS |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Vikraman Arvind, Srikanth Srinivasan |
The Remote Point Problem, Small Bias Spaces, and Expanding Generator Sets. |
STACS |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | François Le Gall |
An Efficient Quantum Algorithm for Some Instances of the Group Isomorphism Problem. |
STACS |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Frederic Dorn |
Planar Subgraph Isomorphism Revisited. |
STACS |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Alexander Kartzow |
Collapsible Pushdown Graphs of Level 2 are Tree-Automatic. |
STACS |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Jean-Yves Marion, Thomas Schwentick |
Table of Contents - 27th International Symposium on Theoretical Aspects of Computer Science. |
STACS |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Lance Fortnow, Jack H. Lutz, Elvira Mayordomo |
Inseparability and Strong Hypotheses for Disjoint NP Pairs. |
STACS |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Bireswar Das, Jacobo Torán, Fabian Wagner |
Restricted Space Algorithms for Isomorphism on Bounded Treewidth Graphs. |
STACS |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Jirí Fiala, Marcin Kaminski, Bernard Lidický, Daniël Paulusma |
The k-in-a-path Problem for Claw-free Graphs. |
STACS |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Stefan Göller, Markus Lohrey |
Branching-time Model Checking of One-counter Processes. |
STACS |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | David Doty, Jack H. Lutz, Matthew J. Patitz, Scott M. Summers, Damien Woods |
Intrinsic Universality in Self-Assembly. |
STACS |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | George B. Mertzios, Ignasi Sau, Shmuel Zaks |
The Recognition of Tolerance and Bounded Tolerance Graphs. |
STACS |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Rolf Niedermeier |
Reflections on Multivariate Algorithmics and Problem Parameterization. |
STACS |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Maurice J. Jansen |
Weakening Assumptions for Deterministic Subexponential Time Non-Singular Matrix Completion. |
STACS |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Jacques Stern |
Mathematics, Cryptology, Security. |
STACS |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Bireswar Das, Samir Datta, Prajakta Nimbhorkar |
Log-space Algorithms for Paths and Matchings in k-trees. |
STACS |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Anna Adamaszek, Michal Adamaszek |
Large-Girth Roots of Graphs. |
STACS |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Fred van Nijnatten, René Sitters, Gerhard J. Woeginger, Alexander Wolff, Mark de Berg |
The Traveling Salesman Problem under Squared Euclidean Distances. |
STACS |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Fedor V. Fomin, Yngve Villanger |
Finding Induced Subgraphs via Minimal Triangulations. |
STACS |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Pierre Guillon, Gaétan Richard |
Revisiting the Rice Theorem of Cellular Automata. |
STACS |
2010 |
DBLP DOI BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")