
Conferences in DBLP
Understanding and Inductive Inference. [Citation Graph (, )][DBLP]
Computing with Cells: Membrane Systems. [Citation Graph (, )][DBLP]
Boxicity and Poset Dimension. [Citation Graph (, )][DBLP]
On the Hardness against ConstantDepth LinearSize Circuits. [Citation Graph (, )][DBLP]
A KProvers Parallel Repetition Theorem for a Version of NoSignaling Model. [Citation Graph (, )][DBLP]
The Curse of Connectivity: tTotal Vertex (Edge) Cover. [Citation Graph (, )][DBLP]
Counting Paths in VPA Is Complete for #NC^{1}. [Citation Graph (, )][DBLP]
DepthIndependent Lower Bounds on the Communication Complexity of ReadOnce Boolean Formulas. [Citation Graph (, )][DBLP]
Multiplying Pessimistic Estimators: Deterministic Approximation of Max TSP and Maximum Triangle Packing. [Citation Graph (, )][DBLP]
Clustering with or without the Approximation. [Citation Graph (, )][DBLP]
A Selfstabilizing 3Approximation for the Maximum Leaf Spanning Tree Problem in Arbitrary Networks. [Citation Graph (, )][DBLP]
Approximate Weighted Farthest Neighbors and Minimum Dilation Stars. [Citation Graph (, )][DBLP]
Approximated Distributed Minimum Vertex Cover Algorithms for Bounded Degree Graphs. [Citation Graph (, )][DBLP]
Maximum Upward Planar Subgraph of a SingleSource Embedded Digraph. [Citation Graph (, )][DBLP]
TriangleFree 2Matchings Revisited. [Citation Graph (, )][DBLP]
The Cover Time of Deterministic Random Walks. [Citation Graph (, )][DBLP]
Finding Maximum Edge Bicliques in Convex Bipartite Graphs. [Citation Graph (, )][DBLP]
A Note on Vertex Cover in Graphs with Maximum Degree 3. [Citation Graph (, )][DBLP]
Computing Graph Spanners in Small Memory: FaultTolerance and Streaming. [Citation Graph (, )][DBLP]
Factorization of Cartesian Products of Hypergraphs. [Citation Graph (, )][DBLP]
MinimumSegment Convex Drawings of 3Connected Cubic Plane Graphs. [Citation Graph (, )][DBLP]
On Three Parameters of Invisibility Graphs. [Citation Graph (, )][DBLP]
Imbalance Is Fixed Parameter Tractable. [Citation Graph (, )][DBLP]
The Ramsey Number for a Linear Forest versus Two Identical Copies of Complete Graphs. [Citation Graph (, )][DBLP]
Optimal Binary Space Partitions in the Plane. [Citation Graph (, )][DBLP]
Exact and Approximation Algorithms for Geometric and Capacitated Set Cover Problems. [Citation Graph (, )][DBLP]
Effect of Corner Information in Simultaneous Placement of K Rectangles and Tableaux. [Citation Graph (, )][DBLP]
Detecting Areas Visited Regularly. [Citation Graph (, )][DBLP]
TilePacking Tomography Is \mathbbNP{\mathbb{NP}}hard. [Citation Graph (, )][DBLP]
The Rectilinear kBends TSP. [Citation Graph (, )][DBLP]
Tracking a Generator by Persistence. [Citation Graph (, )][DBLP]
Auspicious Tatami Mat Arrangements. [Citation Graph (, )][DBLP]
Faster Generation of Shorthand Universal Cycles for Permutations. [Citation Graph (, )][DBLP]
The Complexity of Word Circuits. [Citation Graph (, )][DBLP]
On the Density of Regular and ContextFree Languages. [Citation Graph (, )][DBLP]
Extensions of the Minimum Cost Homomorphism Problem. [Citation Graph (, )][DBLP]
The Longest AlmostIncreasing Subsequence. [Citation Graph (, )][DBLP]
Universal Test Sets for Reversible Circuits. [Citation Graph (, )][DBLP]
Approximate Counting with a FloatingPoint Counter. [Citation Graph (, )][DBLP]
Broadcasting in Heterogeneous Tree Networks. [Citation Graph (, )][DBLP]
Contention Resolution in MultipleAccess Channels: kSelection in Radio Networks. [Citation Graph (, )][DBLP]
Online Preemptive Scheduling with Immediate Decision or Notification and Penalties. [Citation Graph (, )][DBLP]
Discovering Pairwise Compatibility Graphs. [Citation Graph (, )][DBLP]
Near Optimal Solutions for Maximum Quasibicliques. [Citation Graph (, )][DBLP]
Fast Coupled Path Planning: From PseudoPolynomial to Polynomial. [Citation Graph (, )][DBLP]
Constant Time Approximation Scheme for Largest Well Predicted Subset. [Citation Graph (, )][DBLP]
On Sorting Permutations by DoubleCutandJoins. [Citation Graph (, )][DBLP]
A ThreeString Approach to the Closest String Problem. [Citation Graph (, )][DBLP]
A 2k Kernel for the Cluster Editing Problem. [Citation Graph (, )][DBLP]
On the Computation of 3D Visibility Skeletons. [Citation Graph (, )][DBLP]
The Violation Heap: A Relaxed FibonacciLike Heap. [Citation Graph (, )][DBLP]
Threshold Rules for Online Sample Selection. [Citation Graph (, )][DBLP]
Heterogeneous Subset Sampling. [Citation Graph (, )][DBLP]
IdentityBased Authenticated Asymmetric Group Key Agreement Protocol. [Citation Graph (, )][DBLP]
ZeroKnowledge Argument for Simultaneous Discrete Logarithms. [Citation Graph (, )][DBLP]
Directed Figure Codes: Decidability Frontier. [Citation Graph (, )][DBLP]
