On the public citation graph
SOFSEM 2005: Theory and Practice of Computer Science
0 signed · 53 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 points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/11427186_20openalex-snapshot
New Upper Bound Heuristics for Treewidth
inferred← citeshttps://doi.org/10.1007/11427186_25openalex-snapshot
On Symbolic Scheduling Independent Tasks with Restricted Execution Times
inferred← citeshttps://doi.org/10.1007/11427186_33openalex-snapshot
New Bit-Parallel Indel-Distance Algorithm
inferred← citeshttps://doi.org/10.1007/11602613_31openalex-snapshot
SkipTree: A Scalable Range-Queryable Distributed Data Structure for Multidimensional Data
inferred← citeshttps://doi.org/10.1007/11602613_66openalex-snapshot
Solving Minimum Weight Exact Satisfiability in Time O(20.2441n )
inferred← citeshttps://doi.org/10.1007/11758532_29openalex-snapshot
A Consensus-Based Multi-agent Approach for Information Retrieval in Internet
inferred← citeshttps://doi.org/10.1007/11779568_34openalex-snapshot
Local Search Algorithm for Unicost Set Covering Problem
inferred← citeshttps://doi.org/10.1007/11785293_19openalex-snapshot
On the Approximation Hardness of Some Generalizations of TSP
inferred← citeshttps://doi.org/10.1007/11802372_59openalex-snapshot
The Efficient and Low Load Range Queries in P2P
inferred← citeshttps://doi.org/10.1007/11892960_124openalex-snapshot
Forecasting Region Search of Moving Objects
inferred← citeshttps://doi.org/10.1007/978-3-319-03841-4_2openalex-snapshot
Upward Planarity Testing: A Computational Study
inferred← citeshttps://doi.org/10.1007/978-3-319-11558-0_39openalex-snapshot
The D-FLAT System for Dynamic Programming on Tree Decompositions
inferred← citeshttps://doi.org/10.1007/978-3-540-68914-0_18openalex-snapshot
Repelling Detour Attack Against Onions with Re-encryption
inferred← citeshttps://doi.org/10.1007/978-3-540-70504-8_23openalex-snapshot
The Hyperdatabase Project – From the Vision to Realizations
inferred← citeshttps://doi.org/10.1007/978-3-540-72031-7_57openalex-snapshot
Comparative Pathway Prediction Via Unified Graph Modeling of Genomic Structure Information
inferred← citeshttps://doi.org/10.1007/978-3-540-72524-4_58openalex-snapshot
Continuous k-Nearest Neighbor Search Under Mobile Environment
inferred← citeshttps://doi.org/10.1007/978-3-540-72788-0_19openalex-snapshot
Algorithms for Variable-Weighted 2-SAT and Dual Problems
inferred← citeshttps://doi.org/10.1007/978-3-540-72830-6_22openalex-snapshot
Performance Evaluation of Mobile Agents for Knowledge-Based Web Information Services
inferred← citeshttps://doi.org/10.1007/978-3-540-72951-8_3openalex-snapshot
Treewidth: Structure and Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-540-72986-0_2openalex-snapshot
RAQNet: A Topology-Aware Overlay Network
inferred← citeshttps://doi.org/10.1007/978-3-540-74792-5_9openalex-snapshot
On Recursion, Replication and Scope Mechanisms in Process Calculi
inferred← citeshttps://doi.org/10.1007/978-3-540-74851-9_48openalex-snapshot
Personalized Faceted Browsing for Digital Libraries
inferred← citeshttps://doi.org/10.1007/978-3-540-76637-7_26openalex-snapshot
CCS with Replication in the Chomsky Hierarchy: The Expressive Power of Divergence
inferred← citeshttps://doi.org/10.1007/978-3-540-77115-9_12openalex-snapshot
Hasslefree: Simplified Access Control Management for XML Documents
inferred← citeshttps://doi.org/10.1007/978-3-540-87405-8_5openalex-snapshot
Labelled (Hyper)Graphs, Negotiations and the Naming Problem
inferred← citeshttps://doi.org/10.1007/978-3-540-87993-0_23openalex-snapshot
Performance Evaluation of Algorithms for Soft Evidential Update in Bayesian Networks: First Results
inferred← citeshttps://doi.org/10.1007/978-3-540-88636-5_1openalex-snapshot
Heuristic Methods for Hypertree Decomposition
inferred← citeshttps://doi.org/10.1007/978-3-540-89900-6_14openalex-snapshot
Access Control of Federated Information Systems
inferred← citeshttps://doi.org/10.1007/978-3-642-02777-2_6openalex-snapshot
Encoding Treewidth into SAT
inferred← citeshttps://doi.org/10.1007/978-3-642-11266-9_19openalex-snapshot
Symbolic OBDD-Based Reachability Analysis Needs Exponential Space
inferred← citeshttps://doi.org/10.1007/978-3-642-12029-9_8openalex-snapshot
Dynamic Resource Scheduling in Disruption-Prone Software Development Environments
inferred← citeshttps://doi.org/10.1007/978-3-642-14031-0_14openalex-snapshot
Maximum Upward Planar Subgraph of a Single-Source Embedded Digraph
inferred← citeshttps://doi.org/10.1007/978-3-642-15155-2_18openalex-snapshot
Exponential Space Complexity for Symbolic Maximum Flow Algorithms in 0-1 Networks
inferred← citeshttps://doi.org/10.1007/978-3-642-16819-2_6openalex-snapshot
Leveraging Software Architectures through the ISO/IEC 42010 Standard: A Feasibility Study
inferred← citeshttps://doi.org/10.1007/978-3-642-18381-2_37openalex-snapshot
A Local Search Algorithm for Branchwidth
inferred← citeshttps://doi.org/10.1007/978-3-642-22386-0_15openalex-snapshot
Developing Applications with Aspect-Oriented Change Realization
inferred← citeshttps://doi.org/10.1007/978-3-642-25106-1_23openalex-snapshot
Implementation of Updateable Object Views in the ODRA OODBMS
inferred← citeshttps://doi.org/10.1007/978-3-642-25261-7_5openalex-snapshot
Implementation of Access Control Model for Distributed Information Systems Using Usage Control
inferred← citeshttps://doi.org/10.1007/978-3-642-25274-7_3openalex-snapshot
A Multi-agent System for Incident Management Solutions on IT Infrastructures
inferred← citeshttps://doi.org/10.1007/978-3-642-27446-6_3openalex-snapshot
Access Control Management Using Extended RBAC Model
inferred← citeshttps://doi.org/10.1007/978-3-642-32498-7_11openalex-snapshot
UML Representation of Extended Role-Based Access Control Model with the Use of Usage Control Concept
inferred← citeshttps://doi.org/10.1007/978-3-642-33122-0_8openalex-snapshot
Reducing Problems in Unrooted Tree Compatibility to Restricted Triangulations of Intersection Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-34135-9_27openalex-snapshot
Three-Way Handshake-Based OTP Using Random Host-Side Keys for Effective Key Transfer in Symmetric Cryptosystems
inferred← citeshttps://doi.org/10.1007/978-3-642-36763-2_22openalex-snapshot
Upward Planarity Testing via SAT
inferred← citeshttps://doi.org/10.1007/978-3-642-40495-5_66openalex-snapshot
Efficient n-Gram-Based String Matching in Electronic Testing at Programming
inferred← citeshttps://doi.org/10.1007/978-3-662-45803-7_26openalex-snapshot
Trade-Offs in Planar Polyline Drawings
inferred← citeshttps://doi.org/10.1007/s00453-008-9194-yopenalex-snapshot
Collective Tree Spanners in Graphs with Bounded Parameters
inferred← citeshttps://doi.org/10.1016/j.csi.2016.02.007openalex-snapshot
Conversion cost and specification on interfaces of key-value stores
inferred← citeshttps://doi.org/10.1016/j.ijar.2016.12.016openalex-snapshot
An approach to characterize graded entailment of arguments through a label-based framework
inferred← citeshttps://doi.org/10.1016/j.neunet.2011.02.002openalex-snapshot
Architectural and Markovian factors of echo state networks
inferred← citeshttps://doi.org/10.1093/comjnl/bxw064openalex-snapshot
Dynamic Upward Planarity Testing of Single Source Embedded Digraphs
inferred← citeshttps://doi.org/10.1109/ssci.2017.8280961openalex-snapshot
Testing properties of fuzzy connectives and truth degrees with the latticemaker tool
inferred← citeshttps://doi.org/10.1145/1068009.1068215openalex-snapshot
Statistical analysis of heuristics for evolving sorting networks
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.