On the public citation graph

Recent Advances in Algorithms and Combinatorics

0 signed · 91 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.1002/jgt.21772openalex-snapshot
The Images of the Clique Operator and Its Square are Different
inferred← citeshttps://doi.org/10.1002/jgt.22544openalex-snapshot
On clique‐inverse graphs of graphs with bounded clique number
inferred← citeshttps://doi.org/10.1007/11775096_31openalex-snapshot
Approximation Algorithms for Minimum Span Channel Assignment Problems
inferred← citeshttps://doi.org/10.1007/978-2-287-99037-3_16openalex-snapshot
Algorithmes d’approximation
inferred← citeshttps://doi.org/10.1007/978-3-319-03780-6_35openalex-snapshot
Disclosing Barriers: A Generalization of the Canonical Partition Based on Lovász’s Formulation
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-79228-4_11openalex-snapshot
Distance Constrained Labelings of Trees
inferred← citeshttps://doi.org/10.1007/978-3-540-88009-7_4openalex-snapshot
Learning Languages from Bounded Resources: The Case of the DFA and the Balls of Strings
inferred← citeshttps://doi.org/10.1007/978-3-662-57691-5_16openalex-snapshot
Approximationsalgorithmen
inferred← citeshttps://doi.org/10.1007/s00453-007-9147-xopenalex-snapshot
Improved Algorithms and Complexity Results for Power Domination in Graphs
inferred← citeshttps://doi.org/10.1007/s10107-005-0651-yopenalex-snapshot
On Balanced Graphs
inferred← citeshttps://doi.org/10.1007/s10587-015-0180-7openalex-snapshot
On a characterization of k-trees
inferred← citeshttps://doi.org/10.1007/s11032-009-9348-xopenalex-snapshot
Detection of somaclonal variation during cocoa somatic embryogenesis characterised using cleaved amplified polymorphic sequence and the new freeware Artbio
inferred← citeshttps://doi.org/10.1007/s13173-011-0054-2openalex-snapshot
Contributions of Jayme Luiz Szwarcfiter to graph theory and computer science
inferred← citeshttps://doi.org/10.1016/j.aim.2011.01.004openalex-snapshot
Sparse partition universal graphs for graphs of bounded degree
inferred← citeshttps://doi.org/10.1016/j.aim.2011.07.014openalex-snapshot
Convex hulls of curves of genus one
inferred← citeshttps://doi.org/10.1016/j.aim.2013.12.004openalex-snapshot
Extremal results in sparse pseudorandom graphs
inferred← citeshttps://doi.org/10.1016/j.akcej.2016.07.002openalex-snapshot
On clique convergence of graphs
inferred← citeshttps://doi.org/10.1016/j.artint.2015.10.002openalex-snapshot
Automated conjecturing I: Fajtlowicz's Dalmatian heuristic revisited
inferred← citeshttps://doi.org/10.1016/j.bica.2017.02.002openalex-snapshot
Columnar-Organized Memory (COM): Brain-inspired associative memory with large capacity and robust retrieval
inferred← citeshttps://doi.org/10.1016/j.comgeo.2006.08.002openalex-snapshot
Graph drawings with few slopes
inferred← citeshttps://doi.org/10.1016/j.compfluid.2013.01.025openalex-snapshot
The independent set perturbation method for efficient computation of sensitivities with applications to data assimilation and a finite element shallow water model
inferred← citeshttps://doi.org/10.1016/j.dam.2007.07.021openalex-snapshot
Unification of lower-bound analyses of the lift-and-project rank of combinatorial optimization polyhedra
inferred← citeshttps://doi.org/10.1016/j.dam.2009.01.019openalex-snapshot
The clique operator on circular-arc graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2009.02.021openalex-snapshot
The bivariate Ising polynomial of a graph
inferred← citeshttps://doi.org/10.1016/j.dam.2010.12.014openalex-snapshot
The P versus NP–complete dichotomy of some challenging problems in graph theory
inferred← citeshttps://doi.org/10.1016/j.dam.2011.10.024openalex-snapshot
Maximal independent sets in caterpillar graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2013.02.003openalex-snapshot
Edge contraction and edge removal on iterated clique graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2013.08.005openalex-snapshot
Lower bounds for treewidth of product graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2015.02.006openalex-snapshot
On the termination of some biclique operators on multipartite graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2016.06.017openalex-snapshot
On the hyperbolicity of bipartite graphs and intersection graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2018.06.040openalex-snapshot
Bipartite Ramsey numbers of paths for random graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2019.02.015openalex-snapshot
On bicliques and the second clique graph of suspensions
inferred← citeshttps://doi.org/10.1016/j.dam.2021.12.028openalex-snapshot
Biclique graphs of split graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2023.11.040openalex-snapshot
Diclique digraphs
inferred← citeshttps://doi.org/10.1016/j.dam.2023.12.024openalex-snapshot
Random bipartite Ramsey numbers of long cycles
inferred← citeshttps://doi.org/10.1016/j.disc.2007.12.047openalex-snapshot
The clique operator on matching and chessboard graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2008.06.029openalex-snapshot
Perfectness and imperfectness of unit disk graphs on triangular lattice points
inferred← citeshttps://doi.org/10.1016/j.disc.2008.07.032openalex-snapshot
Cube intersection concepts in median graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2012.11.017openalex-snapshot
Iterated clique graphs and bordered compact surfaces
inferred← citeshttps://doi.org/10.1016/j.disc.2015.08.018openalex-snapshot
On self-clique graphs with triangular cliques
inferred← citeshttps://doi.org/10.1016/j.disc.2017.07.007openalex-snapshot
On strong graph bundles
inferred← citeshttps://doi.org/10.1016/j.ejc.2008.05.005openalex-snapshot
On expansive graphs
inferred← citeshttps://doi.org/10.1016/j.ejc.2008.11.010openalex-snapshot
On tree-partition-width
inferred← citeshttps://doi.org/10.1016/j.ejc.2014.02.004openalex-snapshot
On an anti-Ramsey threshold for random graphs
inferred← citeshttps://doi.org/10.1016/j.ejc.2017.04.007openalex-snapshot
Counting results for sparse pseudorandom hypergraphs II
inferred← citeshttps://doi.org/10.1016/j.ejc.2017.04.008openalex-snapshot
Counting results for sparse pseudorandom hypergraphs I
inferred← citeshttps://doi.org/10.1016/j.ejc.2017.05.010openalex-snapshot
The k -strong induced arboricity of a graph
inferred← citeshttps://doi.org/10.1016/j.ejc.2023.103832openalex-snapshot
Some snarks are worse than others
inferred← citeshttps://doi.org/10.1016/j.ejor.2007.02.014openalex-snapshot
Complexity and exact algorithms for vertex multicut in interval and bounded treewidth graphs
inferred← citeshttps://doi.org/10.1016/j.endm.2004.06.022openalex-snapshot
On Clique-inverse graphs of Kp-free graphs
inferred← citeshttps://doi.org/10.1016/j.endm.2008.01.002openalex-snapshot
A New Neighborhood for the QAP
inferred← citeshttps://doi.org/10.1016/j.endm.2008.01.020openalex-snapshot
On cliques of Helly Circular-arc Graphs
inferred← citeshttps://doi.org/10.1016/j.endm.2008.01.025openalex-snapshot
The Proportional Colouring Problem: Optimizing Buffers in Wireless Mesh Networks
inferred← citeshttps://doi.org/10.1016/j.endm.2008.01.049openalex-snapshot
Random Graphs, Retractions and Clique Graphs
inferred← citeshttps://doi.org/10.1016/j.endm.2009.11.055openalex-snapshot
Almost spanning subgraphs of random graphs after adversarial edge removal
inferred← citeshttps://doi.org/10.1016/j.endm.2009.11.056openalex-snapshot
On the clique behavior of circulants with three small jumps
inferred← citeshttps://doi.org/10.1016/j.endm.2011.05.041openalex-snapshot
On an anti-Ramsey property of random graphs
inferred← citeshttps://doi.org/10.1016/j.endm.2017.10.033openalex-snapshot
On cliques and bicliques
inferred← citeshttps://doi.org/10.1016/j.jcta.2006.08.004openalex-snapshot
Turán's theorem for pseudo-random graphs
inferred← citeshttps://doi.org/10.1016/j.jctb.2006.03.004openalex-snapshot
Small subsets inherit sparse ε-regularity
inferred← citeshttps://doi.org/10.1016/j.jctb.2009.05.005openalex-snapshot
Weak hypergraph regularity and linear hypergraphs
inferred← citeshttps://doi.org/10.1016/j.jctb.2011.10.003openalex-snapshot
Approximate multipartite version of the Hajnal–Szemerédi theorem
inferred← citeshttps://doi.org/10.1016/j.jctb.2022.02.009openalex-snapshot
Dirac-type theorems in random hypergraphs
inferred← citeshttps://doi.org/10.1016/j.laa.2015.08.030openalex-snapshot
On Farkas lemma and dimensional rigidity of bar frameworks
inferred← citeshttps://doi.org/10.1016/j.laa.2016.04.019openalex-snapshot
Max k-cut and the smallest eigenvalue
inferred← citeshttps://doi.org/10.1016/j.laa.2023.01.008openalex-snapshot
Approximating projections by quantum operations
inferred← citeshttps://doi.org/10.1016/j.orl.2008.09.001openalex-snapshot
Maximum algebraic connectivity augmentation is NP-hard
inferred← citeshttps://doi.org/10.1016/j.sysconle.2024.105984openalex-snapshot
Distributed state estimation for interdependent and switching multi-agent systems
inferred← citeshttps://doi.org/10.1016/j.tcs.2009.01.018openalex-snapshot
The complexity of clique graph recognition
inferred← citeshttps://doi.org/10.1016/j.tcs.2011.12.006openalex-snapshot
Arboricity, h -index, and dynamic algorithms
inferred← citeshttps://doi.org/10.1016/j.tcs.2013.07.020openalex-snapshot
Split clique graph complexity
inferred← citeshttps://doi.org/10.1016/j.tcs.2015.01.009openalex-snapshot
Termination of the iterated strong-factor operator on multipartite graphs
inferred← citeshttps://doi.org/10.1016/j.tcs.2019.09.013openalex-snapshot
The graph tessellation cover number: Chromatic bounds, efficient algorithms and hardness
inferred← citeshttps://doi.org/10.1016/s0927-0507(05)12008-8openalex-snapshot
Semidefinite Programming and Integer Programming
inferred← citeshttps://doi.org/10.1017/cbo9781139519793.016openalex-snapshot
Graph colouring algorithms
inferred← citeshttps://doi.org/10.1017/fms.2019.7openalex-snapshot
FORCING QUASIRANDOMNESS WITH TRIANGLES
inferred← citeshttps://doi.org/10.1017/s0963548310000490openalex-snapshot
Szemerédi's Regularity Lemma for Matrices and Sparse Graphs
inferred← citeshttps://doi.org/10.1017/s0963548323000457openalex-snapshot
Product structure of graph classes with bounded treewidth
inferred← citeshttps://doi.org/10.1098/rspa.2011.0621openalex-snapshot
Hedging bets with correlated quantum strategies
inferred← citeshttps://doi.org/10.1103/physreva.93.062335openalex-snapshot
Staggered quantum walks on graphs
inferred← citeshttps://doi.org/10.1103/physrevlett.128.190501openalex-snapshot
Classical Simulation of Boson Sampling Based on Graph Structure
inferred← citeshttps://doi.org/10.1134/s0965542517020038openalex-snapshot
On the linear classification of even and odd permutation matrices and the complexity of computing the permanent
inferred← citeshttps://doi.org/10.1137/22m1542854openalex-snapshot
Treewidth, Circle Graphs, and Circular Drawings
inferred← citeshttps://doi.org/10.1137/23m1591773openalex-snapshot
Product Structure Extension of the Alon–Seymour–Thomas Theorem
inferred← citeshttps://doi.org/10.1145/1060590.1060657openalex-snapshot
Towards asymptotic optimality in probabilistic packet marking
inferred← citeshttps://doi.org/10.1145/1377676.1377739openalex-snapshot
Improved upper bounds on the crossing number
inferred← citeshttps://doi.org/10.1145/1536414.1536452openalex-snapshot
Max cut and the smallest eigenvalue
inferred← citeshttps://doi.org/10.1145/3199606openalex-snapshot
Graph Reconstruction and Verification
inferred← citeshttps://doi.org/10.17771/pucrio.acad.40183openalex-snapshot
SEMIDEFINITE PROGRAMMING VIA GENERALIZED PROXIMAL POINT ALGORITHM
inferred← citeshttps://doi.org/10.4086/cjtcs.2013.008openalex-snapshot
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.