Search results for "STACS"

Hits ?▲	Authors	Title	Venue	Year	Link
1	Bart M. P. Jansen	Constrained Bipartite Vertex Cover: The Easy Kernel is Essentially Tight.	STACS	2016	DBLP DOI BibTeX RDF
1	Matthias Mnich, Erik Jan van Leeuwen	Polynomial Kernels for Deletion to Classes of Acyclic Digraphs.	STACS	2016	DBLP DOI BibTeX RDF
1	Anna Adamaszek, Antonios Antoniadis 0001, Tobias Mömke	Airports and Railways: Facility Location Meets Network Design.	STACS	2016	DBLP DOI BibTeX RDF
1	Alexey Milovanov	Algorithmic Statistics, Prediction and Machine Learning.	STACS	2016	DBLP DOI BibTeX RDF
1	Filip Mazowiecki, Cristian Riveros	Copyless Cost-Register Automata: Structure, Expressiveness, and Closure Properties.	STACS	2016	DBLP DOI BibTeX RDF
1	Davide Bilò, Luciano Gualà, Stefano Leucci 0001, Guido Proietti	Multiple-Edge-Fault-Tolerant Approximate Shortest-Path Trees.	STACS	2016	DBLP DOI BibTeX RDF
1	Eva-Maria C. Hols, Stefan Kratsch	A Randomized Polynomial Kernel for Subset Feedback Vertex Set.	STACS	2016	DBLP DOI BibTeX RDF
1	Michael Elberfeld, Pascal Schweitzer	Canonizing Graphs of Bounded Tree Width in Logspace.	STACS	2016	DBLP DOI BibTeX RDF
1	Harald Räcke, Richard Stotz	Improved Approximation Algorithms for Balanced Partitioning Problems.	STACS	2016	DBLP DOI BibTeX RDF
1	Thomas Colcombet, Denis Kuperberg, Amaldev Manuel, Szymon Torunczyk	Cost Functions Definable by Min/Max Automata.	STACS	2016	DBLP DOI BibTeX RDF
1	Nicolas Auger, Cyril Nicaud, Carine Pivoteau	Good Predictions Are Worth a Few Comparisons.	STACS	2016	DBLP DOI BibTeX RDF
1	Frederik Garbe, Richard Mycroft	The Complexity of the Hamilton Cycle Problem in Hypergraphs of High Minimum Codegree.	STACS	2016	DBLP DOI BibTeX RDF
1	Mithilesh Kumar 0001, Daniel Lokshtanov	Faster Exact and Parameterized Algorithm for Feedback Vertex Set in Tournaments.	STACS	2016	DBLP DOI BibTeX RDF
1	Mateus de Oliveira Oliveira	Size-Treewidth Tradeoffs for Circuits Computing the Element Distinctness Function.	STACS	2016	DBLP DOI BibTeX RDF
1	Mikkel Abrahamsen, Greg Bodwin, Eva Rotenberg, Morten Stöckel	Graph Reconstruction with a Betweenness Oracle.	STACS	2016	DBLP DOI BibTeX RDF
1	Pål Grønås Drange, Markus Sortland Dregi, Fedor V. Fomin, Stephan Kreutzer, Daniel Lokshtanov, Marcin Pilipczuk, Michal Pilipczuk, Felix Reidl, Fernando Sánchez Villaamil, Saket Saurabh 0001, Sebastian Siebertz, Somnath Sikdar	Kernelization and Sparseness: the Case of Dominating Set.	STACS	2016	DBLP DOI BibTeX RDF
1	Maurice Chandoo	Deciding Circular-Arc Graph Isomorphism in Parameterized Logspace.	STACS	2016	DBLP DOI BibTeX RDF
1	Pinyan Lu, Kuan Yang, Chihao Zhang 0001	FPTAS for Hardcore and Ising Models on Hypergraphs.	STACS	2016	DBLP DOI BibTeX RDF
1	Jérôme Leroux, Sylvain Schmitz	Ideal Decompositions for Vector Addition Systems (Invited Talk).	STACS	2016	DBLP DOI BibTeX RDF
1	Olaf Beyersdorff, Leroy Chew, Meena Mahajan, Anil Shukla	Are Short Proofs Narrow? QBF Resolution is not Simple.	STACS	2016	DBLP DOI BibTeX RDF
1	Spyros Angelopoulos 0001, Christoph Dürr, Thomas Lidbetter	The Expanding Search Ratio of a Graph.	STACS	2016	DBLP DOI BibTeX RDF
1	Dimitris Fotakis 0001, Michael Lampis, Vangelis Th. Paschos	Sub-exponential Approximation Schemes for CSPs: From Dense to Almost Sparse.	STACS	2016	DBLP DOI BibTeX RDF
1	Stefan Fafianie, Stefan Kratsch, Vuong Anh Quyen	Preprocessing Under Uncertainty.	STACS	2016	DBLP DOI BibTeX RDF
1	Stepan Holub, Jeffrey O. Shallit	Periods and Borders of Random Words.	STACS	2016	DBLP DOI BibTeX RDF
1		Front Matter, Foreword, Conference Organization, External Reviewers, Table of Contents.	STACS	2016	DBLP DOI BibTeX RDF
1	Clément L. Canonne, Ilias Diakonikolas, Themis Gouleakis, Ronitt Rubinfeld	Testing Shape Restrictions of Discrete Distributions.	STACS	2016	DBLP DOI BibTeX RDF
1	John M. Hitchcock, Hadi Shafei	Autoreducibility of NP-Complete Sets.	STACS	2016	DBLP DOI BibTeX RDF
1	Raghav Kulkarni, Supartha Podder	Quantum Query Complexity of Subgraph Isomorphism and Homomorphism.	STACS	2016	DBLP DOI BibTeX RDF
1	Per Austrin, Petteri Kaski, Mikko Koivisto, Jesper Nederlof	Dense Subset Sum May Be the Hardest.	STACS	2016	DBLP DOI BibTeX RDF
1	Nathanaël Fijalkow	Characterisation of an Algebraic Algorithm for Probabilistic Automata.	STACS	2016	DBLP DOI BibTeX RDF
1	Carsten Lutz	Complexity and Expressive Power of Ontology-Mediated Queries (Invited Talk).	STACS	2016	DBLP DOI BibTeX RDF
1	Rahul Arora 0001, Ashu Gupta, Rohit Gurjar, Raghunath Tewari	Derandomizing Isolation Lemma for K3, 3-free and K5-free Bipartite Graphs.	STACS	2016	DBLP DOI BibTeX RDF
1	Lin Chen 0009, Guochuan Zhang	Packing Groups of Items into Multiple Knapsacks.	STACS	2016	DBLP DOI BibTeX RDF
1	Markus Lohrey, Georg Zetzsche	Knapsack in Graph Groups, HNN-Extensions and Amalgamated Products.	STACS	2016	DBLP DOI BibTeX RDF
1	Bernhard Gittenberger, Zbigniew Golebiewski	On the Number of Lambda Terms With Prescribed Size of Their De Bruijn Representation.	STACS	2016	DBLP DOI BibTeX RDF
1	Harry Buhrman, Michal Koucký 0001, Bruno Loff, Florian Speelman	Catalytic Space: Non-determinism and Hierarchy.	STACS	2016	DBLP DOI BibTeX RDF
1	Yuval Filmus, Pavel Hrubes, Massimo Lauria	Semantic Versus Syntactic Cutting Planes.	STACS	2016	DBLP DOI BibTeX RDF
1	Anup Bhattacharya, Ragesh Jaiswal, Amit Kumar 0001	Faster Algorithms for the Constrained k-Means Problem.	STACS	2016	DBLP DOI BibTeX RDF
1	Eugene Asarin, Julien Cervelle, Aldric Degorre, Catalin Dima, Florian Horn 0001, Victor S. Kozyakin	Entropy Games and Matrix Multiplication Games.	STACS	2016	DBLP DOI BibTeX RDF
1	Mikolaj Bojanczyk, Pawel Parys, Szymon Torunczyk	The MSO+U Theory of (N, <) Is Undecidable.	STACS	2016	DBLP DOI BibTeX RDF
1	Akanksha Agrawal 0001, Daniel Lokshtanov, Amer E. Mouawad, Saket Saurabh 0001	Simultaneous Feedback Vertex Set: A Parameterized Perspective.	STACS	2016	DBLP DOI BibTeX RDF
1	Nicolas Ollinger, Heribert Vollmer (eds.)	33rd Symposium on Theoretical Aspects of Computer Science, STACS 2016, February 17-20, 2016, Orléans, France	STACS	2016	DBLP BibTeX RDF
1	Jarkko Kari	Tutorial on Cellular Automata and Tilings (Tutorial).	STACS	2016	DBLP DOI BibTeX RDF
1	Neeraj Kayal, Vineet Nair, Chandan Saha 0001	Separation Between Read-once Oblivious Algebraic Branching Programs (ROABPs) and Multilinear Depth Three Circuits.	STACS	2016	DBLP DOI BibTeX RDF
1	Joan Boyar, Lene M. Favrholdt, Christian Kudahl, Jesper W. Mikkelsen	Advice Complexity for a Class of Online Problems.	STACS	2015	DBLP DOI BibTeX RDF
1	Till Tantau	Existential Second-order Logic over Graphs: A Complete Complexity-theoretic Classification.	STACS	2015	DBLP DOI BibTeX RDF
1	Iyad A. Kanj, Ge Xia	Flip Distance Is in FPT Time O(n+ k * c^k).	STACS	2015	DBLP DOI BibTeX RDF
1	Amr Elmasry, Torben Hagerup, Frank Kammer	Space-efficient Basic Graph Algorithms.	STACS	2015	DBLP DOI BibTeX RDF
1	Anaël Grandjean, Victor Poupet	Comparing 1D and 2D Real Time on Cellular Automata.	STACS	2015	DBLP DOI BibTeX RDF
1	Henning Fernau, Florin Manea, Robert Mercas, Markus L. Schmid	Pattern Matching with Variables: Fast Algorithms and New Hardness Results.	STACS	2015	DBLP DOI BibTeX RDF
1	Johann Brault-Baron, Florent Capelli, Stefan Mengel	Understanding Model Counting for beta-acyclic CNF-formulas.	STACS	2015	DBLP DOI BibTeX RDF
1	Pascal Schweitzer	Towards an Isomorphism Dichotomy for Hereditary Graph Classes.	STACS	2015	DBLP DOI BibTeX RDF
1	Norbert Bus, Shashwat Garg, Nabil H. Mustafa, Saurabh Ray	Improved Local Search for Geometric Hitting Set.	STACS	2015	DBLP DOI BibTeX RDF
1	Philip N. Klein, Claire Mathieu, Hang Zhou 0001	Correlation Clustering and Two-edge-connected Augmentation for Planar Graphs.	STACS	2015	DBLP DOI BibTeX RDF
1	Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Kazuhisa Makino	Markov Decision Processes and Stochastic Games with Total Effective Payoff.	STACS	2015	DBLP DOI BibTeX RDF
1	Thomas Place, Marc Zeitoun	Separation and the Successor Relation.	STACS	2015	DBLP DOI BibTeX RDF
1	Angsheng Li, Pan Peng 0001	Testing Small Set Expansion in General Graphs.	STACS	2015	DBLP DOI BibTeX RDF
1	Esther Galby, Joël Ouaknine, James Worrell 0001	On Matrix Powering in Low Dimensions.	STACS	2015	DBLP DOI BibTeX RDF
1	Sungjin Im, Benjamin Moseley, Kirk Pruhs	Stochastic Scheduling of Heavy-tailed Jobs.	STACS	2015	DBLP DOI BibTeX RDF
1	Ernst W. Mayr, Nicolas Ollinger	Front Matter, Table of Contents, Preface, Conference Organization.	STACS	2015	DBLP DOI BibTeX RDF
1	Arkadev Chattopadhyay, Sagnik Mukhopadhyay	Tribes Is Hard in the Message Passing Model.	STACS	2015	DBLP DOI BibTeX RDF
1	Per Austrin, Petteri Kaski, Mikko Koivisto, Jesper Nederlof	Subset Sum in the Absence of Concentration.	STACS	2015	DBLP DOI BibTeX RDF
1	Tobias Brunsch, Anna Großwendt, Heiko Röglin	Solving Totally Unimodular LPs with the Shadow Vertex Algorithm.	STACS	2015	DBLP DOI BibTeX RDF
1	Jacob Holm, Eva Rotenberg	Dynamic Planar Embeddings of Dynamic Graphs.	STACS	2015	DBLP DOI BibTeX RDF
1	Zengfeng Huang, Bozidar Radunovic, Milan Vojnovic, Qin Zhang 0001	Communication Complexity of Approximate Matching in Distributed Graphs.	STACS	2015	DBLP DOI BibTeX RDF
1	Manuel Bodirsky	The Complexity of Constraint Satisfaction Problems (Invited Talk).	STACS	2015	DBLP DOI BibTeX RDF
1	Turlough Neary	Undecidability in Binary Tag Systems and the Post Correspondence Problem for Five Pairs of Words.	STACS	2015	DBLP DOI BibTeX RDF
1	Jakub Lacki, Piotr Sankowski	Optimal Decremental Connectivity in Planar Graphs.	STACS	2015	DBLP DOI BibTeX RDF
1	Andreas Schmid 0003, Jens M. Schmidt	Computing 2-Walks in Polynomial Time.	STACS	2015	DBLP DOI BibTeX RDF
1	Telikepalli Kavitha	New Pairwise Spanners.	STACS	2015	DBLP DOI BibTeX RDF
1	Andrew V. Goldberg, Haim Kaplan, Sagi Hed, Robert Endre Tarjan	Minimum Cost Flows in Graphs with Unit Capacities.	STACS	2015	DBLP DOI BibTeX RDF
1	Marcin Wrochna	Homomorphism Reconfiguration via Homotopy.	STACS	2015	DBLP DOI BibTeX RDF
1	Andreas Krebs, Klaus-Jörn Lange, Michael Ludwig	Visibly Counter Languages and Constant Depth Circuits.	STACS	2015	DBLP DOI BibTeX RDF
1	Jesper Jansson 0001, Zhaoxian Li, Wing-Kin Sung	On Finding the Adams Consensus Tree.	STACS	2015	DBLP DOI BibTeX RDF
1	Sanjeev Arora	Overcoming Intractability in Unsupervised Learning (Invited Talk).	STACS	2015	DBLP DOI BibTeX RDF
1	Archontia C. Giannopoulou, George B. Mertzios	New Geometric Representations and Domination Problems on Tolerance and Multitolerance Graphs.	STACS	2015	DBLP DOI BibTeX RDF
1	Pavel Klavík, Peter Zeman 0001	Automorphism Groups of Geometrically Represented Graphs.	STACS	2015	DBLP DOI BibTeX RDF
1	Dmitry Kosolobov	Lempel-Ziv Factorization May Be Harder Than Computing All Runs.	STACS	2015	DBLP DOI BibTeX RDF
1	Eric Allender, Dhiraj Holden, Valentine Kabanets	The Minimum Oracle Circuit Size Problem.	STACS	2015	DBLP DOI BibTeX RDF
1	Karl Bringmann, Danny Hermelin, Matthias Mnich, Erik Jan van Leeuwen	Parameterized Complexity Dichotomy for Steiner Multicut.	STACS	2015	DBLP DOI BibTeX RDF
1	Jean Cardinal, Michael Hoffmann 0001, Vincent Kusters, Csaba D. Tóth, Manuel Wettstein	Arc Diagrams, Flip Distances, and Hamiltonian Triangulations.	STACS	2015	DBLP DOI BibTeX RDF
1	Saeed Akhoondian Amiri, Lukasz Kaiser, Stephan Kreutzer, Roman Rabinovich 0001, Sebastian Siebertz	Graph Searching Games and Width Measures for Directed Graphs.	STACS	2015	DBLP DOI BibTeX RDF
1	Ernst W. Mayr, Nicolas Ollinger (eds.)	32nd International Symposium on Theoretical Aspects of Computer Science, STACS 2015, March 4-7, 2015, Garching, Germany	STACS	2015	DBLP BibTeX RDF
1	Olaf Beyersdorff, Leroy Chew, Mikolás Janota	Proof Complexity of Resolution-based QBF Calculi.	STACS	2015	DBLP DOI BibTeX RDF
1	Neeraj Kayal, Chandan Saha 0001	Multi-k-ic Depth Three Circuit Lower Bound.	STACS	2015	DBLP DOI BibTeX RDF
1	Thomas Colcombet, Amaldev Manuel	Combinatorial Expressions and Lower Bounds.	STACS	2015	DBLP DOI BibTeX RDF
1	Stavros G. Kolliopoulos, Yannis Moysoglou	Extended Formulation Lower Bounds via Hypergraph Coloring?.	STACS	2015	DBLP DOI BibTeX RDF
1	Pablo F. Castro, Cecilia Kilmurray, Nir Piterman	Tractable Probabilistic mu-Calculus That Expresses Probabilistic Temporal Logics.	STACS	2015	DBLP DOI BibTeX RDF
1	Sayan Bhattacharya, Wolfgang Dvorák, Monika Henzinger, Martin Starnberger	Welfare Maximization with Friends-of-Friends Network Externalities.	STACS	2015	DBLP DOI BibTeX RDF
1	Felix Brandt 0001	Computational Social Choice (Tutorial).	STACS	2015	DBLP DOI BibTeX RDF
1	Vasco Brattka, Guido Gherardi, Rupert Hölzl 0001	Las Vegas Computability and Algorithmic Randomness.	STACS	2015	DBLP DOI BibTeX RDF
1	Peter Sanders 0001	Parallel Algorithms Reconsidered (Invited Talk).	STACS	2015	DBLP DOI BibTeX RDF
1	Shai Vardi	The Returning Secretary.	STACS	2015	DBLP DOI BibTeX RDF
1	Rupert Hölzl 0001, Sanjay Jain 0001, Frank Stephan 0001	Inductive Inference and Reverse Mathematics.	STACS	2015	DBLP DOI BibTeX RDF
1	Bernd Gärtner, Antonis Thomas	The Complexity of Recognizing Unique Sink Orientations.	STACS	2015	DBLP DOI BibTeX RDF
1	Markus Chimani, Joachim Spoerhase	Network Design Problems with Bounded Distances via Shallow-Light Steiner Trees.	STACS	2015	DBLP DOI BibTeX RDF
1	Martin Avanzini, Ugo Dal Lago	On Sharing, Memoization, and Polynomial Time.	STACS	2015	DBLP DOI BibTeX RDF
1	Dima Grigoriev, Vladimir V. Podolskii	Tropical Effective Primary and Dual Nullstellens"atze.	STACS	2015	DBLP DOI BibTeX RDF
1	Georg Zetzsche	Computing Downward Closures for Stacked Counter Automata.	STACS	2015	DBLP DOI BibTeX RDF
1	Irit Dinur, Prahladh Harsha, Srikanth Srinivasan 0001, Girish Varma	Derandomized Graph Product Results Using the Low Degree Long Code.	STACS	2015	DBLP DOI BibTeX RDF

Publications at "STACS"( http://dblp.L3S.de/Venues/STACS )