2 citations · 2 across the 4 of their papers we have counts for
5 papers
Local Search for Almost-Spanning Square Grids in Erdős--Rényi Random Graphs
Dávid Ferenczi, Alexander Grigoriev
Finding large lattice subgraphs in sparse Erdős--Rényi random graphs is a classical problem at the interface of random graph theory and algorithms. General bounded-degree embedding…
Constrained graph generation: Preserving diameter and clustering coefficient simultaneously
Dávid Ferenczi, Alexander Grigoriev
Generating graphs subject to strict structural constraints is a fundamental computational challenge in network science. Simultaneously preserving interacting properties-such as the…
Optimizing Periodic Operations for Efficient Inland Waterway Lock Management
Julian Golak, Alexander Grigoriev, Freija van Lent +1
In inland waterways, the efficient management of water lock operations impacts the level of congestion and the resulting uncertainty in inland waterway transportation. To achieve r…
A polynomial delay algorithm generating all potential maximal cliques in triconnected planar graphs
Alexander Grigoriev, Yasuaki Kobayashi, Hisao Tamaki +1
We develop a new characterization of potential maximal cliques of a triconnected planar graph and, using this characterization, give a polynomial delay algorithm generating all pot…
Combinatorial properties of continuous graphs: A survey of challenges, solutions and open problems
Alexander Grigoriev, Katherine Faulkner
Inspired by notorious combinatorial optimization problems on graphs, in this paper we consider a series of related problems defined using a metric space and topology determined by…