On the public citation graph
Algorithm Theory - SWAT 2006: 10th Scandinavian Workshop on Algorithm Theory, Riga, Latvia, July 6-8, 2006, Proceedings
0 signed · 50 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/11785293_13openalex-snapshot
Online, Non-preemptive Scheduling of Equal-Length Jobs on Two Identical Machines
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/11775096_5openalex-snapshot
Online Scheduling with Hard Deadlines on Parallel Machines
inferred← citeshttps://doi.org/10.1007/11841036_45openalex-snapshot
Popular Matchings in the Capacitated House Allocation Problem
inferred← citeshttps://doi.org/10.1007/11847250_17openalex-snapshot
Finding a Minimum Feedback Vertex Set in Time $\mathcal{O} (1.7548^n)$
inferred← citeshttps://doi.org/10.1007/978-3-319-07956-1_26openalex-snapshot
A New Linear Kernel for Undirected Planar Feedback Vertex Set: Smaller and Simpler
inferred← citeshttps://doi.org/10.1007/978-3-540-69355-0_22openalex-snapshot
Gathering with Minimum Delay in Tree Sensor Networks
inferred← citeshttps://doi.org/10.1007/978-3-540-69903-3_32openalex-snapshot
A Simple Linear Time Algorithm for the Isomorphism Problem on Proper Circular-Arc Graphs
inferred← citeshttps://doi.org/10.1007/978-3-540-70575-8_35openalex-snapshot
Faster Algorithms for Incremental Topological Ordering
inferred← citeshttps://doi.org/10.1007/978-3-540-72951-8_2openalex-snapshot
Time Optimal Gathering in Sensor Networks
inferred← citeshttps://doi.org/10.1007/978-3-540-74430-6_18openalex-snapshot
SORMA – Building an Open Grid Market for Grid Resource Allocation
inferred← citeshttps://doi.org/10.1007/978-3-540-74839-7_11openalex-snapshot
The 3-Steiner Root Problem
inferred← citeshttps://doi.org/10.1007/978-3-540-74839-7_24openalex-snapshot
Proper Helly Circular-Arc Graphs
inferred← citeshttps://doi.org/10.1007/978-3-540-74839-7_27openalex-snapshot
How to Use Planarity Efficiently: New Tree-Decomposition Based Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-540-74839-7_8openalex-snapshot
The Clique-Width of Tree-Power and Leaf-Power Graphs
inferred← citeshttps://doi.org/10.1007/978-3-540-75520-3_39openalex-snapshot
Online Scheduling of Equal-Length Jobs on Parallel Machines
inferred← citeshttps://doi.org/10.1007/978-3-540-78773-0_51openalex-snapshot
The Least-Unpopularity-Factor and Least-Unpopularity-Margin Criteria for Matching Problems with One-Sided Preferences
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-79228-4_42openalex-snapshot
A Moderately Exponential Time Algorithm for Full Degree Spanning Tree
inferred← citeshttps://doi.org/10.1007/978-3-540-85209-4_16openalex-snapshot
Optimal Gathering Algorithms in Multi-hop Radio Tree-Networks ith Interferences
inferred← citeshttps://doi.org/10.1007/978-3-540-85958-1_20openalex-snapshot
From High Girth Graphs to Hard Instances
inferred← citeshttps://doi.org/10.1007/978-3-540-89639-5_64openalex-snapshot
Linear Time Constant-Working Space Algorithm for Computing the Genus of a Digital Object
inferred← citeshttps://doi.org/10.1007/978-3-540-92248-3_29openalex-snapshot
From a Circular-Arc Model to a Proper Circular-Arc Model
inferred← citeshttps://doi.org/10.1007/978-3-540-92862-1_3openalex-snapshot
Minimizing Average Flow Time in Sensor Data Gathering
inferred← citeshttps://doi.org/10.1007/978-3-540-92862-1_5openalex-snapshot
Efficient Scheduling of Data-Harvesting Trees
inferred← citeshttps://doi.org/10.1007/978-3-540-93980-1_16openalex-snapshot
Reoptimization of Weighted Graph and Covering Problems
inferred← citeshttps://doi.org/10.1007/978-3-540-93980-1_4openalex-snapshot
A Lower Bound for Scheduling of Unit Jobs with Immediate Decision on Parallel Machines
inferred← citeshttps://doi.org/10.1007/978-3-642-00945-7_11openalex-snapshot
Optimal Routing and Call Scheduling in Wireless Mesh Networks with Localized Informations
inferred← citeshttps://doi.org/10.1007/978-3-642-00982-2_12openalex-snapshot
Reoptimization of Traveling Salesperson Problems: Changing Single Edge-Weights
inferred← citeshttps://doi.org/10.1007/978-3-642-02158-9_23openalex-snapshot
Improved Online Algorithms for Multiplexing Weighted Packets in Bounded Buffers
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-03417-6_46openalex-snapshot
Minimum-Latency Schedulings for Group Communications in Multi-channel Multihop Wireless Networks
inferred← citeshttps://doi.org/10.1007/978-3-642-11409-0_21openalex-snapshot
Hardness Results and Efficient Algorithms for Graph Powers
inferred← citeshttps://doi.org/10.1007/978-3-642-13073-1_10openalex-snapshot
Popular Matchings in the Marriage and Roommates Problems
inferred← citeshttps://doi.org/10.1007/978-3-642-19222-7_1openalex-snapshot
Parameterized Algorithms for the Independent Set Problem in Some Hereditary Graph Classes
inferred← citeshttps://doi.org/10.1007/978-3-642-20000-7_2openalex-snapshot
Knowing All Optimal Solutions Does Not Help for TSP Reoptimization
inferred← citeshttps://doi.org/10.1007/978-3-642-21527-8_66openalex-snapshot
A Tabu Search Heuristic Based on k-Diamonds for the Weighted Feedback Vertex Set Problem
inferred← citeshttps://doi.org/10.1007/978-3-642-23719-5_25openalex-snapshot
Exact Algorithm for the Maximum Induced Planar Subgraph Problem
inferred← citeshttps://doi.org/10.1007/978-3-642-28076-4_10openalex-snapshot
Reoptimization of the Maximum Weighted P k -Free Subgraph Problem under Vertex Insertion
inferred← citeshttps://doi.org/10.1007/978-3-642-30217-6_42openalex-snapshot
Visualizing Clusters in Parallel Coordinates for Visual Knowledge Discovery
inferred← citeshttps://doi.org/10.1007/978-3-642-30850-5_11openalex-snapshot
Reoptimizing the Strengthened Metric TSP on Multiple Edge Weight Modifications
inferred← citeshttps://doi.org/10.1007/978-3-642-30891-8_13openalex-snapshot
Graph Minors and Parameterized Algorithm Design
inferred← citeshttps://doi.org/10.1007/978-3-642-32241-9_8openalex-snapshot
Dynamic Programming for H-minor-free Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-32589-2_19openalex-snapshot
New Advances in Reoptimizing the Minimum Steiner Tree Problem
inferred← citeshttps://doi.org/10.1007/978-3-642-45278-9_35openalex-snapshot
An Optimal Algorithm for the Popular Condensation Problem
inferred← citeshttps://doi.org/10.1007/s10732-015-9287-0openalex-snapshot
Heuristics for the local grid scheduling problem with processing time constraints
inferred← citeshttps://doi.org/10.1016/j.eswa.2025.126932openalex-snapshot
Complexity and resolution of spatio-temporal reasonings for criminology with greedy and evolutionary algorithms
inferred← citeshttps://doi.org/10.1103/physreva.108.052423openalex-snapshot
Exploring the impact of graph locality for the resolution of the maximum- independent-set problem with neutral atom devices
inferred← citeshttps://doi.org/10.25046/aj060142openalex-snapshot
Data Aggregation, Gathering and Gossiping in Duty-Cycled MultihopWireless Sensor Networks subject to Physical Interference
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.