Publication:4231923

zbMATH Open0938.68932MaRDI QIDQ4231923FDOQ4231923

Leonard J. Schulman, Aravind Srinivasan, Moni Naor

Publication date: 26 April 2000

Title of this publication is not available (Why is that?)

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05)

Cited In (only showing first 100 items - show all)

• On the parameterized complexity of \textsc{Sparsest Cut} and \textsc{Small-Set Expansion} problems
• Parameterized complexity of conflict-free matchings and paths
• Polynomial bounds for centered colorings on proper minor-closed graph classes
• The query complexity of finding local minima in the lattice
• Exact and Fixed Parameter Tractable Algorithms for Max-Conflict-Free Coloring in Hypergraphs
• Randomized Disposal of Unknowns and Implicitly Enforced Bounds on Parameters
• Approximate Counting of k-Paths: Deterministic and in Polynomial Space
• On the parameterized complexity of separating certain sources from the target
• Two edge-disjoint paths with length constraints
• Grundy Coloring and friends, half-graphs, bicliques
• Learning Bayesian Networks Under Sparsity Constraints: A Parameterized Complexity Analysis
• Packing paths: recycling saves time
• The Parameterized Complexity of Motion Planning for Snake-Like Robots
• Balanced Judicious Bipartition is Fixed-Parameter Tractable
• Clustering with Local Restrictions
• Linear Kernels for Edge Deletion Problems to Immersion-Closed Graph Classes
• Parameterized complexity of categorical clustering with size constraints
• Parameterized Complexity of Directed Spanner Problems.
• Title not available (Why is that?)
• Parameterized algorithms for Max Colorable Induced Subgraph problem on perfect graphs
• Going Far from Degeneracy
• On one-sided testing affine subspaces
• The parameterized complexity of finding secluded solutions to some classical optimization problems on graphs
• Parameterized counting matching and packing: a family of hard problems that admit FPTRAS
• Maximizing reachability in a temporal graph obtained by assigning starting times to a collection of walks
• Preprocessing to reduce the search space: antler structures for feedback vertex set
• On the parameterized complexity of the acyclic matching problem
• Shortest odd paths in undirected graphs with conservative weight functions
• Deterministic constructions of high-dimensional sets with small dispersion
• Diverse Pairs of Matchings
• Parameterized complexity of directed spanner problems
• Parameterized complexity of secluded connectivity problems
• On the Parameterized Complexity of Contraction to Generalization of Trees.
• Parameterized complexity of geometric covering problems having conflicts
• The parameterized complexity of cycle packing: indifference is not an issue
• (Re)packing equal disks into rectangle
• On the Complexity of Computing the k-restricted Edge-connectivity of a Graph
• Balanced substructures in bicolored graphs
• Title not available (Why is that?)
• Multicut Is FPT
• Proportionally Fair Matching with Multiple Groups
• Parameterized and exact algorithms for finding a read-once resolution refutation in 2CNF formulas
• The complexity of routing problems in forbidden-transition graphs and edge-colored graphs
• Minimum Bisection Is Fixed-Parameter Tractable
• Parameterized complexity of maximum edge colorable subgraph
• Bounds for \(c\)-ideal hashing
• Max-SAT with cardinality constraint parameterized by the number of clauses
• Identification of partial disjunction, parity, and threshold functions
• Partial vertex cover on graphs of bounded degeneracy
• An \(O^{*}(3.53^{3k})\)-time parameterized algorithm for the 3-set packing problem
• Packing arc-disjoint cycles in oriented graphs
• Title not available (Why is that?)
• A faster FPT algorithm for bipartite contraction
• On testing monomials in multivariate polynomials
• The \(k\)-distinct language: parameterized automata constructions
• Slightly Superexponential Parameterized Problems
• Randomised enumeration of small witnesses using a decision oracle
• Attribute-efficient learning in query and mistake-bound models
• Title not available (Why is that?)
• Sharp separation and applications to exact and parameterized algorithms
• Parameterized complexity of even/odd subgraph problems
• On two continuum armed bandit problems in high dimensions
• A randomized algorithm for long directed cycle
• Parameterizing role coloring on forests
• Fast exact algorithms using Hadamard product of polynomials
• Parameterized complexity of finding connected induced subgraphs
• Improved Parameterized Algorithms for Weighted 3-Set Packing
• On the ordered list subgraph embedding problems
• Balanced Hashing, Color Coding and Approximate Counting
• Efficient algorithms for clique problems
• Parameterized algorithms for graph partitioning problems
• Designing deterministic polynomial-space algorithms by color-coding multivariate polynomials
• On some network design problems with degree constraints
• On the Fine-Grained Complexity of Rainbow Coloring
• Improved parameterized set splitting algorithms: A Probabilistic approach
• Linear time algorithms for finding a dominating set of fixed size in degenerated graphs
• Finding monotone paths in edge-ordered graphs
• Parameterized complexity of Eulerian deletion problems
• On the parameterized complexity of contraction to generalization of trees
• Parameterized and approximation algorithms for finding two disjoint matchings
• Parameterized low-rank binary matrix approximation
• Parameterized \(k\)-clustering: tractability island
• Designing FPT Algorithms for Cut Problems Using Randomized Contractions
• Title not available (Why is that?)
• Exact learning from an honest teacher that answers membership queries
• Improved deterministic algorithms for weighted matching and packing problems
• A sub-exponential FPT algorithm and a polynomial kernel for minimum directed bisection on semicomplete digraphs
• Algorithm for Finding k-Vertex Out-trees and Its Application to k-Internal Out-branching Problem
• Fréchet distance between a line and avatar point set
• Matching and weighted \(P_2\)-packing: algorithms and kernels
• Campaign management under approval-driven voting rules
• Exact learning of juntas from membership queries
• FPT-Algorithms for the \(\ell\) -Matchoid Problem with a Coverage Objective
• Fine-Grained Complexity of Rainbow Coloring and its Variants.
• Confronting intractability via parameters
• A simple algorithm for learning O(log n)-term DNF
• Almost Optimal Cover-Free Families
• Parameterized algorithms for non-separating trees and branchings in digraphs
• Threshold and Majority Group Testing
• On the parameterized complexity of vertex cover and edge cover with connectivity constraints

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4231923)