On the public citation graph

Exploring New Frontiers of Theoretical Informatics

0 signed · 27 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.
Claim with ORCID
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.
See reference health

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/11690634_19openalex-snapshot
Undecidability Results for Bisimilarity on Prefix Rewrite Systems
inferred← citeshttps://doi.org/10.1007/11734673_16openalex-snapshot
wp Is wlp
inferred← citeshttps://doi.org/10.1007/11784180_21openalex-snapshot
Quantales and Temporal Logics
inferred← citeshttps://doi.org/10.1007/11828563_15openalex-snapshot
Omega Algebra, Demonic Refinement Algebra and Commands
inferred← citeshttps://doi.org/10.1007/978-3-319-07959-2_11openalex-snapshot
Beyond Synchronous: New Techniques for External-Memory Graph Connectivity and Minimum Spanning Forest
inferred← citeshttps://doi.org/10.1007/978-3-319-12691-3_1openalex-snapshot
An Exact Algorithm for Non-preemptive Peak Demand Job Scheduling
inferred← citeshttps://doi.org/10.1007/978-3-540-78913-0_24openalex-snapshot
Knowledge and Games in Modal Semirings
inferred← citeshttps://doi.org/10.1007/s11334-009-0089-0openalex-snapshot
A formal model of composing components: the TLA+ approach
inferred← citeshttps://doi.org/10.1016/b978-0-12-374890-4.00013-6openalex-snapshot
References
inferred← citeshttps://doi.org/10.1016/j.apm.2019.05.007openalex-snapshot
Minimizing the number of machines with limited workload capacity for scheduling jobs with interval constraints
inferred← citeshttps://doi.org/10.1016/j.cie.2023.109514openalex-snapshot
Two is better than one? Order aggregation in a meal delivery scheduling problem
inferred← citeshttps://doi.org/10.1016/j.cor.2017.09.015openalex-snapshot
Total completion time minimization for machine scheduling problem under time windows constraints with jobs’ linear processing rate function
inferred← citeshttps://doi.org/10.1016/j.cor.2018.07.020openalex-snapshot
Parameterized complexity of machine scheduling: 15 open problems
inferred← citeshttps://doi.org/10.1016/j.ejor.2017.11.039openalex-snapshot
Branch-price-and-cut for the Mixed Capacitated General Routing Problem with Time Windows
inferred← citeshttps://doi.org/10.1016/j.jda.2012.04.010openalex-snapshot
The weak-heap data structure: Variants and applications
inferred← citeshttps://doi.org/10.1016/j.jisa.2021.102809openalex-snapshot
Dynamic 3D scrambled image based RGB image encryption scheme using hyperchaotic system and DNA encoding
inferred← citeshttps://doi.org/10.1016/j.jlap.2005.04.001openalex-snapshot
Abstract abstract reduction
inferred← citeshttps://doi.org/10.1016/j.jlap.2005.04.006openalex-snapshot
Kleene under a modal demonic star
inferred← citeshttps://doi.org/10.1016/j.orl.2022.06.007openalex-snapshot
Throughput scheduling with equal additive laxity
inferred← citeshttps://doi.org/10.1016/j.scico.2006.01.010openalex-snapshot
Kleene getting lazy
inferred← citeshttps://doi.org/10.1016/j.scico.2022.102781openalex-snapshot
Revisiting Occurrence Typing
inferred← citeshttps://doi.org/10.1016/j.tcs.2018.04.042openalex-snapshot
Order of weak M-relation and Parikh matrices
inferred← citeshttps://doi.org/10.1016/j.tcs.2021.02.011openalex-snapshot
An EPTAS for scheduling fork-join graphs with communication delay
inferred← citeshttps://doi.org/10.1017/s0956796818000047openalex-snapshot
An extended account of contract monitoring strategies as patterns of communication
inferred← citeshttps://doi.org/10.1117/12.2281040openalex-snapshot
Reversible synthesis of incompletely specified Boolean functions using functional decomposition
inferred← citeshttps://doi.org/10.1145/3358231openalex-snapshot
Specification Mining and Robust Design under Uncertainty
inferred← citeshttps://doi.org/10.3390/a10040122openalex-snapshot
Scheduling Non-Preemptible Jobs to Minimize Peak Demand
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.