On the public citation graph
Tractable Parameterizations for the Minimum Linear Arrangement Problem
0 signed · 54 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/978-1-4471-5559-1openalex-snapshot
Fundamentals of Parameterized Complexity
inferredcites →https://doi.org/10.1007/978-3-540-92182-0_28openalex-snapshot
Graph Layout Problems Parameterized by Vertex Cover
inferredcites →https://doi.org/10.1007/978-3-662-46078-8_21openalex-snapshot
Finding Highly Connected Subgraphs
inferredcites →https://doi.org/10.1007/s00224-007-1330-6openalex-snapshot
The Linear Arrangement Problem Parameterized Above Guaranteed Value
inferredcites →https://doi.org/10.1007/s00224-009-9167-9openalex-snapshot
The Complexity Ecology of Parameters: An Illustration Using Bounded Max Leaf Number
inferredcites →https://doi.org/10.1007/s00224-011-9312-0openalex-snapshot
A Note on Exact Algorithms for Vertex Ordering Problems on Graphs
inferredcites →https://doi.org/10.1016/j.dam.2008.05.008openalex-snapshot
Parameterized algorithmics for linear arrangement problems
inferredcites →https://doi.org/10.1016/j.ejc.2012.04.008openalex-snapshot
Towards fully multivariate algorithmics: Parameter ecology and the deconstruction of computational complexity
inferredcites →https://doi.org/10.1016/j.ic.2010.11.026openalex-snapshot
On the complexity of some colorful problems parameterized by treewidth
inferredcites →https://doi.org/10.1016/j.ipl.2006.07.009openalex-snapshot
An improved approximation ratio for the minimum linear arrangement problem
inferredcites →https://doi.org/10.1137/080729256openalex-snapshot
Inapproximability Results for Maximum Edge Biclique, Minimum Linear Arrangement, and Sparsest Cut
inferredcites →https://doi.org/10.1137/120903518openalex-snapshot
Preprocessing for Treewidth: A Combinatorial Analysis through Kernelization
inferredcites →https://doi.org/10.1137/s0097539702413197openalex-snapshot
New Approximation Techniques for Some Linear Ordering Problems
inferredcites →https://doi.org/10.1145/1412228.1412236openalex-snapshot
Data reduction and exact algorithms for clique cover
inferredcites →https://doi.org/10.1145/195058.195229openalex-snapshot
Beyond NP-completeness for problems of bounded width (extended abstract)
inferredcites →https://doi.org/10.1287/moor.12.3.415openalex-snapshot
Minkowski's Convex Body Theorem and Integer Programming
inferredcites →https://doi.org/10.1287/moor.8.4.538openalex-snapshot
Integer Programming with a Fixed Number of Variables
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-48966-3_17openalex-snapshot
Ordering a Sparse Graph to Minimize the Sum of Right Ends of Edges
inferred← citeshttps://doi.org/10.1007/978-3-030-79987-8_18openalex-snapshot
On an Ordering Problem in Weighted Hypergraphs
inferred← citeshttps://doi.org/10.1007/978-3-642-40450-4_39openalex-snapshot
Tractable Parameterizations for the Minimum Linear Arrangement Problem
inferred← citeshttps://doi.org/10.1007/s00453-025-01315-xopenalex-snapshot
Bandwidth Parameterized by Cluster Vertex Deletion Number
inferred← citeshttps://doi.org/10.1017/9781107415157.017openalex-snapshot
Bidimensionality and Protrusions
inferred← citeshttps://doi.org/10.1017/9781107415157.021openalex-snapshot
Polynomial Parameter Transformation
inferred← citeshttps://doi.org/10.1186/s13015-018-0133-4openalex-snapshot
Coordinate systems for supergenomes
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.