Advances in Graph Theory and Combinatorial Optimization

The field of graph theory and combinatorial optimization is rapidly advancing, with a focus on developing efficient algorithms and understanding the underlying structure of complex networks. Recent studies have investigated various aspects of graph theory, including the discovery of maximum k-defective bicliques, maximum reachability orientation of mixed graphs, and minimum-weight half-plane hitting sets. Additionally, researchers have explored the approximability of submodular matroid-constrained partitioning and the complexity of all-pairs shortest paths with few weights per node. Noteworthy papers in this area include 'On the Efficient Discovery of Maximum k-Defective Biclique', which proposes a novel algorithm for finding maximum k-defective bicliques in bipartite graphs, and 'Approximating Submodular Matroid-Constrained Partitioning', which explores the approximability of submodular matroid-constrained partitioning. These studies demonstrate significant progress in understanding and optimizing complex networks, with implications for various applications in computer science and other fields.

Sources

On the Efficient Discovery of Maximum $k$-Defective Biclique

Maximum Reachability Orientation of Mixed Graphs

Minimum-Weight Half-Plane Hitting Set

When does FTP become FPT?

Local Search Improvements for Soft Happy Colouring

Subcoloring of (Unit) Disk Graphs

Approximating Submodular Matroid-Constrained Partitioning

All-Pairs Shortest Paths with Few Weights per Node

Cut-Query Algorithms with Few Rounds

On plane cycles in geometric multipartite graphs

Line Aspect Ratio

Almost Tight Additive Guarantees for \boldmath $k$-Edge-Connectivity

Courcelle's Theorem for Lipschitz Continuity

On Minimizing Wiggle in Stacked Area Charts

Edge Clique Partition and Cover Beyond Independence

Making Graphs Irregular through Irregularising Walks

Playing Snake on a Graph

Guarding Offices with Maximum Dispersion

Vantage Point Selection Algorithms for Bottleneck Capacity Estimation

Built with on top of