On the public citation graph
Parameterized Complexity of Independence and Domination on Geometric Graphs
0 signed · 43 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/11561071_41openalex-snapshot
Efficient Approximation Schemes for Geometric Problems?
inferredcites →https://doi.org/10.1007/11847250_15openalex-snapshot
Fixed Parameter Tractability of Independent Set in Segment Intersection Graphs
inferredcites →https://doi.org/10.1016/0020-0190(88)90174-3openalex-snapshot
A study on two geometric location problems
inferredcites →https://doi.org/10.1016/s0925-7721(98)00028-5openalex-snapshot
Label placement by maximum independent set in rectangles
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/11847250_15openalex-snapshot
Fixed Parameter Tractability of Independent Set in Segment Intersection Graphs
inferred← citeshttps://doi.org/10.1007/978-1-0716-3989-4_10openalex-snapshot
Color Coding for the Fragment-Based Docking, Design and Equilibrium Statistics of Protein-Binding ssRNAs
inferred← citeshttps://doi.org/10.1007/978-3-030-00256-5_7openalex-snapshot
Optimality Program in Segment and String Graphs
inferred← citeshttps://doi.org/10.1007/978-3-030-39881-1_14openalex-snapshot
Maximum Bipartite Subgraph of Geometric Intersection Graphs
inferred← citeshttps://doi.org/10.1007/978-3-030-86593-1_15openalex-snapshot
Parameterized Complexity of Finding Subgraphs with Hereditary Properties on Hereditary Graph Classes
inferred← citeshttps://doi.org/10.1007/978-3-319-62127-2_25openalex-snapshot
The Homogeneous Broadcast Problem in Narrow and Wide Strips
inferred← citeshttps://doi.org/10.1007/978-3-319-62127-2_6openalex-snapshot
Parameterized Complexity of Geometric Covering Problems Having Conflicts
inferred← citeshttps://doi.org/10.1007/978-3-540-78773-0_64openalex-snapshot
Domination in Geometric Intersection Graphs
inferred← citeshttps://doi.org/10.1007/978-3-540-79723-4_11openalex-snapshot
A Purely Democratic Characterization of W[1]
inferred← citeshttps://doi.org/10.1007/978-3-642-00202-1_26openalex-snapshot
Parameterized Complexity of Stabbing Rectangles and Squares in the Plane
inferred← citeshttps://doi.org/10.1007/978-3-642-03417-6_15openalex-snapshot
Minimum Interference Planar Geometric Topology in Wireless Sensor Networks
inferred← citeshttps://doi.org/10.1007/978-3-642-13731-0_30openalex-snapshot
Polynomial Kernels for Hard Problems on Disk Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-15369-3_13openalex-snapshot
PTAS for Weighted Set Cover on Unit Squares
inferred← citeshttps://doi.org/10.1007/978-3-642-22006-7_39openalex-snapshot
Domination When the Stars Are Out
inferred← citeshttps://doi.org/10.1007/978-3-642-34611-8_31openalex-snapshot
Parameterized Domination in Circle Graphs
inferred← citeshttps://doi.org/10.1007/978-3-662-49529-2_8openalex-snapshot
Parameterized Complexity of Red Blue Set Cover for Lines
inferred← citeshttps://doi.org/10.1007/s00224-008-9138-6openalex-snapshot
W-Hierarchies Defined by Symmetric Gates
inferred← citeshttps://doi.org/10.1007/s00224-011-9366-zopenalex-snapshot
Structure of Polynomial-Time Approximation
inferred← citeshttps://doi.org/10.1007/s00224-013-9478-8openalex-snapshot
Parameterized Domination in Circle Graphs
inferred← citeshttps://doi.org/10.1007/s00224-021-10050-zopenalex-snapshot
Exact Multi-Covering Problems with Geometric Sets
inferred← citeshttps://doi.org/10.1007/s00453-010-9471-4openalex-snapshot
The Parameterized Complexity of Stabbing Rectangles
inferred← citeshttps://doi.org/10.1007/s00453-016-0216-xopenalex-snapshot
Multivariate Complexity Analysis of Geometric Red Blue Set Cover
inferred← citeshttps://doi.org/10.1007/s00453-019-00561-0openalex-snapshot
The Homogeneous Broadcast Problem in Narrow and Wide Strips II: Lower Bounds
inferred← citeshttps://doi.org/10.1007/s00453-019-00567-8openalex-snapshot
The Homogeneous Broadcast Problem in Narrow and Wide Strips I: Algorithms
inferred← citeshttps://doi.org/10.1007/s00453-019-00568-7openalex-snapshot
Optimality Program in Segment and String Graphs
inferred← citeshttps://doi.org/10.1007/s00453-020-00730-6openalex-snapshot
Parameterized Complexity of Independent Set in H-Free Graphs
inferred← citeshttps://doi.org/10.1007/s00453-022-01001-2openalex-snapshot
Grundy Coloring and Friends, Half-Graphs, Bicliques
inferred← citeshttps://doi.org/10.1007/s00454-016-9819-xopenalex-snapshot
Limits of Local Search: Quality and Efficiency
inferred← citeshttps://doi.org/10.1007/s00454-021-00343-yopenalex-snapshot
A Tight Analysis of Geometric Local Search
inferred← citeshttps://doi.org/10.1007/s00454-025-00782-xopenalex-snapshot
Multicut Problems in Embedded Graphs: The Dependency of Complexity on the Demand Pattern
inferred← citeshttps://doi.org/10.1007/s10878-008-9141-5openalex-snapshot
Parameterized dominating set problem in chordal graphs: complexity and lower bound
inferred← citeshttps://doi.org/10.1007/s10878-020-00685-yopenalex-snapshot
Dominating set of rectangles intersecting a straight line
inferred← citeshttps://doi.org/10.1016/j.cosrev.2025.100796openalex-snapshot
Parameterized algorithms on geometric intersection graphs
inferred← citeshttps://doi.org/10.1016/j.tcs.2008.09.065openalex-snapshot
On the parameterized complexity of multiple-interval graph problems
inferred← citeshttps://doi.org/10.1016/j.tcs.2012.01.025openalex-snapshot
Parameterized complexity in multiple-interval graphs: Domination, partition, separation, irredundancy
inferred← citeshttps://doi.org/10.1142/s021819592350005xopenalex-snapshot
Maximum Bipartite Subgraphs of Geometric Intersection Graphs
inferred← citeshttps://doi.org/10.1145/3483425openalex-snapshot
Optimal Parameterized Algorithms for Planar Facility Location Problems Using Voronoi Diagrams
inferred← citeshttps://doi.org/10.4230/lipics.stacs.2020.58openalex-snapshot
Grundy Coloring & Friends, Half-Graphs, Bicliques
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.