The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

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

URL (DBLP): http://dblp.uni-trier.de/db/conf/stacs

Publication years (Num. hits)
1984 (31) 1985 (37) 1986 (31) 1987 (48) 1988 (44) 1989 (52) 1990 (27) 1991 (52) 1992 (57) 1993 (72) 1994 (64) 1995 (57) 1996 (55) 1997 (50) 1998 (55) 1999 (55) 2000 (55) 2001 (50) 2002 (54) 2003 (61) 2004 (58) 2005 (58) 2006 (58) 2007 (60) 2008 (60) 2009 (59) 2010 (60) 2011 (59) 2012 (60) 2013 (61) 2014 (59) 2015 (62) 2016 (60) 2017 (60) 2018 (60) 2019 (61)
Publication types (Num. hits)
inproceedings(1927) proceedings(35)
Venues (Conferences, Journals, ...)
STACS(1962)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 336 occurrences of 235 keywords

Results
Found 1962 publication records. Showing 1962 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
1Felix Hommelsheim, Moritz Mühlenthaler, Oliver Schaudt How to Secure Matchings Against Edge Failures. Search on Bibsonomy STACS The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Niklas Hjuler, Giuseppe F. Italiano, Nikos Parotsidis, David Saulpic Dominating Sets and Connected Dominating Sets in Dynamic Graphs. Search on Bibsonomy STACS The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Emmanuel Jeandel, Pascal Vanier A Characterization of Subshifts with Computable Language. Search on Bibsonomy STACS The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Tom Bannink, Jop Briët, Harry Buhrman, Farrokh Labib, Troy Lee Bounding Quantum-Classical Separations for Classes of Nonlocal Games. Search on Bibsonomy STACS The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Florent Capelli, Stefan Mengel Tractable QBF by Knowledge Compilation. Search on Bibsonomy STACS The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Ágnes Cseh, Attila Juhos Pairwise Preferences in the Stable Marriage Problem. Search on Bibsonomy STACS The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Shaull Almagor, Joël Ouaknine, James Worrell 0001 The Semialgebraic Orbit Problem. Search on Bibsonomy STACS The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Patrick Landwehr, Christof Löding Tree Automata with Global Constraints for Infinite Trees. Search on Bibsonomy STACS The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Stephan Kreutzer, Irene Muzi, Patrice Ossona de Mendez, Roman Rabinovich, Sebastian Siebertz Algorithmic Properties of Sparse Digraphs. Search on Bibsonomy STACS The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Fedor V. Fomin, Petr A. Golovach, Dimitrios M. Thilikos Modification to Planarity is Fixed Parameter Tractable. Search on Bibsonomy STACS The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Enoch Peserico Paging with Dynamic Memory Capacity. Search on Bibsonomy STACS The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Derek F. Holt, Markus Lohrey, Saul Schleimer Compressed Decision Problems in Hyperbolic Groups. Search on Bibsonomy STACS The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Stasys Jukna, Andrzej Lingas Lower Bounds for DeMorgan Circuits of Bounded Negation Width. Search on Bibsonomy STACS The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Leslie Ann Goldberg Computational Complexity and Partition Functions (Invited Talk). Search on Bibsonomy STACS The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Rolf Niedermeier, Christophe Paul (eds.) 36th International Symposium on Theoretical Aspects of Computer Science, STACS 2019, March 13-16, 2019, Berlin, Germany Search on Bibsonomy STACS The full citation details ... 2019 DBLP  BibTeX  RDF
1Stefan Kiefer, Corto Mascle On Finite Monoids over Nonnegative Integer Matrices and Short Killing Words. Search on Bibsonomy STACS The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Martin Dietzfelbinger, Stefan Walzer Constant-Time Retrieval with O(log m) Extra Bits. Search on Bibsonomy STACS The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Moses Ganardi Visibly Pushdown Languages over Sliding Windows. Search on Bibsonomy STACS The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Gleb Posobin, Alexander Shen Random Noise Increases Kolmogorov Complexity and Hausdorff Dimension. Search on Bibsonomy STACS The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Shahbaz Khan 0004, Shashank K. Mehta Depth First Search in the Semi-streaming Model. Search on Bibsonomy STACS The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1María Emilia Descotte, Diego Figueira, Santiago Figueira Closure Properties of Synchronized Relations. Search on Bibsonomy STACS The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Bart M. P. Jansen, Marcin Pilipczuk, Erik Jan van Leeuwen A Deterministic Polynomial Kernel for Odd Cycle Transversal and Vertex Multiway Cut in Planar Graphs. Search on Bibsonomy STACS The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1David Auger, Pierre Coucheney, Yann Strozecki Solving Simple Stochastic Games with Few Random Nodes Faster Using Bland's Rule. Search on Bibsonomy STACS The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Pawel Gawrychowski, Florin Manea, Radoslaw Serafin Fast and Longest Rollercoasters. Search on Bibsonomy STACS The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1François Le Gall, Harumichi Nishimura, Ansis Rosmanis Quantum Advantage for the LOCAL Model in Distributed Computing. Search on Bibsonomy STACS The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Gregor Matl, Stanislav Zivny Beyond Boolean Surjective VCSPs. Search on Bibsonomy STACS The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Petra Mutzel Algorithmic Data Science (Invited Talk). Search on Bibsonomy STACS The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1 Front Matter, Table of Contents, Preface, Conference Organization. Search on Bibsonomy STACS The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Alexander Grigoriev, Tim A. Hartmann, Stefan Lendl, Gerhard J. Woeginger Dispersing Obnoxious Facilities on a Graph. Search on Bibsonomy STACS The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Tobias Friedrich 0001 From Graph Theory to Network Science: The Natural Emergence of Hyperbolicity (Tutorial). Search on Bibsonomy STACS The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Étienne Bamas, Louis Esperet Distributed Coloring of Graphs with an Optimal Number of Colors. Search on Bibsonomy STACS The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Boris Aronov, Omrit Filtser, Matthew J. Katz, Khadijeh Sheikhan Bipartite Diameter and Other Measures Under Translation. Search on Bibsonomy STACS The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Archontia C. Giannopoulou, O-joung Kwon, Jean-Florent Raymond, Dimitrios M. Thilikos Lean Tree-Cut Decompositions: Obstructions and Algorithms. Search on Bibsonomy STACS The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Kasper Green Larsen Constructive Discrepancy Minimization with Hereditary L2 Guarantees. Search on Bibsonomy STACS The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Alexander Birx, Yann Disser Tight Analysis of the Smartstart Algorithm for Online Dial-a-Ride on the Line. Search on Bibsonomy STACS The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Robert Krauthgamer, Ohad Trabelsi The Set Cover Conjecture and Subgraph Isomorphism with a Tree Pattern. Search on Bibsonomy STACS The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Matthew Cook 0001, Turlough Neary Average-Case Completeness in Tag Systems. Search on Bibsonomy STACS The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Sandeep Sen A Unified Approach to Tail Estimates for Randomized Incremental Construction. Search on Bibsonomy STACS The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Eva-Maria C. Hols, Stefan Kratsch On Kernelization for Edge Dominating Set under Structural Parameters. Search on Bibsonomy STACS The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Anca Muscholl, Gabriele Puppis The Many Facets of String Transducers (Invited Talk). Search on Bibsonomy STACS The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Erik Paul Finite Sequentiality of Unambiguous Max-Plus Tree Automata. Search on Bibsonomy STACS The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Max Bannach, Till Tantau On the Descriptive Complexity of Color Coding. Search on Bibsonomy STACS The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Faith Ellen, Rati Gelashvili, Philipp Woelfel, Leqi Zhu Space Lower Bounds for the Signal Detection Problem. Search on Bibsonomy STACS The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Dusan Knop, Michal Pilipczuk, Marcin Wrochna Tight Complexity Lower Bounds for Integer Linear Programming with Few Constraints. Search on Bibsonomy STACS The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Chetan Gupta 0002, Vimal Raj Sharma, Raghunath Tewari Reachability in O(log n) Genus Graphs is in Unambiguous Logspace. Search on Bibsonomy STACS The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Spyros Angelopoulos 0001, Christoph Dürr, Shendan Jin Best-Of-Two-Worlds Analysis of Online Search. Search on Bibsonomy STACS The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Julien Destombes, Andrei E. Romashchenko Resource-Bounded Kolmogorov Complexity Provides an Obstacle to Soficness of Multidimensional Shifts. Search on Bibsonomy STACS The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Rémy Belmonte, Eun Jung Kim 0002, Michael Lampis, Valia Mitsou, Yota Otachi, Florian Sikora Token Sliding on Split Graphs. Search on Bibsonomy STACS The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Pál András Papp, Roger Wattenhofer Stabilization Time in Weighted Minority Processes. Search on Bibsonomy STACS The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Eduard Eiben, Dusan Knop, Fahad Panolan, Ondrej Suchý Complexity of the Steiner Network Problem with Respect to the Number of Terminals. Search on Bibsonomy STACS The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Olaf Beyersdorff, Joshua Blinkhorn, Meena Mahajan Building Strategies into QBF Proofs. Search on Bibsonomy STACS The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Marthe Bonamy, Oscar Defrain, Marc Heinrich, Jean-Florent Raymond Enumerating Minimal Dominating Sets in Triangle-Free Graphs. Search on Bibsonomy STACS The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Silvia Butti, Stanislav Zivny Sparsification of Binary CSPs. Search on Bibsonomy STACS The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Kurtulus Gemici, Elias Koutsoupias, Barnabé Monnot, Christos H. Papadimitriou, Georgios Piliouras Wealth Inequality and the Price of Anarchy. Search on Bibsonomy STACS The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Kelin Luo, Thomas Erlebach, Yinfeng Xu Car-Sharing on a Star Network: On-Line Scheduling with k Servers. Search on Bibsonomy STACS The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Bruno Loff, Sagnik Mukhopadhyay Lifting Theorems for Equality. Search on Bibsonomy STACS The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Antoine Mottet, Karin Quaas The Containment Problem for Unambiguous Register Automata. Search on Bibsonomy STACS The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Thomas Watson 0001 A ZPPNP[1] Lifting Theorem. Search on Bibsonomy STACS The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Parinya Chalermsook, Andreas Schmid 0003, Sumedha Uniyal A Tight Extremal Bound on the Lovász Cactus Number in Planar Graphs. Search on Bibsonomy STACS The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Grzegorz Fabianski, Michal Pilipczuk, Sebastian Siebertz, Szymon Torunczyk Progressive Algorithms for Domination and Independence. Search on Bibsonomy STACS The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Karl Bringmann Fine-Grained Complexity Theory (Tutorial). Search on Bibsonomy STACS The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Barbara Geissmann, Stefano Leucci 0001, Chih-Hung Liu, Paolo Penna Optimal Dislocation with Persistent Errors in Subquadratic Time. Search on Bibsonomy STACS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Isolde Adler, Frederik Harwath Property Testing for Bounded Degree Databases. Search on Bibsonomy STACS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Erik D. Demaine, Sarah Eisenstat, Mikhail Rudoy Solving the Rubik's Cube Optimally is NP-complete. Search on Bibsonomy STACS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Clément Carbonnel, David A. Cohen, Martin C. Cooper, Stanislav Zivny On Singleton Arc Consistency for CSPs Defined by Monotone Patterns. Search on Bibsonomy STACS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Damien Pous On the Positive Calculus of Relations with Transitive Closure. Search on Bibsonomy STACS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Yasuhiro Takahashi, Seiichiro Tani Power of Uninitialized Qubits in Shallow Quantum Circuits. Search on Bibsonomy STACS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1André Nies, Frank Stephan 0001 Closure of Resource-Bounded Randomness Notions Under Polynomial-Time Permutations. Search on Bibsonomy STACS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Masashi Kiyomi, Hirotaka Ono, Yota Otachi, Pascal Schweitzer, Jun Tarui Space-Efficient Algorithms for Longest Increasing Subsequence. Search on Bibsonomy STACS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Denis Kuperberg, Anirban Majumdar 0002 Width of Non-deterministic Automata. Search on Bibsonomy STACS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Olaf Beyersdorff, Joshua Blinkhorn Genuine Lower Bounds for QBF Expansion. Search on Bibsonomy STACS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Max Bannach, Till Tantau Computing Hitting Set Kernels By AC^0-Circuits. Search on Bibsonomy STACS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Rémy Belmonte, Michael Lampis, Valia Mitsou Parameterized (Approximate) Defective Coloring. Search on Bibsonomy STACS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1George Giakkoupis, Philipp Woelfel An Improved Bound for Random Binary Search Trees with Concurrent Insertions. Search on Bibsonomy STACS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Garance Gourdel, Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Arseny M. Shur, Tomasz Walen String Periods in the Order-Preserving Model. Search on Bibsonomy STACS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Pawel Parys Recursion Schemes and the WMSO+U Logic. Search on Bibsonomy STACS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Laurent Bienvenu, Rodney G. Downey On Low for Speed Oracles. Search on Bibsonomy STACS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Marek Szykula Improving the Upper Bound on the Length of the Shortest Reset Word. Search on Bibsonomy STACS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Hiroshi Hirai 0001, Yuni Iwamasa, Kazuo Murota, Stanislav Zivny Beyond JWP: A Tractable Class of Binary VCSPs via M-Convex Intersection. Search on Bibsonomy STACS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Yoichi Iwata, Tomoaki Ogasawara, Naoto Ohsaka On the Power of Tree-Depth for Fully Polynomial FPT Algorithms. Search on Bibsonomy STACS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Davide Bilò, Pascal Lenzner On the Tree Conjecture for the Network Creation Game. Search on Bibsonomy STACS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Meena Mahajan Lower Bound Techniques for QBF Proof Systems. Search on Bibsonomy STACS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Bernadette Charron-Bost, Shlomo Moran The Firing Squad Problem Revisited. Search on Bibsonomy STACS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Benedikt Bollig, Marie Fortin, Paul Gastin Communicating Finite-State Machines and Two-Variable Logic. Search on Bibsonomy STACS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Eduard Eiben, Mithilesh Kumar 0001, Amer E. Mouawad, Fahad Panolan, Sebastian Siebertz Lossy Kernels for Connected Dominating Set on Sparse Graphs. Search on Bibsonomy STACS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Pavel Dvorák, Andreas Emil Feldmann, Dusan Knop, Tomás Masarík, Tomas Toufar, Pavel Veselý Parameterized Approximation Schemes for Steiner Trees with Small Number of Steiner Vertices. Search on Bibsonomy STACS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Moses Ganardi, Daniel König, Markus Lohrey, Georg Zetzsche Knapsack Problems for Wreath Products. Search on Bibsonomy STACS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Akanksha Agrawal, Daniel Lokshtanov, Pranabendu Misra, Saket Saurabh 0001, Meirav Zehavi Erdös-Pósa Property of Obstructions to Interval Graphs. Search on Bibsonomy STACS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Anna Adamaszek, Antonios Antoniadis, Amit Kumar 0001, Tobias Mömke Approximating Airports and Railways. Search on Bibsonomy STACS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Lars Jaffke, O-joung Kwon, Jan Arne Telle A Unified Polynomial-Time Algorithm for Feedback Vertex Set on Graphs of Bounded Mim-Width. Search on Bibsonomy STACS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Michael Blondin, Javier Esparza, Stefan Jaax Large Flocks of Small Birds: on the Minimal Size of Population Protocols. Search on Bibsonomy STACS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Taku Onodera, Tetsuo Shibuya Succinct Oblivious RAM. Search on Bibsonomy STACS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Davide Bilò, Keerti Choudhary, Luciano Gualà, Stefano Leucci 0001, Merav Parter, Guido Proietti Efficient Oracles and Routing Schemes for Replacement Paths. Search on Bibsonomy STACS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Moses Ganardi, Danny Hucke, Daniel König, Markus Lohrey, Konstantinos Mamouras Automata Theory on Sliding Windows. Search on Bibsonomy STACS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1 Front Matter, Table of Contents, Preface, Conference Organization. Search on Bibsonomy STACS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Hans Ulrich Simon On the Containment Problem for Linear Sets. Search on Bibsonomy STACS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Lukas Fleischer, Manfred Kufleitner The Intersection Problem for Finite Monoids. Search on Bibsonomy STACS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Chris Köcher Rational, Recognizable, and Aperiodic Sets in the Partially Lossy Queue Monoid. Search on Bibsonomy STACS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Suryajith Chillara, Nutan Limaye, Srikanth Srinivasan 0001 Small-depth Multilinear Formula Lower Bounds for Iterated Matrix Multiplication, with Applications. Search on Bibsonomy STACS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Rolf Niedermeier, Brigitte Vallée (eds.) 35th Symposium on Theoretical Aspects of Computer Science, STACS 2018, February 28 to March 3, 2018, Caen, France Search on Bibsonomy STACS The full citation details ... 2018 DBLP  BibTeX  RDF
Displaying result #1 - #100 of 1962 (100 per page; Change: )
Pages: [1][2][3][4][5][6][7][8][9][10][>>]
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.
open data data released under the ODC-BY 1.0 license