Conferences in DBLP
Efficient Compression of Web Graphs. [Citation Graph (, )][DBLP ] Damaged BZip Files Are Difficult to Repair. [Citation Graph (, )][DBLP ] Isoperimetric Problem and Meta-Fibonacci Sequences. [Citation Graph (, )][DBLP ] On the Complexity of Equilibria Problems in Angel-Daemon Games. [Citation Graph (, )][DBLP ] Average-Case Competitive Analyses for One-Way Trading. [Citation Graph (, )][DBLP ] On the Monotonicity of Weak Searching. [Citation Graph (, )][DBLP ] VC Dimension Bounds for Analytic Algebraic Computations. [Citation Graph (, )][DBLP ] Resource Bounded Frequency Computations with Three Errors. [Citation Graph (, )][DBLP ] A Sublinear Time Randomized Algorithm for Coset Enumeration in the Black Box Model. [Citation Graph (, )][DBLP ] Smallest Formulas for Parity of 2k. [Citation Graph (, )][DBLP ] Counting Polycubes without the Dimensionality Curse. [Citation Graph (, )][DBLP ] Polychromatic Colorings of n-Dimensional Guillotine-Partitions. [Citation Graph (, )][DBLP ] The Computational Complexity of Link Building. [Citation Graph (, )][DBLP ] Improved Parameterized Algorithms for Weighted 3-Set Packing. [Citation Graph (, )][DBLP ] Structural Identifiability in Low-Rank Matrix Factorization. [Citation Graph (, )][DBLP ] Complexity of Counting the Optimal Solutions. [Citation Graph (, )][DBLP ] The Orbit Problem Is in the GapL Hierarchy. [Citation Graph (, )][DBLP ] Quantum Separation of Local Search and Fixed Point Computation. [Citation Graph (, )][DBLP ] Multi-party Quantum Communication Complexity with Routed Messages. [Citation Graph (, )][DBLP ] Monotone DNF Formula That Has a Minimal or Maximal Number of Satisfying Assignments. [Citation Graph (, )][DBLP ] Approximating Alternative Solutions. [Citation Graph (, )][DBLP ] Dimensions of Points in Self-similar Fractals. [Citation Graph (, )][DBLP ] Visual Cryptography on Graphs. [Citation Graph (, )][DBLP ] Algebraic Cryptanalysis of CTRU Cryptosystem. [Citation Graph (, )][DBLP ] Detecting Community Structure by Network Vectorization. [Citation Graph (, )][DBLP ] Quasi-bicliques: Complexity and Binding Pairs. [Citation Graph (, )][DBLP ] Complexity of a Collision-Aware String Partition Problem and Its Relation to Oligo Design for Gene Synthesis. [Citation Graph (, )][DBLP ] Genome Halving under DCJ Revisited. [Citation Graph (, )][DBLP ] Haplotype Inferring Via Galled-Tree Networks Is NP-Complete. [Citation Graph (, )][DBLP ] Adjacent Swaps on Strings. [Citation Graph (, )][DBLP ] Efficient Algorithms for SNP Haplotype Block Selection Problems. [Citation Graph (, )][DBLP ] Sequence Alignment Algorithms for Run-Length-Encoded Strings. [Citation Graph (, )][DBLP ] A 2.25-Approximation Algorithm for Cut-and-Paste Sorting of Unsigned Circular Permutations. [Citation Graph (, )][DBLP ] A Practical Exact Algorithm for the Individual Haplotyping Problem MEC/GI. [Citation Graph (, )][DBLP ] Voronoi Diagram of Polygonal Chains under the Discrete Fréchet Distance. [Citation Graph (, )][DBLP ] On Center Regions and Balls Containing Many Points. [Citation Graph (, )][DBLP ] On Unfolding 3D Lattice Polygons and 2D Orthogonal Trees. [Citation Graph (, )][DBLP ] New Algorithms for Online Rectangle Filling with k-Lookahead. [Citation Graph (, )][DBLP ] Geometric Spanner of Objects under L1 Distance. [Citation Graph (, )][DBLP ] Star-Shaped Drawings of Graphs with Fixed Embedding and Concave Corner Constraints. [Citation Graph (, )][DBLP ] A New Characterization of P6-Free Graphs. [Citation Graph (, )][DBLP ] Maximum Connected Domatic Partition of Directed Path Graphs with Single Junction. [Citation Graph (, )][DBLP ] Efficient Algorithms for the kSmallest Cuts Enumeration. [Citation Graph (, )][DBLP ] Covering Directed Graphs by In-Trees. [Citation Graph (, )][DBLP ] On Listing, Sampling, and Counting the Chordal Graphs with Edge Constraints. [Citation Graph (, )][DBLP ] Probe Ptolemaic Graphs. [Citation Graph (, )][DBLP ] Diagnosability of Two-Matching Composition Networks. [Citation Graph (, )][DBLP ] The Iterated Restricted Immediate Snapshot Model. [Citation Graph (, )][DBLP ] Finding Frequent Items in a Turnstile Data Stream. [Citation Graph (, )][DBLP ] A Linear Programming Duality Approach to Analyzing Strictly Nonblocking d-ary Multilog Networks under General Crosstalk Constraints. [Citation Graph (, )][DBLP ] Optimal Tree Structures for Group Key Tree Management Considering Insertion and Deletion Cost. [Citation Graph (, )][DBLP ] Throughput Maximization with Traffic Profile in Wireless Mesh Network. [Citation Graph (, )][DBLP ] Joint Topology Control and Power Conservation for Wireless Sensor Networks Using Transmit Power Adjustment. [Citation Graph (, )][DBLP ] (6+epsilon)-Approximation for Minimum Weight Dominating Set in Unit Disk Graphs. [Citation Graph (, )][DBLP ] Spectrum Bidding in Wireless Networks and Related. [Citation Graph (, )][DBLP ] (1+rho)-Approximation for Selected-Internal Steiner Minimum Tree. [Citation Graph (, )][DBLP ] Computing Maximum Flows in Undirected Planar Networks with Both Edge and Vertex Capacities. [Citation Graph (, )][DBLP ] Spreading Messages. [Citation Graph (, )][DBLP ] On Some City Guarding Problems. [Citation Graph (, )][DBLP ] Optimal Insertion of a Segment Highway in a City Metric. [Citation Graph (, )][DBLP ] Approximating the Generalized Capacitated Tree-Routing Problem. [Citation Graph (, )][DBLP ] Column Generation Algorithms for the Capacitated m-Ring-Star Problem. [Citation Graph (, )][DBLP ] Two-Agent Scheduling with Linear Deteriorating Jobs on a Single Machine. [Citation Graph (, )][DBLP ] A Two-Stage Flexible Flowshop Problem with Deterioration. [Citation Graph (, )][DBLP ] A Lower Bound for the On-Line Preemptive Machine Scheduling with lp. [Citation Graph (, )][DBLP ] The Coordination of Two Parallel Machines Scheduling and Batch Deliveries. [Citation Graph (, )][DBLP ] 