The paper develops a new framework for proving lower bounds for the maximum matching problem in the semi-streaming model, improving upon the previous best known bounds.

This paper introduces online assignment policies for stochastic matching on hypergraphs, which are maximally stable and allow for the derivation of necessary and sufficient stability criteria.

This paper presents deterministic and randomized algorithms for the incremental dominating set problem in vertex-weighted graphs, achieving competitive ratios of O(Δ) and O(log^2Δ) respectively. It al…

This paper characterizes stabilizability of stochastic dynamic matching on hypergraphs using the arrival rates and incidence matrix, and proposes a stabilizing policy.

The paper presents an adaptive scaling algorithm with a competitive ratio of 1.373 for incremental submodular maximization under increasing cardinality constraint, improving upon the previous best res…

This paper settles the complexity of three sketching problems in graphs and distributions.

This paper proposes two algorithms for approximating the number of four-cycles in graph edge streams, improving upon existing theoretical bounds and handling non-concentrated four-cycles in one-pass.

The paper establishes conditions for QUBO formulations of combinatorial optimization problems that guarantee valid binary and feasible local minimizers using gradient-based methods.

This paper presents three new algorithms for maximizing revenue in the Stackelberg Vertex Cover problem on certain kinds of trees.

This paper investigates the use of spectral filtering for continuous subgraph matching over dynamic graphs and presents three key findings.

The authors map the problem of finding the maximum cut of a planar graph with arbitrary weights to a minimum T-join problem in the absolute dual graph, enabling the use of shortest paths and adapting…

A new polynomial-time algorithm is presented for optimally coloring perfect graphs using graph-theoretic operations and iterative walk counting.

This paper studies ranking and aggregation under Kendall tau distance with matroid or flag matroid constraints on prefixes.

This paper presents a simpler variation of the NC detection criterion for perfect matchings in bipartite graphs with improved parameters.