On the public citation graph
Expected Computation Time for Hamiltonian Path problem
0 signed · 131 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-4612-9967-7openalex-snapshot
Graph Theory: An Introductory Course
inferredcites →https://doi.org/10.1007/978-3-0348-9078-6_132openalex-snapshot
Probabilistic Methods in Combinatorics
inferredcites →https://doi.org/10.1007/978-3-642-68874-4_6openalex-snapshot
Applications of the FKG Inequality and Its Relatives
inferredcites →https://doi.org/10.1007/bf02579348openalex-snapshot
How many random edges make a graph hamiltonian?
inferredcites →https://doi.org/10.1016/0012-365x(76)90068-6openalex-snapshot
Hamiltonian circuits in random graphs
inferredcites →https://doi.org/10.1016/0022-0000(79)90045-xopenalex-snapshot
Fast probabilistic algorithms for hamiltonian circuits and matchings
inferredcites →https://doi.org/10.1016/0196-6774(84)90032-4openalex-snapshot
The NP-completeness column: An ongoing guide
inferredcites →https://doi.org/10.1016/0196-6774(86)90020-9openalex-snapshot
The NP-completeness column: An ongoing guide
inferredcites →https://doi.org/10.1016/s0022-0000(70)80006-xopenalex-snapshot
Relationships between nondeterministic and deterministic tape complexities
inferredcites →https://doi.org/10.1090/psapm/010/0113718openalex-snapshot
Combinatorial processes and dynamic programming
inferredcites →https://doi.org/10.1137/0110015openalex-snapshot
A Dynamic Programming Approach to Sequencing Problems
inferredcites →https://doi.org/10.1145/800057.808713openalex-snapshot
Problems, complete in “average” instance
inferredcites →https://doi.org/10.1214/aoms/1177729330openalex-snapshot
A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/(sici)1098-2418(199701/03)10:1/2<5::aid-rsa2>3.0.co;2-zopenalex-snapshot
Algorithmic theory of random graphs
inferred← citeshttps://doi.org/10.1002/jgt.3190150204openalex-snapshot
Updating the hamiltonian problem—A survey
inferred← citeshttps://doi.org/10.1002/rsa.20832openalex-snapshot
Traveling in randomly embedded random graphs
inferred← citeshttps://doi.org/10.1002/rsa.20918openalex-snapshot
Finding a Hamilton cycle fast on average using rotations and extensions
inferred← citeshttps://doi.org/10.1002/rsa.3240050303openalex-snapshot
Finding hidden hamiltonian cycles
inferred← citeshttps://doi.org/10.1007/11527954_7openalex-snapshot
A Distributed Algorithm to Find Hamiltonian Cycles in $\mathcal{G}(n, p)$ Random Graphs
inferred← citeshttps://doi.org/10.1007/11602613_50openalex-snapshot
Simple and Efficient Greedy Algorithms for Hamilton Cycles in Random Intersection Graphs
inferred← citeshttps://doi.org/10.1007/11786986_48openalex-snapshot
Exact Algorithms for Exact Satisfiability and Number of Perfect Matchings
inferred← citeshttps://doi.org/10.1007/11841036_60openalex-snapshot
On Exact Algorithms for Treewidth
inferred← citeshttps://doi.org/10.1007/3-540-61332-3_164openalex-snapshot
Reductions and convergence rates of average time
inferred← citeshttps://doi.org/10.1007/978-1-4612-1872-2_12openalex-snapshot
Average-Case Computational Complexity Theory
inferred← citeshttps://doi.org/10.1007/978-1-4613-3394-4_15openalex-snapshot
Average-Case Intractable NP Problems
inferred← citeshttps://doi.org/10.1007/978-1-62703-514-9_5openalex-snapshot
Assembly Algorithms for Deep Sequencing Data: Basics and Pitfalls
inferred← citeshttps://doi.org/10.1007/978-3-030-17798-0_31openalex-snapshot
Towards Approximate Sphere Packing Solutions Using Distance Transformations and Dynamic Logic
inferred← citeshttps://doi.org/10.1007/978-3-030-73216-5_20openalex-snapshot
Activity Organization Queries for Location-Aware Heterogeneous Information Network
inferred← citeshttps://doi.org/10.1007/978-3-319-48532-4_20openalex-snapshot
A Polynomial-Space Exact Algorithm for TSP in Degree-6 Graphs
inferred← citeshttps://doi.org/10.1007/978-3-540-87744-8_36openalex-snapshot
Faster Steiner Tree Computation in Polynomial-Space
inferred← citeshttps://doi.org/10.1007/978-3-642-04128-0_52openalex-snapshot
Counting Paths and Packings in Halves
inferred← citeshttps://doi.org/10.1007/978-3-642-15025-8_1openalex-snapshot
Yuri, Logic, and Computer Science
inferred← citeshttps://doi.org/10.1007/978-3-642-38536-0_17openalex-snapshot
On the Encoding Invariance of Polynomial Time Computable Distribution Ensembles
inferred← citeshttps://doi.org/10.1007/978-3-662-12788-9_2openalex-snapshot
Probabilistic Analysis of Algorithms
inferred← citeshttps://doi.org/10.1007/978-94-009-1606-7_11openalex-snapshot
An Integer Linear Programming Algorithm Polynomial in the Average Case
inferred← citeshttps://doi.org/10.1007/978-981-16-1089-9_69openalex-snapshot
Human Identification System Based on Latent Fingerprint
inferred← citeshttps://doi.org/10.1007/bfb0030860openalex-snapshot
Rankable distributions do not provide harder instances than uniform distributions
inferred← citeshttps://doi.org/10.1007/bfb0055799openalex-snapshot
Average-case intractability vs. worst-case intractability
inferred← citeshttps://doi.org/10.1007/pl00009267openalex-snapshot
Reductions Do Not Preserve Fast Convergence Rates in Average Time
inferred← citeshttps://doi.org/10.1007/s00224-011-9312-0openalex-snapshot
A Note on Exact Algorithms for Vertex Ordering Problems on Graphs
inferred← citeshttps://doi.org/10.1007/s00453-007-9149-8openalex-snapshot
Exact Algorithms for Exact Satisfiability and Number of Perfect Matchings
inferred← citeshttps://doi.org/10.1007/s00453-012-9612-zopenalex-snapshot
Computing Optimal Steiner Trees in Polynomial Space
inferred← citeshttps://doi.org/10.1007/s10288-015-0294-7openalex-snapshot
When polynomial approximation meets exact computation
inferred← citeshttps://doi.org/10.1007/s10479-018-2986-9openalex-snapshot
When polynomial approximation meets exact computation
inferred← citeshttps://doi.org/10.1016/0012-365x(89)90100-3openalex-snapshot
A simple linear expected time algorithm for finding a hamilton path
inferred← citeshttps://doi.org/10.1016/0020-0190(87)90229-8openalex-snapshot
Parallel algorithms for finding Hamilton cycles in random graphs
inferred← citeshttps://doi.org/10.1016/0020-0190(93)90033-6openalex-snapshot
Inclusion and exclusion algorithm for the Hamiltonian path problem
inferred← citeshttps://doi.org/10.1016/0020-0190(95)00108-oopenalex-snapshot
Some properties of sets tractable under every polynomial-time computable distribution
inferred← citeshttps://doi.org/10.1016/0022-0000(91)90007-ropenalex-snapshot
Average case completeness
inferred← citeshttps://doi.org/10.1016/j.compag.2020.105817openalex-snapshot
Adaptive autonomous UAV scouting for rice lodging assessment using edge computing with deep learning EDANet
inferred← citeshttps://doi.org/10.1016/j.cor.2020.105171openalex-snapshot
Branch & Memorize exact algorithms for sequencing problems: Efficient embedding of memorization into search trees
inferred← citeshttps://doi.org/10.1016/j.cosrev.2026.100919openalex-snapshot
An invitation to “Fine-grained complexity of NP-complete problems”
inferred← citeshttps://doi.org/10.1016/j.dam.2011.10.032openalex-snapshot
Bandwidth and distortion revisited
inferred← citeshttps://doi.org/10.1016/j.ipl.2007.05.014openalex-snapshot
Improved fixed parameter tractable algorithms for two “edge” problems: MAXCUT and MAXDAG
inferred← citeshttps://doi.org/10.1016/j.ipl.2009.05.003openalex-snapshot
Exponential-time approximation of weighted set cover
inferred← citeshttps://doi.org/10.1016/j.ipl.2010.07.005openalex-snapshot
Evaluation of permanents in rings and semirings
inferred← citeshttps://doi.org/10.1016/j.jcss.2026.103802openalex-snapshot
Exact and heuristic computation of the scanwidth of directed acyclic graphs
inferred← citeshttps://doi.org/10.1016/j.jda.2013.06.011openalex-snapshot
Exponential approximation schemata for some network design problems
inferred← citeshttps://doi.org/10.1016/j.tcs.2018.05.040openalex-snapshot
An exact exponential branch-and-merge algorithm for the single machine total tardiness problem
inferred← citeshttps://doi.org/10.1016/s0049-237x(06)80047-9openalex-snapshot
The impact of model theory on theoretical computer science
inferred← citeshttps://doi.org/10.1016/s0196-6774(02)00224-9openalex-snapshot
Worst-case time bounds for coloring and satisfiability problems
inferred← citeshttps://doi.org/10.1016/s0304-3975(96)00272-1openalex-snapshot
No NP problems averaging over ranking of distributions are harder
inferred← citeshttps://doi.org/10.1017/9781108332699.003openalex-snapshot
Large-scale structures in random graphs
inferred← citeshttps://doi.org/10.1017/cbo9781316339831openalex-snapshot
Introduction to Random Graphs
inferred← citeshttps://doi.org/10.1017/s0963548318000123openalex-snapshot
An Average Case NP-complete Graph Colouring Problem
inferred← citeshttps://doi.org/10.1023/a:1008374125234openalex-snapshot
Hiding Cliques for Cryptographic Security
inferred← citeshttps://doi.org/10.1038/s41534-025-01093-yopenalex-snapshot
Efficient sparse state preparation via quantum walks
inferred← citeshttps://doi.org/10.1049/cp.2015.0608openalex-snapshot
Polynomial-space exact algorithm for TSP in degree-5 graphs
inferred← citeshttps://doi.org/10.1098/rsos.180396openalex-snapshot
Remarkable problem-solving ability of unicellular amoeboid organism and its mechanism
inferred← citeshttps://doi.org/10.1109/50.233259openalex-snapshot
Lightnets: topologies for high-speed optical networks
inferred← citeshttps://doi.org/10.1109/ccgrid.2015.88openalex-snapshot
Spy: A QoS-Aware Anonymous Multi-Cloud Storage System Supporting DSSE
inferred← citeshttps://doi.org/10.1109/cec.1999.782656openalex-snapshot
Hamiltonian(t)-an ant-inspired heuristic for recognizing Hamiltonian graphs
inferred← citeshttps://doi.org/10.1109/focs54457.2022.00091openalex-snapshot
Solving the Hamilton cycle problem fast on average
inferred← citeshttps://doi.org/10.1109/iccda.2010.5540768openalex-snapshot
A polynomial time algorithm for Hamilton Cycle and its proof
inferred← citeshttps://doi.org/10.1109/infcom.1990.91352openalex-snapshot
Lightnet: lightpath based solutions for wide bandwidth WANs
inferred← citeshttps://doi.org/10.1109/ipdps54959.2023.00082openalex-snapshot
An Adaptive Hybrid Quantum Algorithm for the Metric Traveling Salesman Problem
inferred← citeshttps://doi.org/10.1109/tits.2025.3544252openalex-snapshot
Finding the Maximum Density Path Within Constrained Length in a Graph
inferred← citeshttps://doi.org/10.1137/0216068openalex-snapshot
On the Exact Solution of Random Travelling Salesman Problems with Medium Size Integer Coefficients
inferred← citeshttps://doi.org/10.1137/0222059openalex-snapshot
Randomizing Reductions of Search Problems
inferred← citeshttps://doi.org/10.1137/09076619xopenalex-snapshot
Finding, Minimizing, and Counting Weighted Subgraphs
inferred← citeshttps://doi.org/10.1137/1.9781611977554.ch88openalex-snapshot
Fast algorithms for solving the Hamilton Cycle problem with high probability
inferred← citeshttps://doi.org/10.1137/22m1483414openalex-snapshot
A 3/2-Approximation for the Metric Many-Visits Path TSP
inferred← citeshttps://doi.org/10.1137/s0097539791224030openalex-snapshot
The Random Adversary: A Lower-Bound Technique for Randomized Parallel Algorithms
inferred← citeshttps://doi.org/10.1137/s0097539792232070openalex-snapshot
Matrix Transformation Is Complete for the Average Case
inferred← citeshttps://doi.org/10.1137/s0097539797332263openalex-snapshot
Distributional Word Problem for Groups
inferred← citeshttps://doi.org/10.1142/s0129054114500051openalex-snapshot
APPROXIMATING ASYMMETRIC TSP IN EXPONENTIAL TIME
inferred← citeshttps://doi.org/10.1145/103418.103442openalex-snapshot
Finding hidden Hamiltonian cycles
inferred← citeshttps://doi.org/10.1145/1536414.1536477openalex-snapshot
Finding, minimizing, and counting weighted subgraphs
inferred← citeshttps://doi.org/10.1145/165231.165260openalex-snapshot
Optimal parallel construction of Hamiltonian cycles and spanning trees in random graphs
inferred← citeshttps://doi.org/10.1145/1806689.1806735openalex-snapshot
Saving space by algebraization
inferred← citeshttps://doi.org/10.1145/225058.225153openalex-snapshot
Average-case completeness of a word problem for groups
inferred← citeshttps://doi.org/10.1145/2390176.2390188openalex-snapshot
On exact algorithms for treewidth
inferred← citeshttps://doi.org/10.1145/3357713.3384264openalex-snapshot
Bipartite TSP in o(1.9999ⁿ) time, assuming quadratic time matrix multiplication
inferred← citeshttps://doi.org/10.1145/3382038openalex-snapshot
Time- and Space-optimal Algorithm for the Many-visits TSP
inferred← citeshttps://doi.org/10.1145/3406325.3451065openalex-snapshot
Average-case hardness of NP from exponential worst-case hardness assumptions
inferred← citeshttps://doi.org/10.1145/3564246.3585163openalex-snapshot
Algorithmic Applications of Hypergraph and Partition Containers
inferred← citeshttps://doi.org/10.1145/3701551.3703531openalex-snapshot
Sequential Diversification with Provable Guarantees
inferred← citeshttps://doi.org/10.1145/62212.62231openalex-snapshot
Random instances of a graph coloring problem are hard
inferred← citeshttps://doi.org/10.1155/2012/475087openalex-snapshot
Hamiltonian Paths in Some Classes of Grid Graphs
inferred← citeshttps://doi.org/10.1177/1548512919869567openalex-snapshot
Complexity and mission computability of adaptive computing systems
inferred← citeshttps://doi.org/10.1186/s42400-024-00334-5openalex-snapshot
An efficient video slice encryption scheme and its application
inferred← citeshttps://doi.org/10.1215/ijm/1299679745openalex-snapshot
Sublinear time algorithms in the theory of groups and semigroups
inferred← citeshttps://doi.org/10.1287/moor.21.1.65openalex-snapshot
Two Algorithmic Results for the Traveling Salesman Problem
inferred← citeshttps://doi.org/10.14419/ijamr.v3i2.2409openalex-snapshot
On the Number of Paths of Lengths 3 and 4 in a Graph
inferred← citeshttps://doi.org/10.14419/ijamr.v4i1.3874openalex-snapshot
On the number of paths of length 5 in a graph
inferred← citeshttps://doi.org/10.14419/ijamr.v4i2.4314openalex-snapshot
On the number of paths of length 6 in a graph
inferred← citeshttps://doi.org/10.15587/1729-4061.2015.56247openalex-snapshot
Monitoring distributed computing systems on the basis of the determined shortest paths and shortest hamiltonian cycles in a graph
inferred← citeshttps://doi.org/10.1587/transinf.2017fcl0003openalex-snapshot
Polynomial-Space Exact Algorithms for the Bipartite Traveling Salesman Problem
inferred← citeshttps://doi.org/10.2197/ipsjjip.25.639openalex-snapshot
An Improved-time Polynomial-space Exact Algorithm for TSP in Degree-5 Graphs
inferred← citeshttps://doi.org/10.35848/1347-4065/ab8e05openalex-snapshot
Amoeba-inspired combinatorial optimization machines
inferred← citeshttps://doi.org/10.48550/arxiv.0707.1364openalex-snapshot
Report on Generic Case Complexity
inferred← citeshttps://doi.org/10.48550/arxiv.0810.4934openalex-snapshot
Exponential-Time Approximation of Hard Problems
inferred← citeshttps://doi.org/10.48550/arxiv.0904.3093openalex-snapshot
Counting Paths and Packings in Halves
inferred← citeshttps://doi.org/10.48550/arxiv.1205.2620openalex-snapshot
Exact Structure Discovery in Bayesian Networks with Less Space
inferred← citeshttps://doi.org/10.48550/arxiv.1405.6272openalex-snapshot
On the Number of cycles in a Graph
inferred← citeshttps://doi.org/10.48550/arxiv.1712.02103openalex-snapshot
Exact Algorithms With Worst-case Guarantee For Scheduling: From Theory to Practice
inferred← citeshttps://doi.org/10.48550/arxiv.1901.07139openalex-snapshot
Hamilton Cycles in Random Graphs: a bibliography
inferred← citeshttps://doi.org/10.48550/arxiv.1905.11472openalex-snapshot
End-to-End Pore Extraction and Matching in Latent Fingerprints: Going Beyond Minutiae
inferred← citeshttps://doi.org/10.48550/arxiv.2012.02551openalex-snapshot
An O(n) time algorithm for finding Hamilton cycles with high probability
inferred← citeshttps://doi.org/10.48550/arxiv.2102.12094openalex-snapshot
Combinatorial Pure Exploration with Bottleneck Reward Function
inferred← citeshttps://doi.org/10.48550/arxiv.2111.14771openalex-snapshot
A fast algorithm on average for solving the Hamilton Cycle problem
inferred← citeshttps://doi.org/10.5555/313852.313890openalex-snapshot
Randomized robot navigation algorithms
inferred← citeshttps://doi.org/10.70675/5c06befez50c1z4e4cz80dbz8c349730db63openalex-snapshot
Opportunistic data collection and routing in segmented wireless sensor networks
inferred← citeshttps://doi.org/10.70675/a477cda1z1f32z481ezbe0fzcadc18756bf0openalex-snapshot
Lattice algorithms and lattice-based cryptography
inferred← citeshttps://doi.org/10.70675/bae70c0ez33cdz4ea5z869czbb18c0f9cb1fopenalex-snapshot
Graph-based contributions to machine-learning
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.