On the public citation graph
LIMITS and Applications of Group Algebras for Parameterized Problems
0 signed · 71 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/3-540-36136-7_40openalex-snapshot
Approximation Algorithms for Some Parameterized Counting Problems
inferredcites →https://doi.org/10.1007/978-3-540-69507-3_31openalex-snapshot
Partial vs. Complete Domination: t-Dominating Set
inferredcites →https://doi.org/10.1007/978-3-540-70575-8_46openalex-snapshot
On Problems without Polynomial Kernels (Extended Abstract)
inferredcites →https://doi.org/10.1007/978-3-540-70575-8_47openalex-snapshot
Faster Algebraic Algorithms for Path and Packing Problems
inferredcites →https://doi.org/10.1007/978-3-540-73545-8_35openalex-snapshot
A Randomized Approximation Algorithm for Parameterized 3-D Matching Counting Problem
inferredcites →https://doi.org/10.1007/978-3-540-92182-0_26openalex-snapshot
A New Algorithm for Finding Trees with Many Leaves
inferredcites →https://doi.org/10.1007/978-3-642-02927-1_54openalex-snapshot
Limits and Applications of Group Algebras for Parameterized Problems
inferredcites →https://doi.org/10.1007/978-3-642-04128-0_52openalex-snapshot
Counting Paths and Packings in Halves
inferredcites →https://doi.org/10.1007/978-3-642-11269-0openalex-snapshot
Parameterized and Exact Computation: 4th International Workshop, IWPEC 2009, Copenhagen, Denmark, September 10-11, 2009, Revised Selected Papers
inferredcites →https://doi.org/10.1007/978-3-662-44777-2_37openalex-snapshot
Representative Sets of Product Families
inferredcites →https://doi.org/10.1007/bf02187701openalex-snapshot
A geometric inequality and the complexity of computing volume
inferredcites →https://doi.org/10.1016/0196-6774(86)90019-2openalex-snapshot
A fast and simple randomized parallel algorithm for the maximal independent set problem
inferredcites →https://doi.org/10.1016/j.aim.2008.06.004openalex-snapshot
Dispersion of Mass and the Complexity of Randomized Geometric Algorithms
inferredcites →https://doi.org/10.1016/j.ipl.2004.12.005openalex-snapshot
A faster parameterized algorithm for set packing
inferredcites →https://doi.org/10.1016/j.ipl.2008.11.002openalex-snapshot
Planar packing of trees and spider trees
inferredcites →https://doi.org/10.1016/j.ipl.2008.11.004openalex-snapshot
Finding paths of length k in time
inferredcites →https://doi.org/10.1016/j.ipl.2010.07.005openalex-snapshot
Evaluation of permanents in rings and semirings
inferredcites →https://doi.org/10.1016/s0924-6509(08)x7030-8openalex-snapshot
The Theory of Error-Correcting Codes
inferredcites →https://doi.org/10.1016/s1571-0661(04)00301-9openalex-snapshot
Parameterized Complexity
inferredcites →https://doi.org/10.1017/cbo9780511626265openalex-snapshot
Fourier Analysis on Finite Groups and Applications
inferredcites →https://doi.org/10.1093/bioinformatics/btn163openalex-snapshot
Biomolecular network motif counting and discovery by color coding
inferredcites →https://doi.org/10.1108/ir.1999.04926fae.001openalex-snapshot
Lecture Notes in Computer Science 1205
inferredcites →https://doi.org/10.1109/focs.2010.24openalex-snapshot
Determinant Sums for Undirected Hamiltonicity
inferredcites →https://doi.org/10.1137/s0097539703427203openalex-snapshot
The Parameterized Complexity of Counting Problems
inferredcites →https://doi.org/10.1145/1536414.1536477openalex-snapshot
Finding, minimizing, and counting weighted subgraphs
inferredcites →https://doi.org/10.1214/aop/1176993605openalex-snapshot
Minimization Algorithms and Random Walk on the $d$-Cube
inferredcites →https://doi.org/10.48550/arxiv.0809.2489openalex-snapshot
The fast intersection transform with applications to counting paths
inferredcites →https://doi.org/10.5555/1283383.1283415openalex-snapshot
Improved algorithms for path, matching, and packing problems
inferredcites →https://doi.org/10.5860/choice.37-6316openalex-snapshot
Fourier analysis on finite groups and applications
inferredcites →https://doi.org/10.7551/mitpress/1948.001.0001openalex-snapshot
Communication Complexity
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-3-030-38919-2_20openalex-snapshot
Parameterized Dynamic Variants of Red-Blue Dominating Set
inferred← citeshttps://doi.org/10.1007/978-3-030-42071-0_10openalex-snapshot
Four Shorts Stories on Surprising Algorithmic Uses of Treewidth
inferred← citeshttps://doi.org/10.1007/978-3-031-23101-8_12openalex-snapshot
Balanced Substructures in Bicolored Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-13182-0_31openalex-snapshot
A Faster Exact Algorithm for the Directed Maximum Leaf Spanning Tree Problem
inferred← citeshttps://doi.org/10.1007/978-3-642-29627-7_22openalex-snapshot
Finding Maximum Colorful Subtrees in Practice
inferred← citeshttps://doi.org/10.1007/978-3-642-33460-3_33openalex-snapshot
Nearly Exact Mining of Frequent Trees in Large Networks
inferred← citeshttps://doi.org/10.1007/978-3-642-39206-1_17openalex-snapshot
Deterministic Single Exponential Time Algorithms for Connectivity Problems Parameterized by Treewidth
inferred← citeshttps://doi.org/10.1007/978-3-642-40104-6_34openalex-snapshot
Finding the Minimum-Weight k-Path
inferred← citeshttps://doi.org/10.1007/s00224-021-10053-wopenalex-snapshot
Univariate Ideal Membership Parameterized by Rank, Degree, and Number of Generators
inferred← citeshttps://doi.org/10.1007/s00453-013-9759-2openalex-snapshot
Inclusion/Exclusion Meets Measure and Conquer
inferred← citeshttps://doi.org/10.1007/s00453-021-00900-0openalex-snapshot
Fast Exact Algorithms Using Hadamard Product of Polynomials
inferred← citeshttps://doi.org/10.1007/s10910-018-0980-8openalex-snapshot
Application of group ring algebra to localized and delocalized quantum states in periodic potentials
inferred← citeshttps://doi.org/10.1016/j.ipl.2010.07.005openalex-snapshot
Evaluation of permanents in rings and semirings
inferred← citeshttps://doi.org/10.1016/j.jcss.2018.01.004openalex-snapshot
Designing deterministic polynomial-space algorithms by color-coding multivariate polynomials
inferred← citeshttps://doi.org/10.1016/j.jcss.2018.11.002openalex-snapshot
Clearing directed subgraphs by mobile agents
inferred← citeshttps://doi.org/10.1016/j.tcs.2026.115745openalex-snapshot
Balanced substructures in bicolored graphs
inferred← citeshttps://doi.org/10.1137/1.9781611975482.105openalex-snapshot
On r-Simple k-Path and Related Problems Parameterized by k/r
inferred← citeshttps://doi.org/10.1137/15m1026341openalex-snapshot
Reducing Parallel Communication in Algebraic Multigrid through Sparsification
inferred← citeshttps://doi.org/10.1145/3055399.3055502openalex-snapshot
Homomorphisms are a good basis for counting small subgraphs
inferred← citeshttps://doi.org/10.1145/3357713.3384264openalex-snapshot
Bipartite TSP in o(1.9999ⁿ) time, assuming quadratic time matrix multiplication
inferred← citeshttps://doi.org/10.1145/3439721openalex-snapshot
r -Simple k -Path and Related Problems Parameterized by k / r
inferred← citeshttps://doi.org/10.1145/3461477openalex-snapshot
Approximate Counting of k -Paths: Simpler, Deterministic, and in Polynomial Space
inferred← citeshttps://doi.org/10.1145/3756324openalex-snapshot
A Simple Inclusion-Exclusion Based Algorithm for ( k, n )-MLC and Related Problems
inferred← citeshttps://doi.org/10.17760/d20316246openalex-snapshot
Any-k evaluation of conjunctive queries and its application to graph pattern matching
inferred← citeshttps://doi.org/10.4230/lipics.isaac.2019.38openalex-snapshot
On Explicit Branching Programs for the Rectangular Determinant and Permanent Polynomials
inferred← citeshttps://doi.org/10.4230/lipics.stacs.2013.20openalex-snapshot
Probably Optimal Graph Motifs
inferred← citeshttps://doi.org/10.4230/lipics.stacs.2019.45openalex-snapshot
The Set Cover Conjecture and Subgraph Isomorphism with a Tree Pattern
inferred← citeshttps://doi.org/10.46298/dmtcs.1256openalex-snapshot
A Parameterized Measure-and-ConquerAnalysis for Finding a k-Leaf Spanning Treein an Undirected Graph
inferred← citeshttps://doi.org/10.48550/arxiv.0911.1900openalex-snapshot
A Faster Exact Algorithm for the Directed Maximum Leaf Spanning Tree Problem
inferred← citeshttps://doi.org/10.48550/arxiv.1211.1505openalex-snapshot
Solving weighted and counting variants of connectivity problems parameterized by treewidth deterministically in single exponential time
inferred← citeshttps://doi.org/10.48550/arxiv.1505.00709openalex-snapshot
Parameterized Approximation Algorithms for Packing Problems
inferred← citeshttps://doi.org/10.48550/arxiv.1507.07459openalex-snapshot
On local search and LP and SDP relaxations for k-Set Packing
inferred← citeshttps://doi.org/10.48550/arxiv.1803.04940openalex-snapshot
Nearly Optimal Time Bounds for kPath in Hypergraphs
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.