Conferences in DBLP
Vasek Chvátal How To Be Fickle. [Citation Graph (0, 0)][DBLP ] Conf ] Anuj Dawar Finite Model Theory on Tame Classes of Structures. [Citation Graph (0, 0)][DBLP ] Conf ] Kurt Mehlhorn Minimum Cycle Bases in Graphs Algorithms and Applications. [Citation Graph (0, 0)][DBLP ] Conf ] C.-H. Luke Ong Hierarchies of Infinite Structures Generated by Pushdown Automata and Recursion Schemes. [Citation Graph (0, 0)][DBLP ] Conf ] Leslie G. Valiant Evolvability. [Citation Graph (0, 0)][DBLP ] Conf ] Sotiris E. Nikoletseas , Christoforos Raptopoulos , Paul G. Spirakis Expander Properties and the Cover Time of Random Intersection Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] William Duckworth , Michele Zito Uncover Low Degree Vertices and Minimise the Mess: Independent Sets in Random Regular Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Christof Löding , Alex Spelten Transition Graphs of Rewriting Systems over Unranked Trees. [Citation Graph (0, 0)][DBLP ] Conf ] Foto N. Afrati Rewriting Conjunctive Queries Determined by Views. [Citation Graph (0, 0)][DBLP ] Conf ] Gábor Salamon Approximation Algorithms for the Maximum Internal Spanning Tree Problem. [Citation Graph (0, 0)][DBLP ] Conf ] Klaus Jansen , Roberto Solis-Oba New Approximability Results for 2-Dimensional Packing Problems. [Citation Graph (0, 0)][DBLP ] Conf ] Yuichi Asahiro , Eiji Miyano , Toshihide Murata , Hirotaka Ono On Approximation of Bookmark Assignments. [Citation Graph (0, 0)][DBLP ] Conf ] Dirk Nowotka , Jirí Srba Height-Deterministic Pushdown Automata. [Citation Graph (0, 0)][DBLP ] Conf ] Patrick Chervet , Igor Walukiewicz Minimizing Variants of Visibly Pushdown Automata. [Citation Graph (0, 0)][DBLP ] Conf ] Christoph Behle , Andreas Krebs , Mark Mercer Linear Circuits, Two-Variable Logic and Weakly Blocked Monoids. [Citation Graph (0, 0)][DBLP ] Conf ] Jaroslav Nesetril , Mark Siggers Combinatorial Proof that Subprojective Constraint Satisfaction Problems are NP-Complete. [Citation Graph (0, 0)][DBLP ] Conf ] Gábor Kun , Jaroslav Nesetril NP by Means of Lifts and Shadows. [Citation Graph (0, 0)][DBLP ] Conf ] Luc Longpré , Pierre McKenzie The Complexity of Solitaire. [Citation Graph (0, 0)][DBLP ] Conf ] Camil Demetrescu , Bruno Escoffier , Gabriel Moruz , Andrea Ribichini Adapting Parallel Algorithms to the W-Stream Model, with Applications to Graph Problems. [Citation Graph (0, 0)][DBLP ] Conf ] Travis Gagie , Giovanni Manzini Space-Conscious Compression. [Citation Graph (0, 0)][DBLP ] Conf ] Rodolfo Carvajal , Martín Matamala , Ivan Rapaport , Nicolas Schabanel Small Alliances in Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Peter Jonsson , Gustav Nordh , Johan Thapper The Maximum Solution Problem on Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Jirí Adámek , Stefan Milius , Jiri Velebil What Are Iteration Theories? [Citation Graph (0, 0)][DBLP ] Conf ] John Case , Samuel E. Moelius Properties Complementary to Program Self-reference. [Citation Graph (0, 0)][DBLP ] Conf ] Kasper Pedersen Dobrushin Conditions for Systematic Scan with Block Dynamics. [Citation Graph (0, 0)][DBLP ] Conf ] Daniel Lokshtanov On the Complexity of Computing Treelength. [Citation Graph (0, 0)][DBLP ] Conf ] Csanád Imreh , Tamás Németh On Time Lookahead Algorithms for the Online Data Acknowledgement Problem. [Citation Graph (0, 0)][DBLP ] Conf ] Martin Delacourt , Victor Poupet Real Time Language Recognition on 2D Cellular Automata: Dealing with Non-convex Neighborhoods. [Citation Graph (0, 0)][DBLP ] Conf ] Julien Cervelle , Pierre Guillon Towards a Rice Theorem on Traces of Cellular Automata. [Citation Graph (0, 0)][DBLP ] Conf ] Damien Regnault , Nicolas Schabanel , Eric Thierry Progresses in the Analysis of Stochastic 2D Cellular Automata: A Study of Asynchronous 2D Minority. [Citation Graph (0, 0)][DBLP ] Conf ] Rupert J. Hartung , Claus-Peter Schnorr Public Key Identification Based on the Equivalence of Quadratic Forms. [Citation Graph (0, 0)][DBLP ] Conf ] Paul Bell , Igor Potapov Reachability Problems in Quaternion Matrix and Rotation Semigroups. [Citation Graph (0, 0)][DBLP ] Conf ] Pascal Koiran , Sylvain Perifel VPSPACE and a Transfer Theorem over the Complex Field. [Citation Graph (0, 0)][DBLP ] Conf ] Alfredo De Santis , Anna Lisa Ferrara , Barbara Masucci Efficient Provably-Secure Hierarchical Key Assignment Schemes. [Citation Graph (0, 0)][DBLP ] Conf ] Amit Chakrabarti , Anna Shubina Nearly Private Information Retrieval. [Citation Graph (0, 0)][DBLP ] Conf ] Fabrizio Frati , Markus Geyer , Michael Kaufmann Packing and Squeezing Subgraphs into Planar Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Gerth Stølting Brodal , Loukas Georgiadis , Kristoffer Arnsfelt Hansen , Irit Katriel Dynamic Matchings in Convex Bipartite Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Evangelos Kranakis , Michel Paquette , Andrzej Pelc Communication in Networks with Random Dependent Faults. [Citation Graph (0, 0)][DBLP ] Conf ] Andrea E. F. Clementi , Angelo Monti , Francesco Pasquale , Riccardo Silvestri Optimal Gossiping in Directed Geometric Radio Networks in Presence of Dynamical Faults. [Citation Graph (0, 0)][DBLP ] Conf ] Gerth Stølting Brodal , Allan Grønlund Jørgensen A Linear Time Algorithm for the k Maximal Sums Problem. [Citation Graph (0, 0)][DBLP ] Conf ] Elias Koutsoupias , Angelina Vidali A Lower Bound of 1+phi for Truthful Scheduling Mechanisms. [Citation Graph (0, 0)][DBLP ] Conf ] Maxime Crochemore , Lucian Ilie Analysis of Maximal Repetitions in Strings. [Citation Graph (0, 0)][DBLP ] Conf ] Nicolas Bedon , Chloe Rispal Series-Parallel Languages on Scattered and Countable Posets. [Citation Graph (0, 0)][DBLP ] Conf ] Antoine Meyer Traces of Term-Automatic Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Yo-Sub Han , Kai Salomaa State Complexity of Basic Operations on Suffix-Free Regular Languages. [Citation Graph (0, 0)][DBLP ] Conf ] Jan Kratochvíl , Dieter Kratsch , Mathieu Liedloff Exact Algorithms for L (2, 1)-Labeling of Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Andreas Brandstädt , Peter Wagner On ( k , l )-Leaf Powers. [Citation Graph (0, 0)][DBLP ] Conf ] Seiichiro Tani An Improved Claw Finding Algorithm Using Quantum Walk. [Citation Graph (0, 0)][DBLP ] Conf ] Rahul Tripathi Complexity Upper Bounds for Classical Locally Random Reductions Using a Quantum Computational Argument. [Citation Graph (0, 0)][DBLP ] Conf ] Joaquim Gabarró , Alina García , Maria J. Serna On the Complexity of Game Isomorphism. [Citation Graph (0, 0)][DBLP ] Conf ] Fabian Wagner Hardness Results for Tournament Isomorphism and Automorphism. [Citation Graph (0, 0)][DBLP ] Conf ] Takayuki Nagoya , Seinosuke Toda Relating Complete and Partial Solution for Problems Similar to Graph Automorphism. [Citation Graph (0, 0)][DBLP ] Conf ] Spyros C. Kontogiannis , Paul G. Spirakis Well Supported Approximate Equilibria in Bimatrix Games: A Graph Theoretic Approach. [Citation Graph (0, 0)][DBLP ] Conf ] Elias Koutsoupias , Panagiota N. Panagopoulou , Paul G. Spirakis Selfish Load Balancing Under Partial Knowledge. [Citation Graph (0, 0)][DBLP ] Conf ] Vittorio Bilò , Michele Flammini Extending the Notion of Rationality of Selfish Agents: Second Order Nash Equilibria. [Citation Graph (0, 0)][DBLP ] Conf ] Marios Mavronicolas , Igal Milchtaich , Burkhard Monien , Karsten Tiemann Congestion Games with Player-Specific Constants. [Citation Graph (0, 0)][DBLP ] Conf ] Maxime Crochemore , Costas S. Iliopoulos , M. Sohel Rahman Finding Patterns in Given Intervals. [Citation Graph (0, 0)][DBLP ] Conf ] Yvonne Bleischwitz , Burkhard Monien , Florian Schoppmann , Karsten Tiemann The Power of Two Prices: Beyond Cross-Monotonicity. [Citation Graph (0, 0)][DBLP ] Conf ] Markus Bläser , Andreas Meyer de Voltaire Semisimple Algebras of Almost Minimal Rank over the Reals. [Citation Graph (0, 0)][DBLP ] Conf ] Esko Ukkonen Structural Analysis of Gapped Motifs of a String. [Citation Graph (0, 0)][DBLP ] Conf ] Torben Hagerup Online and Offline Access to Short Lists. [Citation Graph (0, 0)][DBLP ] Conf ] Riko Jacob Optimal Randomized Comparison Based Algorithms for Collision. [Citation Graph (0, 0)][DBLP ] Conf ] Christos Nomikos , Aris Pagourtzis , Stathis Zachos Randomized and Approximation Algorithms for Blue-Red Matching. [Citation Graph (0, 0)][DBLP ] Conf ] Klaus Meer , Martin Ziegler Real Computational Universality: The Word Problem for a Class of Groups with Infinite Presentation. [Citation Graph (0, 0)][DBLP ] Conf ] Paul S. Bonsma , Luis Cereceda Finding Paths Between Graph Colourings: PSPACE-Completeness and Superpolynomial Distances. [Citation Graph (0, 0)][DBLP ] Conf ] Henrik Björklund , Mikolaj Bojanczyk Shuffle Expressions and Words with Nested Data. [Citation Graph (0, 0)][DBLP ] Conf ] 