On the public citation graph
Arboricity and Subgraph Listing Algorithms
0 signed · 615 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.1002/net.1975.5.3.237openalex-snapshot
Bounds on Backtrack Algorithms for Listing Cycles, Paths, and Spanning Trees
inferredcites →https://doi.org/10.1002/net.3230130209openalex-snapshot
An algorithm for finding a large independent set in planar graphs
inferredcites →https://doi.org/10.1016/0020-0190(81)90041-7openalex-snapshot
The clique problem for planar graphs
inferredcites →https://doi.org/10.1016/0166-218x(83)90042-2openalex-snapshot
An approximation algorithm for the hamiltonian walk problem on maximal planar graphs
inferredcites →https://doi.org/10.1112/jlms/s1-36.1.445openalex-snapshot
Edge-Disjoint Spanning Trees of Finite Graphs
inferredcites →https://doi.org/10.1137/0206036openalex-snapshot
A New Algorithm for Generating All the Maximal Independent Sets
inferredcites →https://doi.org/10.1145/321607.321608openalex-snapshot
An Analysis of Some Graph Theoretical Cluster Techniques
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.2139/ssrn.4729167openalex-extracted
Finding Small Complete Subgraphs Efficiently
inferred← citeshttps://doi.org/10.1002/jgt.3190170314openalex-snapshot
Connectivity, graph minors, and subgraph multiplicity
inferred← citeshttps://doi.org/10.1002/rsa.20743openalex-snapshot
Arboricity and spanning‐tree packing in random graphs
inferred← citeshttps://doi.org/10.1002/sam.11224openalex-snapshot
Wedge sampling for computing clustering coefficients and triangle counts on large graphs †
inferred← citeshttps://doi.org/10.1002/widm.1393openalex-snapshot
Dynamical algorithms for data mining and machine learning over dynamic graphs
inferred← citeshttps://doi.org/10.1006/jagm.1997.0920openalex-snapshot
A Better Approximation Algorithm for Finding Planar Subgraphs
inferred← citeshttps://doi.org/10.1007/11785293_25openalex-snapshot
Simultaneous Embedding with Two Bends per Edge in Polynomial Area
inferred← citeshttps://doi.org/10.1007/11786986_24openalex-snapshot
Finding the Smallest H-Subgraph in Real Weighted Graphs and Related Problems
inferred← citeshttps://doi.org/10.1007/11940128_56openalex-snapshot
Approximation Scheme for Lowest Outdegree Orientation and Graph Density Measures
inferred← citeshttps://doi.org/10.1007/3-540-19487-8_16openalex-snapshot
A fast parallel algorithm for computing all maximal cliques in a graph and the related problems
inferred← citeshttps://doi.org/10.1007/3-540-46648-7_17openalex-snapshot
Embedding Vertices at Points: Few Bends Suffice for Planar Graphs
inferred← citeshttps://doi.org/10.1007/3-540-52292-1_25openalex-snapshot
Finding squares and rectangles in sets of points
inferred← citeshttps://doi.org/10.1007/3-540-57899-4_70openalex-snapshot
A more compact visibility representation
inferred← citeshttps://doi.org/10.1007/3-540-58218-5_8openalex-snapshot
On triangulating planar graphs under the four-connectivity constraint
inferred← citeshttps://doi.org/10.1007/3-540-60618-1_62openalex-snapshot
Finding and counting small induced subgraphs efficiently
inferred← citeshttps://doi.org/10.1007/3-540-61332-3_148openalex-snapshot
Finding large planar subgraphs and large subgraphs of a given genus
inferred← citeshttps://doi.org/10.1007/978-0-387-74759-0_634openalex-snapshot
Stable Set Problem: Branch & Cut Algorithms
inferred← citeshttps://doi.org/10.1007/978-1-4614-0857-4_5openalex-snapshot
Clique Relaxation Models in Social Network Analysis
inferred← citeshttps://doi.org/10.1007/978-1-4615-0457-3_14openalex-snapshot
Effective Graph Visualization Via Node Grouping
inferred← citeshttps://doi.org/10.1007/978-1-4757-3023-4_1openalex-snapshot
The Maximum Clique Problem
inferred← citeshttps://doi.org/10.1007/978-3-030-03599-0_3openalex-snapshot
Minimum Degree-Based Core Decomposition
inferred← citeshttps://doi.org/10.1007/978-3-030-03599-0_5openalex-snapshot
Higher-Order Structure-Based Graph Decomposition
inferred← citeshttps://doi.org/10.1007/978-3-030-11286-8_6openalex-snapshot
On Counting Triangles Through Edge Sampling in Large Dynamic Graphs
inferred← citeshttps://doi.org/10.1007/978-3-030-18576-3_38openalex-snapshot
Fast Maximal Clique Enumeration for Real-World Graphs
inferred← citeshttps://doi.org/10.1007/978-3-030-34223-4_43openalex-snapshot
Parameter-Free Structural Diversity Search
inferred← citeshttps://doi.org/10.1007/978-3-030-38919-2_5openalex-snapshot
A Constructive Arboricity Approximation Scheme
inferred← citeshttps://doi.org/10.1007/978-3-030-54621-2_634-1openalex-snapshot
Stable Set Problem: Branch & Cut Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-030-59003-1_4openalex-snapshot
Accelerating All 5-Vertex Subgraphs Counting Using GPUs
inferred← citeshttps://doi.org/10.1007/978-3-030-68211-8_16openalex-snapshot
Overall and Delay Complexity of the CLIQUES and Bron-Kerbosch Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-030-95388-1_13openalex-snapshot
A NUMA-Aware Parallel Truss Decomposition Algorithm for Large Scale Graphs
inferred← citeshttps://doi.org/10.1007/978-3-031-01874-9openalex-snapshot
Community Search over Big Graphs
inferred← citeshttps://doi.org/10.1007/978-3-031-25158-0_38openalex-snapshot
Mining Periodic k-Clique from Real-World Sparse Temporal Networks
inferred← citeshttps://doi.org/10.1007/978-3-031-34347-6_16openalex-snapshot
Finding Small Complete Subgraphs Efficiently
inferred← citeshttps://doi.org/10.1007/978-3-032-05925-3_9openalex-snapshot
Hybrid Neuro-Symbolic Learning Agents: A Graph-Theoretic Approach to Interpretable Reinforcement Learning
inferred← citeshttps://doi.org/10.1007/978-3-032-22196-4_14openalex-snapshot
CPU-Based Parallelization of BDAC: Enhancing K-Clique Approximation
inferred← citeshttps://doi.org/10.1007/978-3-319-00372-6_7openalex-snapshot
Pattern Extraction from Graphs and Beyond
inferred← citeshttps://doi.org/10.1007/978-3-319-21840-3_39openalex-snapshot
Dynamic Set Intersection
inferred← citeshttps://doi.org/10.1007/978-3-319-28361-6_1openalex-snapshot
Quad Census Computation: Simple, Efficient, and Orbit-Aware
inferred← citeshttps://doi.org/10.1007/978-3-319-30139-6_16openalex-snapshot
Counting Subgraphs in Relational Event Graphs
inferred← citeshttps://doi.org/10.1007/978-3-319-32049-6_16openalex-snapshot
Parallelizing Maximal Clique Enumeration Over Graph Data
inferred← citeshttps://doi.org/10.1007/978-3-319-38898-4_16openalex-snapshot
On the Application of Clique Problem for Proof-of-Work in Cryptocurrencies
inferred← citeshttps://doi.org/10.1007/978-3-319-53007-9_6openalex-snapshot
Positional Dominance: Concepts and Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-319-53007-9_8openalex-snapshot
Querying Relational Event Graphs Using Colored Range Searching Data Structures
inferred← citeshttps://doi.org/10.1007/978-3-319-63579-8_27openalex-snapshot
Counting Edges and Triangles in Online Social Networks via Random Walk
inferred← citeshttps://doi.org/10.1007/978-3-319-67428-5_13openalex-snapshot
Listing Maximal Independent Sets with Minimal Space and Bounded Delay
inferred← citeshttps://doi.org/10.1007/978-3-319-71249-9_37openalex-snapshot
K-Clique-Graphs for Dense Subgraph Discovery
inferred← citeshttps://doi.org/10.1007/978-3-319-94418-0_19openalex-snapshot
Kernelization Lower Bounds for Finding Constant-Size Subgraphs
inferred← citeshttps://doi.org/10.1007/978-3-540-24595-7_1openalex-snapshot
Confluent Drawings: Visualizing Non-planar Diagrams in a Planar Way
inferred← citeshttps://doi.org/10.1007/978-3-540-27798-9_19openalex-snapshot
The Worst-Case Time Complexity for Generating All Maximal Cliques
inferred← citeshttps://doi.org/10.1007/978-3-540-27810-8_23openalex-snapshot
New Algorithms for Enumerating All Maximal Cliques
inferred← citeshttps://doi.org/10.1007/978-3-540-31843-9_21openalex-snapshot
Simultaneous Embedding of Planar Graphs with Few Bends
inferred← citeshttps://doi.org/10.1007/978-3-540-39890-5_17openalex-snapshot
Drawing Planar Graphs on a Curve
inferred← citeshttps://doi.org/10.1007/978-3-540-39890-5_25openalex-snapshot
Short Cycles in Planar Graphs
inferred← citeshttps://doi.org/10.1007/978-3-540-70904-6_39openalex-snapshot
Biclique Edge Cover Graphs and Confluent Drawings
inferred← citeshttps://doi.org/10.1007/978-3-642-03367-4_25openalex-snapshot
The h-Index of a Graph and Its Application to Dynamic Subgraph Statistics
inferred← citeshttps://doi.org/10.1007/978-3-642-11440-3_4openalex-snapshot
The Hamiltonian Augmentation Problem and Its Applications to Graph Drawing
inferred← citeshttps://doi.org/10.1007/978-3-642-17458-2_12openalex-snapshot
Extended Dynamic Subgraph Statistics Using h-Index Parameterized Data Structures
inferred← citeshttps://doi.org/10.1007/978-3-642-17517-6_36openalex-snapshot
Listing All Maximal Cliques in Sparse Graphs in Near-Optimal Time
inferred← citeshttps://doi.org/10.1007/978-3-642-18469-7_31openalex-snapshot
Confluent Drawing Algorithms Using Rectangular Dualization
inferred← citeshttps://doi.org/10.1007/978-3-642-20662-7_31openalex-snapshot
Listing All Maximal Cliques in Large Sparse Real-World Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-21254-3_26openalex-snapshot
Unique Small Subgraphs Are Not Easier to Find
inferred← citeshttps://doi.org/10.1007/978-3-642-22339-6_29openalex-snapshot
Maximal Cliques Generating Algorithm for Spatial Co-location Pattern Mining
inferred← citeshttps://doi.org/10.1007/978-3-642-33651-5_14openalex-snapshot
“Tri, Tri Again”: Finding Triangles and Small Subgraphs in a Distributed Setting
inferred← citeshttps://doi.org/10.1007/978-3-642-36763-2_25openalex-snapshot
Kinetic and Stationary Point-Set Embeddability for Plane Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-37444-9_10openalex-snapshot
Maximal Cliques Based Rigid Body Motion Segmentation with a RGB-D Camera
inferred← citeshttps://doi.org/10.1007/978-3-642-41660-6_17openalex-snapshot
Bounds and Algorithms for Joins via Fractional Edge Covers
inferred← citeshttps://doi.org/10.1007/978-3-662-48350-3_22openalex-snapshot
Fast Quasi-Threshold Editing
inferred← citeshttps://doi.org/10.1007/978-3-662-55751-8_28openalex-snapshot
Listing All Fixed-Length Simple Cycles in Sparse Graphs in Optimal Time
inferred← citeshttps://doi.org/10.1007/978-3-662-55751-8_9openalex-snapshot
Parameterized Aspects of Triangle Enumeration
inferred← citeshttps://doi.org/10.1007/978-81-322-2301-6_5openalex-snapshot
Proto-Fuzzy Concepts Generation Technique Using Fuzzy Graph
inferred← citeshttps://doi.org/10.1007/978-981-15-3928-2_4openalex-snapshot
Efficient Parallel Subgraph Enumeration
inferred← citeshttps://doi.org/10.1007/978-981-19-4549-6_20openalex-snapshot
Federated Clique Percolation for Overlapping Community Detection on Attributed Networks
inferred← citeshttps://doi.org/10.1007/978-981-97-2390-4_26openalex-snapshot
SSCAN:Structural Graph Clustering on Signed Networks
inferred← citeshttps://doi.org/10.1007/bf00055801openalex-snapshot
Locating human faces in photographs
inferred← citeshttps://doi.org/10.1007/bf01758774openalex-snapshot
Forests, frames, and games: Algorithms for matroid sums and applications
inferred← citeshttps://doi.org/10.1007/bf01840403openalex-snapshot
Efficient parallel and sequential algorithms for 4-coloring perfect planar graphs
inferred← citeshttps://doi.org/10.1007/bf01931281openalex-snapshot
Finding squares and rectangles in sets of points
inferred← citeshttps://doi.org/10.1007/bf02523189openalex-snapshot
Finding and counting given length cycles
inferred← citeshttps://doi.org/10.1007/bf02946522openalex-snapshot
An efficient parallel graph edge matching algorithm and its applications
inferred← citeshttps://doi.org/10.1007/bfb0023836openalex-snapshot
A distributed algorithm for finding all maximal cliques in a network graph
inferred← citeshttps://doi.org/10.1007/bfb0049422openalex-snapshot
Finding and counting given length cycles
inferred← citeshttps://doi.org/10.1007/pl00009182openalex-snapshot
On Triangulating Planar Graphs under the Four-Connectivity Constraint
inferred← citeshttps://doi.org/10.1007/pl00009320openalex-snapshot
A Large Subgraph of the Minimum Weight Triangulation
inferred← citeshttps://doi.org/10.1007/s00446-021-00409-3openalex-snapshot
Sublinear-time distributed algorithms for detecting small cliques and even cycles
inferred← citeshttps://doi.org/10.1007/s00453-005-1184-8openalex-snapshot
Recognizing Hole-Free 4-Map Graphs in Cubic Time
inferred← citeshttps://doi.org/10.1007/s00453-008-9200-4openalex-snapshot
Computing median and antimedian sets in median graphs
inferred← citeshttps://doi.org/10.1007/s00453-012-9632-8openalex-snapshot
Fast Maximal Cliques Enumeration in Sparse Graphs
inferred← citeshttps://doi.org/10.1007/s00453-017-0402-5openalex-snapshot
An Improved Upper Bound on Maximal Clique Listing via Rectangular Fast Matrix Multiplication
inferred← citeshttps://doi.org/10.1007/s00453-018-0510-xopenalex-snapshot
Characterizing and Recognizing 4-Map Graphs
inferred← citeshttps://doi.org/10.1007/s00453-019-00656-8openalex-snapshot
Sublinear-Space and Bounded-Delay Algorithms for Maximal Clique Enumeration in Graphs
inferred← citeshttps://doi.org/10.1007/s00453-021-00811-0openalex-snapshot
Faster algorithms for counting subgraphs in sparse graphs
inferred← citeshttps://doi.org/10.1007/s00453-021-00851-6openalex-snapshot
A Comparative Study of Dictionary Matching with Gaps: Limitations, Techniques and Challenges
inferred← citeshttps://doi.org/10.1007/s00453-022-01090-zopenalex-snapshot
Computing Dense and Sparse Subgraphs of Weakly Closed Graphs
inferred← citeshttps://doi.org/10.1007/s00454-001-0045-8openalex-snapshot
Approximation for Minimum Triangulations of Simplicial Convex 3-Polytopes
inferred← citeshttps://doi.org/10.1007/s00454-017-9939-yopenalex-snapshot
Embedding-Preserving Rectangle Visibility Representations of Nonplanar Graphs
inferred← citeshttps://doi.org/10.1007/s00454-022-00430-8openalex-snapshot
An Efficient Algorithm for 1-Dimensional (Persistent) Path Homology
inferred← citeshttps://doi.org/10.1007/s00778-015-0379-0openalex-snapshot
Top-K structural diversity search in large networks
inferred← citeshttps://doi.org/10.1007/s00778-017-0459-4openalex-snapshot
Scalable subgraph enumeration in MapReduce: a cost-oriented approach
inferred← citeshttps://doi.org/10.1007/s00778-017-0467-4openalex-snapshot
Finding influential communities in massive networks
inferred← citeshttps://doi.org/10.1007/s00778-019-00540-5openalex-snapshot
Incremental maintenance of maximal cliques in a dynamic graph
inferred← citeshttps://doi.org/10.1007/s00778-019-00541-4openalex-snapshot
Efficient structural graph clustering: an index-based approach
inferred← citeshttps://doi.org/10.1007/s00778-019-00556-xopenalex-snapshot
A survey of community search over big graphs
inferred← citeshttps://doi.org/10.1007/s00778-020-00602-zopenalex-snapshot
Efficient maximum clique computation and enumeration over large sparse graphs
inferred← citeshttps://doi.org/10.1007/s00778-020-00649-yopenalex-snapshot
I/O efficient k-truss community search in massive graphs
inferred← citeshttps://doi.org/10.1007/s00778-022-00746-0openalex-snapshot
Accelerated butterfly counting with vertex priority on bipartite graphs
inferred← citeshttps://doi.org/10.1007/s00778-023-00786-0openalex-snapshot
(p,q)-biclique counting and enumeration for large sparse bipartite graphs
inferred← citeshttps://doi.org/10.1007/s00778-024-00856-xopenalex-snapshot
Parallelization of butterfly counting on hierarchical memory
inferred← citeshttps://doi.org/10.1007/s00778-024-00890-9openalex-snapshot
Estimating simplet counts via sampling
inferred← citeshttps://doi.org/10.1007/s00778-026-00966-8openalex-snapshot
DIST: Efficient k-Clique Listing via Induced Subgraph Trie
inferred← citeshttps://doi.org/10.1007/s10115-025-02397-3openalex-snapshot
Correlation clustering algorithm for dynamic complete signed graphs: an index-based approach
inferred← citeshttps://doi.org/10.1007/s10618-016-0451-4openalex-snapshot
An efficient exact algorithm for triangle listing in large graphs
inferred← citeshttps://doi.org/10.1007/s10878-006-9625-0openalex-snapshot
Polynomially solvable cases of the constant rank unconstrained quadratic 0-1 programming problem
inferred← citeshttps://doi.org/10.1007/s10878-015-9972-9openalex-snapshot
Maximum cardinality neighbourly sets in quadrilateral free graphs
inferred← citeshttps://doi.org/10.1007/s10878-024-01204-zopenalex-snapshot
Efficient branch-and-bound algorithms for finding triangle-constrained 2-clubs
inferred← citeshttps://doi.org/10.1007/s11227-019-02770-4openalex-snapshot
Listing all maximal cliques in large graphs on vertex-centric model
inferred← citeshttps://doi.org/10.1007/s11280-020-00843-6openalex-snapshot
Parallel algorithms for parameter-free structural diversity search on graphs
inferred← citeshttps://doi.org/10.1007/s11390-019-1944-6openalex-snapshot
Diversifying Top-k Routes with Spatial Constraints
inferred← citeshttps://doi.org/10.1007/s11590-023-02001-zopenalex-snapshot
On linear algebraic algorithms for the subgraph matching problem and its variants
inferred← citeshttps://doi.org/10.1007/s11786-013-0156-7openalex-snapshot
Partial Star Products: A Local Covering Approach for the Recognition of Approximate Cartesian Product Graphs
inferred← citeshttps://doi.org/10.1007/s13226-025-00893-4openalex-snapshot
A survey on the boxicity and cubicity of graphs
inferred← citeshttps://doi.org/10.1007/s13278-016-0332-2openalex-snapshot
Structure-preserving sparsification methods for social networks
inferred← citeshttps://doi.org/10.1007/s13278-021-00846-9openalex-snapshot
Learning network embeddings using small graphlets
inferred← citeshttps://doi.org/10.1007/s41019-017-0033-5openalex-snapshot
Efficient Maximal Clique Enumeration Over Graph Data
inferred← citeshttps://doi.org/10.1007/s41019-025-00338-2openalex-snapshot
Enumerating Cliques on k-Partite Graphs
inferred← citeshttps://doi.org/10.1007/s41060-017-0074-xopenalex-snapshot
Data-driven analysis of Bitcoin properties: exploiting the users graph
inferred← citeshttps://doi.org/10.1007/s41109-017-0027-2openalex-snapshot
Efficient orbit-aware triad and quad census in directed and undirected graphs
inferred← citeshttps://doi.org/10.1007/s42979-026-05250-8openalex-snapshot
K-Core Neighborhood Density: Mixing Local and Global Features for Influential Node Detection
inferred← citeshttps://doi.org/10.1016/0020-0190(90)90142-kopenalex-snapshot
Connectivity of plane triangulations
inferred← citeshttps://doi.org/10.1016/0020-0190(94)90121-xopenalex-snapshot
Arboricity and bipartite subgraph listing algorithms
inferred← citeshttps://doi.org/10.1016/0020-0190(95)00027-aopenalex-snapshot
Computing a perfect edge without vertex elimination ordering of a chordal bipartite graph
inferred← citeshttps://doi.org/10.1016/0095-8956(91)90100-xopenalex-snapshot
On the thickness and arboricity of a graph
inferred← citeshttps://doi.org/10.1016/0196-6774(86)90029-5openalex-snapshot
Finding short cycles in planar graphs using separators
inferred← citeshttps://doi.org/10.1016/0196-6774(91)90021-popenalex-snapshot
An improved algorithm for the planar 3-cut problem
inferred← citeshttps://doi.org/10.1016/0196-6774(92)90012-2openalex-snapshot
Generation of maximum independent sets of a bipartite graph and maximum cliques of a circular-arc graph
inferred← citeshttps://doi.org/10.1016/0304-3975(91)90020-3openalex-snapshot
Planar orientations with low out-degree and compaction of adjacency matrices
inferred← citeshttps://doi.org/10.1016/b978-0-08-097086-8.43121-1openalex-snapshot
Social Network Algorithms and Software
inferred← citeshttps://doi.org/10.1016/j.comgeo.2004.04.002openalex-snapshot
Curve-constrained drawings of planar graphs
inferred← citeshttps://doi.org/10.1016/j.comgeo.2005.03.001openalex-snapshot
Approximating the minimum triangulation of convex 3-polytopes with bounded degrees
inferred← citeshttps://doi.org/10.1016/j.comgeo.2008.09.002openalex-snapshot
Octagonal drawings of plane graphs with prescribed face areas
inferred← citeshttps://doi.org/10.1016/j.comgeo.2017.06.001openalex-snapshot
Arc diagrams, flip distances, and Hamiltonian triangulations
inferred← citeshttps://doi.org/10.1016/j.comgeo.2026.102255openalex-snapshot
Optimal right angles crossing graphs
inferred← citeshttps://doi.org/10.1016/j.cor.2017.12.006openalex-snapshot
Efficiently enumerating all maximal cliques with bit-parallelism
inferred← citeshttps://doi.org/10.1016/j.dam.2015.06.019openalex-snapshot
The challenges of unbounded treewidth in parameterised subgraph counting problems
inferred← citeshttps://doi.org/10.1016/j.dam.2018.03.032openalex-snapshot
On the General Randić index of polymeric networks modelled by generalized Sierpiński graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2018.03.046openalex-snapshot
Homothetic polygons and beyond: Maximal cliques in intersection graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2019.03.006openalex-snapshot
Querying relational event graphs using colored range searching data structures
inferred← citeshttps://doi.org/10.1016/j.dam.2023.01.006openalex-snapshot
On the generalized Helly property of hypergraphs, cliques, and bicliques
inferred← citeshttps://doi.org/10.1016/j.disc.2006.07.011openalex-snapshot
Fast recognition of classes of almost-median graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2006.07.027openalex-snapshot
Triangulated neighborhoods in even-hole-free graphs
inferred← citeshttps://doi.org/10.1016/j.ejc.2022.103654openalex-snapshot
Counting cliques in 1-planar graphs
inferred← citeshttps://doi.org/10.1016/j.ic.2020.104633openalex-snapshot
Online recognition of dictionary with one gap
inferred← citeshttps://doi.org/10.1016/j.ins.2015.12.006openalex-snapshot
iTri: Index-based triangle listing in massive graphs
inferred← citeshttps://doi.org/10.1016/j.ins.2018.02.018openalex-snapshot
Summarized bit batch-based triangle listing in massive graphs
inferred← citeshttps://doi.org/10.1016/j.ins.2018.07.018openalex-snapshot
Counting cliques in parallel without a cluster: Engineering a fork/join algorithm for shared-memory platforms
inferred← citeshttps://doi.org/10.1016/j.ins.2024.121067openalex-snapshot
Identifying vital nodes through augmented random walks on higher-order networks
inferred← citeshttps://doi.org/10.1016/j.ins.2024.121766openalex-snapshot
Structural graph clustering on signed graphs: An index-based approach
inferred← citeshttps://doi.org/10.1016/j.ins.2025.122454openalex-snapshot
Efficient algorithms for parameter-free edge structural diversity search on graphs
inferred← citeshttps://doi.org/10.1016/j.ipl.2015.04.003openalex-snapshot
Approximation algorithms for clique transversals on some graph classes
inferred← citeshttps://doi.org/10.1016/j.ipl.2018.02.010openalex-snapshot
Are unique subgraphs not easier to find?
inferred← citeshttps://doi.org/10.1016/j.jcss.2019.02.004openalex-snapshot
Parameterized aspects of triangle enumeration
inferred← citeshttps://doi.org/10.1016/j.jcss.2019.05.004openalex-snapshot
Structural sparsity of complex networks: Bounded expansion in random models and real-world graphs
inferred← citeshttps://doi.org/10.1016/j.jcss.2025.103693openalex-snapshot
Join and subgraph sampling under degree constraints
inferred← citeshttps://doi.org/10.1016/j.jfranklin.2024.107404openalex-snapshot
Generic network sparsification via hybrid edge sampling
inferred← citeshttps://doi.org/10.1016/j.jpdc.2009.01.003openalex-snapshot
A scalable, parallel algorithm for maximal clique enumeration
inferred← citeshttps://doi.org/10.1016/j.jpdc.2014.08.011openalex-snapshot
Mining maximal cliques from a large graph using MapReduce: Tackling highly uneven subproblem sizes
inferred← citeshttps://doi.org/10.1016/j.jpdc.2017.03.003openalex-snapshot
Parallelizing maximal clique and k-plex enumeration over graph data
inferred← citeshttps://doi.org/10.1016/j.knosys.2024.111961openalex-snapshot
Maximal size constraint community search over bipartite graphs
inferred← citeshttps://doi.org/10.1016/j.laa.2025.09.003openalex-snapshot
On the incidence matrix of a graph with matrix weights
inferred← citeshttps://doi.org/10.1016/j.neucom.2020.08.088openalex-snapshot
Effective influential community search on attributed graph
inferred← citeshttps://doi.org/10.1016/j.parco.2019.05.005openalex-snapshot
A memory efficient maximal clique enumeration method for sparse graphs with a parallel implementation
inferred← citeshttps://doi.org/10.1016/j.procs.2026.06.180openalex-snapshot
DCISCSVR: Utilizing Regression to Identify Influential Nodes
inferred← citeshttps://doi.org/10.1016/j.tcs.2006.06.015openalex-snapshot
The worst-case time complexity for generating all maximal cliques and computational experiments
inferred← citeshttps://doi.org/10.1016/j.tcs.2006.10.035openalex-snapshot
New applications of clique separator decomposition for the Maximum Weight Stable Set problem
inferred← citeshttps://doi.org/10.1016/j.tcs.2008.07.017openalex-snapshot
Main-memory triangle computations for very large (sparse (power-law)) graphs
inferred← citeshttps://doi.org/10.1016/j.tcs.2010.03.011openalex-snapshot
Theoretical underpinnings for maximal clique enumeration on perturbed graphs
inferred← citeshttps://doi.org/10.1016/j.tcs.2011.11.034openalex-snapshot
Extended dynamic subgraph statistics using h -index parameterized data structures
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.2018.10.014openalex-snapshot
A new decomposition technique for maximal clique enumeration for sparse graphs
inferred← citeshttps://doi.org/10.1016/j.tcs.2018.12.010openalex-snapshot
Map graphs having witnesses of large girth
inferred← citeshttps://doi.org/10.1016/j.tcs.2020.09.016openalex-snapshot
Online parameterized dictionary matching with one gap
inferred← citeshttps://doi.org/10.1016/j.tcs.2021.11.005openalex-snapshot
On the overall and delay complexity of the CLIQUES and Bron-Kerbosch algorithms
inferred← citeshttps://doi.org/10.1016/j.tcs.2024.114911openalex-snapshot
Finding and counting small tournaments in large tournaments
inferred← citeshttps://doi.org/10.1016/j.tcs.2025.115278openalex-snapshot
Maximum core spanning tree maintenance for large dynamic graphs
inferred← citeshttps://doi.org/10.1016/j.tcs.2025.115530openalex-snapshot
Computing eternal vertex cover number of maximal outerplanar graphs in linear time
inferred← citeshttps://doi.org/10.1016/s0020-0190(00)00047-8openalex-snapshot
Finding and counting small induced subgraphs efficiently
inferred← citeshttps://doi.org/10.1016/s0166-218x(02)00416-xopenalex-snapshot
Fast recognition algorithms for classes of partial cubes
inferred← citeshttps://doi.org/10.1016/s0167-5060(08)70395-9openalex-snapshot
Matching and Vertex Packing: How “hard” are They?
inferred← citeshttps://doi.org/10.1016/s0304-3975(95)00257-xopenalex-snapshot
Regular edge labeling of 4-connected plane graphs and its applications in graph drawing problems
showing the first 200 of 606 · page through all 606
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.