On the public citation graph
Finding a Minimum Circuit in a Graph
0 signed · 363 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/bf01894680openalex-snapshot
On chromatic number of finite set-systems
inferredcites →https://doi.org/10.1007/bf02165411openalex-snapshot
Gaussian elimination is not optimal
inferredcites →https://doi.org/10.1112/blms/1.3.431openalex-snapshot
INTRODUCTION TO COMBINATORIAL MATHEMATICS
inferredcites →https://doi.org/10.1137/0205006openalex-snapshot
New Bounds on the Complexity of the Shortest Path Problem
inferredcites →https://doi.org/10.4153/cjm-1961-029-9openalex-snapshot
Graph Theory and Probability. II
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.4016393openalex-extracted
Breaking the Hegemony of the Triangle Method in Clique Detection
inferred← citeshttps://doi.org/10.1002/net.22232openalex-snapshot
Getting linear time in graphs of bounded neighborhood diversity
inferred← citeshttps://doi.org/10.1006/jpdc.1993.1044openalex-snapshot
Determining Performance Measures of Algorithm-Based Fault Tolerant Systems
inferred← citeshttps://doi.org/10.1006/jsco.2000.0402openalex-snapshot
Decomposition Plans for Geometric Constraint Systems, Part I: Performance Measures for CAD
inferred← citeshttps://doi.org/10.1006/jsco.2000.0403openalex-snapshot
Decomposition Plans for Geometric Constraint Problems, Part II: New Algorithms
inferred← citeshttps://doi.org/10.1007/11427186_54openalex-snapshot
Finding, Counting and Listing All Triangles in Large Graphs, an Experimental Study
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/11841036_27openalex-snapshot
Dynamic Programming and Fast Matrix Multiplication
inferred← citeshttps://doi.org/10.1007/11889205_2openalex-snapshot
Algorithms and Constraint Programming
inferred← citeshttps://doi.org/10.1007/3-540-36136-7_22openalex-snapshot
Faster Fixed Parameter Tractable Algorithms for Undirected Feedback Vertex Set
inferred← citeshttps://doi.org/10.1007/3-540-45022-x_69openalex-snapshot
Computing the Girth of a Planar Graph
inferred← citeshttps://doi.org/10.1007/3-540-45832-8_13openalex-snapshot
Euler Graphs, Triangle-Free Graphs and Bipartite Graphs in Switching Classes
inferred← citeshttps://doi.org/10.1007/3-540-58201-0_96openalex-snapshot
Finding even cycles even faster
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/978-0-387-30162-4_227openalex-snapshot
Maximum Two-Satisfiability
inferred← citeshttps://doi.org/10.1007/978-1-4612-2566-9_7openalex-snapshot
Parameterized Computational Feasibility
inferred← citeshttps://doi.org/10.1007/978-1-4939-2864-4_227openalex-snapshot
Exact Algorithms for Maximum Two-Satisfiability
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-25027-0_22openalex-snapshot
Rare Siblings Speed-Up Deterministic Detection and Counting of Small Pattern Graphs
inferred← citeshttps://doi.org/10.1007/978-3-030-58150-3_2openalex-snapshot
Linear-Time Algorithms for Eliminating Claws in Graphs
inferred← citeshttps://doi.org/10.1007/978-3-030-59065-9_12openalex-snapshot
A Scalable Randomized Algorithm for Triangle Enumeration on Graphs Based on SQL Queries
inferred← citeshttps://doi.org/10.1007/978-3-030-59416-9_31openalex-snapshot
AOT: Pushing the Efficiency Boundary of Main-Memory Triangle Listing
inferred← citeshttps://doi.org/10.1007/978-3-031-20624-5_7openalex-snapshot
Computing and Listing Avoidable Vertices and Paths
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-031-39344-0_8openalex-snapshot
Approximate Core Allocations for Edge Cover Games
inferred← citeshttps://doi.org/10.1007/978-3-319-11749-2_18openalex-snapshot
Common Neighbor Query-Friendly Triangulation-Based Large-Scale Graph Compression
inferred← citeshttps://doi.org/10.1007/978-3-319-13350-8_13openalex-snapshot
Quantum Complexity of Boolean Matrix Multiplication and Related Problems
inferred← citeshttps://doi.org/10.1007/978-3-319-18173-8_21openalex-snapshot
Algorithms Solving the Matching Cut Problem
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-29516-9_8openalex-snapshot
Enumerating Cyclic Orientations of a Graph
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-53925-6_17openalex-snapshot
A Fast Deterministic Detection of Small Pattern Graphs in Graphs Without Large Cliques
inferred← citeshttps://doi.org/10.1007/978-3-319-69131-2_21openalex-snapshot
Formal Models of Conflicting Social Influence
inferred← citeshttps://doi.org/10.1007/978-3-319-71147-8_12openalex-snapshot
Listing Acyclic Subgraphs and Subgraphs of Bounded Girth in Directed Graphs
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-94667-2_17openalex-snapshot
Efficient Enumeration of Subgraphs and Induced Subgraphs with Bounded Girth
inferred← citeshttps://doi.org/10.1007/978-3-319-96151-4_32openalex-snapshot
Parameterized Algorithms for Module Map Problems
inferred← citeshttps://doi.org/10.1007/978-3-540-27836-8_101openalex-snapshot
A New Algorithm for Optimal Constraint Satisfaction and Its Implications
inferred← citeshttps://doi.org/10.1007/978-3-540-28639-4_21openalex-snapshot
Parameterized Algorithms for Feedback Vertex Set
inferred← citeshttps://doi.org/10.1007/978-3-540-28639-4_23openalex-snapshot
Improved Parameterized Algorithms for Feedback Set Problems in Weighted Tournaments
inferred← citeshttps://doi.org/10.1007/978-3-540-28639-4_25openalex-snapshot
Space and Time Complexity of Exact Algorithms: Some Open Problems
inferred← citeshttps://doi.org/10.1007/978-3-540-30551-4_35openalex-snapshot
Error Compensation in Leaf Root Problems
inferred← citeshttps://doi.org/10.1007/978-3-540-30559-0_12openalex-snapshot
Decremental Clique Problem
inferred← citeshttps://doi.org/10.1007/978-3-540-45078-8_42openalex-snapshot
Parameterized Complexity of Directed Feedback Set Problems in Tournaments
inferred← citeshttps://doi.org/10.1007/978-3-540-73545-8_39openalex-snapshot
Linear Time Algorithms for Finding a Dominating Set of Fixed Size in Degenerated Graphs
inferred← citeshttps://doi.org/10.1007/978-3-540-78773-0_63openalex-snapshot
Efficient Approximation Algorithms for Shortest Cycles in Undirected Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-02927-1_63openalex-snapshot
Computing the Girth of a Planar Graph in O(n logn) Time
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-11409-0_21openalex-snapshot
Hardness Results and Efficient Algorithms for Graph Powers
inferred← citeshttps://doi.org/10.1007/978-3-642-14246-8_14openalex-snapshot
Clustering Coefficient Queries on Massive Dynamic Social Networks
inferred← citeshttps://doi.org/10.1007/978-3-642-15155-2_40openalex-snapshot
Improved Simulation of Nondeterministic Turing Machines
inferred← citeshttps://doi.org/10.1007/978-3-642-16533-7openalex-snapshot
Exact Exponential Algorithms
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-21254-3_26openalex-snapshot
Unique Small Subgraphs Are Not Easier to Find
inferred← citeshttps://doi.org/10.1007/978-3-642-22006-7_39openalex-snapshot
Domination When the Stars Are Out
inferred← citeshttps://doi.org/10.1007/978-3-642-22685-4_20openalex-snapshot
Computing the Girth of a Planar Graph in Linear Time
inferred← citeshttps://doi.org/10.1007/978-3-642-23719-5_14openalex-snapshot
Min-Cuts and Shortest Cycles in Planar Graphs in O(n loglogn) Time
inferred← citeshttps://doi.org/10.1007/978-3-642-27848-8_227-2openalex-snapshot
Exact Algorithms for Maximum Two-Satisfiability
inferred← citeshttps://doi.org/10.1007/978-3-642-29344-3_39openalex-snapshot
On the Bend-Number of Planar and Outerplanar Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-31585-5_58openalex-snapshot
Distributed Algorithms for Network Diameter and Girth
inferred← citeshttps://doi.org/10.1007/978-3-642-32241-9_4openalex-snapshot
Induced Subgraph Isomorphism: Are Some Patterns Substantially Easier Than Others?
inferred← citeshttps://doi.org/10.1007/978-3-642-33293-7_16openalex-snapshot
Fast Monotone Summation over Disjoint Sets
inferred← citeshttps://doi.org/10.1007/978-3-662-48971-0_50openalex-snapshot
Quantum Algorithm for Triangle Finding in Sparse Graphs
inferred← citeshttps://doi.org/10.1007/978-3-662-55751-8_9openalex-snapshot
Parameterized Aspects of Triangle Enumeration
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/bf01891831openalex-snapshot
Floorplanning by graph dualization: L-shaped modules
inferred← citeshttps://doi.org/10.1007/bf02243441openalex-snapshot
A simple algorithm for finding a cycle of length greater than three and without diagonals
inferred← citeshttps://doi.org/10.1007/bf02251238openalex-snapshot
The complexity of determining a shortest cycle of even length
inferred← citeshttps://doi.org/10.1007/bf02523189openalex-snapshot
Finding and counting given length cycles
inferred← citeshttps://doi.org/10.1007/bfb0049422openalex-snapshot
Finding and counting given length cycles
inferred← citeshttps://doi.org/10.1007/s00224-021-10043-yopenalex-snapshot
On Triangle Estimation Using Tripartite Independent Set Queries
inferred← citeshttps://doi.org/10.1007/s00446-016-0270-2openalex-snapshot
Algebraic methods in the congested clique
inferred← citeshttps://doi.org/10.1007/s00446-020-00373-4openalex-snapshot
Fooling views: a new lower bound technique for distributed computations under congestion
inferred← citeshttps://doi.org/10.1007/s00453-005-1180-zopenalex-snapshot
Error Compensation in Leaf Power Problems
inferred← citeshttps://doi.org/10.1007/s00453-008-9204-0openalex-snapshot
Linear Time Algorithms for Finding a Dominating Set of Fixed Size in Degenerated Graphs
inferred← citeshttps://doi.org/10.1007/s00453-010-9442-9openalex-snapshot
Complexity of Finding Graph Roots with Girth Conditions
inferred← citeshttps://doi.org/10.1007/s00453-015-9985-xopenalex-snapshot
Improving Quantum Query Complexity of Boolean Matrix Multiplication Using Graph Collision
inferred← citeshttps://doi.org/10.1007/s00453-016-0267-zopenalex-snapshot
Quantum Algorithm for Triangle Finding 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-01063-2openalex-snapshot
Rare Siblings Speed-Up Deterministic Detection and Counting of Small Pattern Graphs
inferred← citeshttps://doi.org/10.1007/s00453-023-01102-6openalex-snapshot
Improved Merlin–Arthur Protocols for Central Problems in Fine-Grained Complexity
inferred← citeshttps://doi.org/10.1007/s00453-023-01168-2openalex-snapshot
Computing and Listing Avoidable Vertices and Paths
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-022-00731-7openalex-snapshot
Making graphs compact by lossless contraction
inferred← citeshttps://doi.org/10.1007/s00778-022-00736-2openalex-snapshot
Application-driven graph partitioning
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-024-00885-6openalex-snapshot
Evaluating regular path queries on compressed adjacency matrices
inferred← citeshttps://doi.org/10.1007/s10115-014-0800-9openalex-snapshot
Triangle minimization in large networks
inferred← citeshttps://doi.org/10.1007/s10589-019-00114-9openalex-snapshot
Computing the spark: mixed-integer programming for the (vector) matroid girth problem
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/s10619-017-7193-1openalex-snapshot
Efficient MapReduce algorithms for triangle listing in billion-scale graphs
inferred← citeshttps://doi.org/10.1007/s10619-023-07437-xopenalex-snapshot
Balanced parallel triangle enumeration with an adaptive algorithm
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/s11222-013-9428-yopenalex-snapshot
Uniform random generation of large acyclic digraphs
inferred← citeshttps://doi.org/10.1007/s11227-017-2040-8openalex-snapshot
CCFinder: using Spark to find clustering coefficient in big graphs
inferred← citeshttps://doi.org/10.1007/s11432-020-2931-xopenalex-snapshot
A nearly optimal distributed algorithm for computing the weighted girth
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.1016/0020-0190(85)90108-5openalex-snapshot
Optimal search with positive switch cost is NP-hard
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/0304-3975(91)90020-3openalex-snapshot
Planar orientations with low out-degree and compaction of adjacency matrices
inferred← citeshttps://doi.org/10.1016/j.biosystems.2022.104667openalex-snapshot
Trinucleotide k -circular codes I: Theory
inferred← citeshttps://doi.org/10.1016/j.dam.2007.03.023openalex-snapshot
Open problems around exact algorithms
inferred← citeshttps://doi.org/10.1016/j.dam.2013.02.017openalex-snapshot
An efficient algorithm for testing goal-minimality of graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2017.08.002openalex-snapshot
Efficient enumeration of graph orientations with sources
inferred← citeshttps://doi.org/10.1016/j.dam.2021.06.019openalex-snapshot
Detecting and enumerating small induced subgraphs in c -closed graphs
inferred← citeshttps://doi.org/10.1016/j.entcs.2016.03.005openalex-snapshot
Into the Square: On the Complexity of Some Quadratic-time Solvable Problems
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.ic.2026.105448openalex-snapshot
Improved algorithms for perfect graphs and odd holes
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.ipl.2003.06.002openalex-snapshot
Generating connected acyclic digraphs uniformly at random
inferred← citeshttps://doi.org/10.1016/j.ipl.2008.10.014openalex-snapshot
Efficient algorithms for clique problems
inferred← citeshttps://doi.org/10.1016/j.ipl.2009.01.008openalex-snapshot
Efficient approximation algorithms for shortest cycles in undirected graphs
inferred← citeshttps://doi.org/10.1016/j.ipl.2011.07.019openalex-snapshot
A shortest cycle for each vertex of a graph
inferred← citeshttps://doi.org/10.1016/j.ipl.2013.12.003openalex-snapshot
Fast monotone summation over disjoint sets
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.ipl.2020.105993openalex-snapshot
Lengths of words accepted by nondeterministic finite automata
inferred← citeshttps://doi.org/10.1016/j.jcss.2019.02.004openalex-snapshot
Parameterized aspects of triangle enumeration
inferred← citeshttps://doi.org/10.1016/j.jda.2015.10.001openalex-snapshot
On the negative cost girth problem in planar networks
inferred← citeshttps://doi.org/10.1016/j.procs.2021.11.022openalex-snapshot
Consequences of APSP, triangle detection, and 3SUM hardness for separation between determinism and non-determinism
inferred← citeshttps://doi.org/10.1016/j.promfg.2015.07.711openalex-snapshot
Network Exploratory Analysis on Subway Transportation Systems against Complex Threats Including a Human Factors Perspective
inferred← citeshttps://doi.org/10.1016/j.tcs.2004.05.009openalex-snapshot
On the complexity of fixed parameter clique and dominating set
inferred← citeshttps://doi.org/10.1016/j.tcs.2005.09.023openalex-snapshot
A new algorithm for optimal 2-constraint satisfaction and its implications
inferred← citeshttps://doi.org/10.1016/j.tcs.2005.10.010openalex-snapshot
Parameterized algorithms for feedback set problems and their duals in tournaments
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.2011.05.018openalex-snapshot
Improved simulation of nondeterministic Turing machines
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.2013.10.012openalex-snapshot
Parameterized complexity of k -Chinese Postman Problem
inferred← citeshttps://doi.org/10.1016/j.tcs.2015.09.001openalex-snapshot
Induced subgraph isomorphism: Are some patterns substantially easier than others?
inferred← citeshttps://doi.org/10.1016/j.tcs.2015.10.016openalex-snapshot
Algorithms solving the Matching Cut problem
inferred← citeshttps://doi.org/10.1016/j.tcs.2018.10.028openalex-snapshot
A fast deterministic detection of small pattern graphs in graphs without large cliques
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.2023.114178openalex-snapshot
Streaming deletion problems parameterized by vertex cover
inferred← citeshttps://doi.org/10.1016/j.tcs.2024.114433openalex-snapshot
Approximate core allocations for edge cover games
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/s0012-365x(00)00083-2openalex-snapshot
Forbidden minors to graphs with small feedback sets
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/s0020-0190(03)00252-7openalex-snapshot
Detecting directed 4-cycles still faster
inferred← citeshttps://doi.org/10.1016/s0166-218x(96)00114-xopenalex-snapshot
A nice class for the vertex packing problem
inferred← citeshttps://doi.org/10.1016/s0304-0208(08)73019-6openalex-snapshot
Finding Cycles of a Given Length
inferred← citeshttps://doi.org/10.1016/s0304-0208(08)73101-3openalex-snapshot
A Local-Ratio Theorem for Approximating the Weighted Vertex Cover Problem
inferred← citeshttps://doi.org/10.1016/s0928-4869(00)00006-9openalex-snapshot
Metabolic reconstruction using shortest paths
inferred← citeshttps://doi.org/10.1016/s1571-0653(04)00394-4openalex-snapshot
Random Generation of Directed Acyclic Graphs
inferred← citeshttps://doi.org/10.1051/ro/2015052openalex-snapshot
An efficient cutting plane algorithm for the minimum weighted elementary directed cycle problem in planar digraphs
inferred← citeshttps://doi.org/10.1080/00207160.2012.701287openalex-snapshot
Unique subgraphs are not easier to find
inferred← citeshttps://doi.org/10.1080/01621459.2015.1133426openalex-snapshot
Partition MCMC for Inference on Acyclic Digraphs
inferred← citeshttps://doi.org/10.1080/15427951.2015.1037030openalex-snapshot
Why Do Simple Algorithms for Triangle Enumeration Work in the Real World?
inferred← citeshttps://doi.org/10.1093/comjnl/bxm039openalex-snapshot
Some Parameterized Problems On Digraphs
inferred← citeshttps://doi.org/10.1109/bigdata.2016.7840674openalex-snapshot
Efficient triangle listing for billion-scale graphs
inferred← citeshttps://doi.org/10.1109/cdc.2018.8619666openalex-snapshot
Sparse Recovery over Graph Incidence Matrices
inferred← citeshttps://doi.org/10.1109/cmce.2010.5610495openalex-snapshot
An approximation algorithm for the shortest cycle in an undirected unweighted graph
inferred← citeshttps://doi.org/10.1109/edis63605.2024.10783167openalex-snapshot
Extending TWJ for Triangles Detection in Large Graphs
inferred← citeshttps://doi.org/10.1109/focs.2008.29openalex-snapshot
Dynamic Connectivity: Connecting to Networks and Geometry
inferred← citeshttps://doi.org/10.1109/focs.2009.76openalex-snapshot
Regularity Lemmas and Combinatorial Algorithms
inferred← citeshttps://doi.org/10.1109/focs.2010.67openalex-snapshot
Subcubic Equivalences between Path, Matrix and Triangle Problems
inferred← citeshttps://doi.org/10.1109/focs.2011.27openalex-snapshot
Minimum Weight Cycles and Triangles: Equivalences and Algorithms
inferred← citeshttps://doi.org/10.1109/focs.2012.72openalex-snapshot
Algorithmic Applications of Baur-Strassen's Theorem: Shortest Cycles, Diameter and Matchings
inferred← citeshttps://doi.org/10.1109/focs.2014.22openalex-snapshot
Complexity of Counting Subgraphs: Only the Boundedness of the Vertex-Cover Number Counts
inferred← citeshttps://doi.org/10.1109/focs.2014.31openalex-snapshot
Improved Quantum Algorithm for Triangle Finding via Combinatorial Arguments
inferred← citeshttps://doi.org/10.1109/focs.2014.53openalex-snapshot
Popular Conjectures Imply Strong Lower Bounds for Dynamic Problems
inferred← citeshttps://doi.org/10.1109/focs.2015.44openalex-snapshot
Approximately Counting Triangles in Sublinear Time
inferred← citeshttps://doi.org/10.1109/focs.2019.00078openalex-snapshot
The Average-Case Complexity of Counting Cliques in Erdős-Rényi Hypergraphs
inferred← citeshttps://doi.org/10.1109/ftcs.1990.89341openalex-snapshot
Design and analysis of test schemes for algorithm-based fault tolerance
inferred← citeshttps://doi.org/10.1109/hpec.2017.8091046openalex-snapshot
First look: Linear algebra-based triangle counting without matrix multiplication
inferred← citeshttps://doi.org/10.1109/hpec58863.2023.10363539openalex-snapshot
Fast Triangle Counting
inferred← citeshttps://doi.org/10.1109/icde.2019.00241openalex-snapshot
Cohesive Subgraph Computation Over Large Sparse Graphs
inferred← citeshttps://doi.org/10.1109/icde51399.2021.00119openalex-snapshot
DPTL+: Efficient Parallel Triangle Listing on Batch-Dynamic Graphs
inferred← citeshttps://doi.org/10.1109/icdm.2016.0021openalex-snapshot
On Efficient External-Memory Triangle Listing
inferred← citeshttps://doi.org/10.1109/icdm.2018.00100openalex-snapshot
Fast Rectangle Counting on Massive Networks
inferred← citeshttps://doi.org/10.1109/iscas.1990.112603openalex-snapshot
Floorplanning by graph dualization: L-shaped modules
inferred← citeshttps://doi.org/10.1109/mlsp58920.2024.10734796openalex-snapshot
Counting Triangles of Graphs via Matrix Partitioning
inferred← citeshttps://doi.org/10.1109/nbis.2013.9openalex-snapshot
Single Document Summarization Based on Triangle Analysis of Dependency Graphs
inferred← citeshttps://doi.org/10.1109/tit.2008.924700openalex-snapshot
A Decomposition Theory for Binary Linear Codes
inferred← citeshttps://doi.org/10.1109/tit.2013.2290112openalex-snapshot
The Computational Complexity of the Restricted Isometry Property, the Nullspace Property, and Related Concepts in Compressed Sensing
inferred← citeshttps://doi.org/10.1109/tit.2019.2958970openalex-snapshot
A Tight Rate Bound and Matching Construction for Locally Recoverable Codes With Sequential Recovery From Any Number of Multiple Erasures
inferred← citeshttps://doi.org/10.1109/tkde.2018.2858820openalex-snapshot
On Efficient External-Memory Triangle Listing
inferred← citeshttps://doi.org/10.1109/tkde.2021.3052827openalex-snapshot
Differentially Private Triangle Counting in Large Graphs
inferred← citeshttps://doi.org/10.1109/tpds.2021.3093240openalex-snapshot
A Block-Based Triangle Counting Algorithm on Heterogeneous Environments
inferred← citeshttps://doi.org/10.1137/0214017openalex-snapshot
Arboricity and Subgraph Listing Algorithms
inferred← citeshttps://doi.org/10.1137/070695149openalex-snapshot
Finding a Heaviest Vertex-Weighted Triangle Is not Harder than Matrix Multiplication
inferred← citeshttps://doi.org/10.1137/090751670openalex-snapshot
Dynamic Connectivity: Connecting to Networks and Geometry
inferred← citeshttps://doi.org/10.1137/09076619xopenalex-snapshot
Finding, Minimizing, and Counting Weighted Subgraphs
inferred← citeshttps://doi.org/10.1137/090767868openalex-snapshot
Computing the Girth of a Planar Graph in $O(n \logn)$ Time
inferred← citeshttps://doi.org/10.1137/1.9781611973082.114openalex-snapshot
Counting and detecting small subgraphs via equations and matrix multiplication
inferred← citeshttps://doi.org/10.1137/1.9781611973198.1openalex-snapshot
Triangle Listing Algorithms: Back from the Diversion
inferred← citeshttps://doi.org/10.1137/1.9781611973402.45openalex-snapshot
Counting Thin Subgraphs via Packings Faster Than Meet-in-the-Middle Time
showing the first 200 of 356 · page through all 356
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.