|
|
Conferences in DBLP
Continuous and Discrete Methods in Computer Science. [Citation Graph (, )][DBLP]
Colorful Strips. [Citation Graph (, )][DBLP]
The Mono- and Bichromatic Empty Rectangle and Square Problems in All Dimensions. [Citation Graph (, )][DBLP]
Connectivity Is Not a Limit for Kernelization: Planar Connected Dominating Set. [Citation Graph (, )][DBLP]
Randomized Truthful Algorithms for Scheduling Selfish Tasks on Parallel Machines. [Citation Graph (, )][DBLP]
Almost Linear Time Computation of the Chromatic Polynomial of a Graph of Bounded Tree-Width. [Citation Graph (, )][DBLP]
Average Parameterization and Partial Kernelization for Computing Medians. [Citation Graph (, )][DBLP]
Sharp Separation and Applications to Exact and Parameterized Algorithms. [Citation Graph (, )][DBLP]
Finding the Minimum-Distance Schedule for a Boundary Searcher with a Flashlight. [Citation Graph (, )][DBLP]
The Language Theory of Bounded Context-Switching. [Citation Graph (, )][DBLP]
Local Search Performance Guarantees for Restricted Related Parallel Machine Scheduling. [Citation Graph (, )][DBLP]
Packet Routing on the Grid. [Citation Graph (, )][DBLP]
Faithful Representations of Graphs by Islands in the Extended Grid. [Citation Graph (, )][DBLP]
The I/O Complexity of Sparse Matrix Dense Matrix Multiplication. [Citation Graph (, )][DBLP]
Sparse Recovery Using Sparse Random Matrices. [Citation Graph (, )][DBLP]
Optimal Succinctness for Range Minimum Queries. [Citation Graph (, )][DBLP]
Compact Rich-Functional Binary Relation Representations. [Citation Graph (, )][DBLP]
Radix Cross-Sections for Length Morphisms. [Citation Graph (, )][DBLP]
Pairs of Complementary Unary Languages with "Balanced" Nondeterministic Automata. [Citation Graph (, )][DBLP]
Quotient Complexity of Ideal Languages. [Citation Graph (, )][DBLP]
Complexity of Operations on Cofinite Languages. [Citation Graph (, )][DBLP]
Fast Set Intersection and Two-Patterns Matching. [Citation Graph (, )][DBLP]
Counting Reducible, Powerful, and Relatively Irreducible Multivariate Polynomials over Finite Fields. [Citation Graph (, )][DBLP]
A Larger Lower Bound on the OBDD Complexity of the Most Significant Bit of Multiplication. [Citation Graph (, )][DBLP]
Modelling the LLL Algorithm by Sandpiles. [Citation Graph (, )][DBLP]
Communication-Efficient Construction of the Plane Localized Delaunay Graph. [Citation Graph (, )][DBLP]
Time Complexity of Distributed Topological Self-stabilization: The Case of Graph Linearization. [Citation Graph (, )][DBLP]
Randomised Broadcasting: Memory vs. Randomness. [Citation Graph (, )][DBLP]
Limit Theorems for Random MAX-2-XORSAT. [Citation Graph (, )][DBLP]
On Quadratic Threshold CSPs. [Citation Graph (, )][DBLP]
Finding Lower Bounds on the Complexity of Secret Sharing Schemes by Linear Programming. [Citation Graph (, )][DBLP]
Finding the Best CAFE Is NP-Hard. [Citation Graph (, )][DBLP]
The Size and Depth of Layered Boolean Circuits. [Citation Graph (, )][DBLP]
Lipschitz Unimodal and Isotonic Regression on Paths and Trees. [Citation Graph (, )][DBLP]
Ambiguity and Deficiency in Costas Arrays and APN Permutations. [Citation Graph (, )][DBLP]
Iterated Shared Memory Models. [Citation Graph (, )][DBLP]
Optimal Polygonal Representation of Planar Graphs. [Citation Graph (, )][DBLP]
Minimum-Perimeter Intersecting Polygons. [Citation Graph (, )][DBLP]
Finding the Smallest Gap between Sums of Square Roots. [Citation Graph (, )][DBLP]
Matching Points with Things. [Citation Graph (, )][DBLP]
Homotopic Rectilinear Routing with Few Links and Thick Edges. [Citation Graph (, )][DBLP]
Tilings Robust to Errors. [Citation Graph (, )][DBLP]
Visiting a Sequence of Points with a Bevel-Tip Needle. [Citation Graph (, )][DBLP]
Euclidean Prize-Collecting Steiner Forest. [Citation Graph (, )][DBLP]
Prize-Collecting Steiner Networks via Iterative Rounding. [Citation Graph (, )][DBLP]
Kernelization through Tidying. [Citation Graph (, )][DBLP]
Gradual Sub-lattice Reduction and a New Complexity for Factoring Polynomials. [Citation Graph (, )][DBLP]
The Power of Fair Pricing Mechanisms. [Citation Graph (, )][DBLP]
Quasi-Proportional Mechanisms: Prior-Free Revenue Maximization. [Citation Graph (, )][DBLP]
Some Observations on Holographic Algorithms. [Citation Graph (, )][DBLP]
The Interval Constrained 3-Coloring Problem. [Citation Graph (, )][DBLP]
Counting Hexagonal Patches and Independent Sets in Circle Graphs. [Citation Graph (, )][DBLP]
Approximating Maximum Diameter-Bounded Subgraphs. [Citation Graph (, )][DBLP]
Largest Induced Acyclic Tournament in Random Digraphs: A 2-Point Concentration. [Citation Graph (, )][DBLP]
The Complexity of Counting Eulerian Tours in 4-Regular Graphs. [Citation Graph (, )][DBLP]
Efficient Edge Domination on Hole-Free Graphs in Polynomial Time. [Citation Graph (, )][DBLP]
Computational Complexity of the Hamiltonian Cycle Problem in Dense Hypergraphs. [Citation Graph (, )][DBLP]
Rank Selection in Multidimensional Data. [Citation Graph (, )][DBLP]
Layered Working-Set Trees. [Citation Graph (, )][DBLP]
Lightweight Data Indexing and Compression in External Memory. [Citation Graph (, )][DBLP]
|
