Cover Image

Makespan Trade-offs for Visiting Triangle Edges

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Georgiou, Konstantinos, Kundu, Somnath, Pralat, Pawel
Format:	Preprint
Published:	2021
Subjects:	Discrete Mathematics
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

The Fagnano Triangle Patrolling Problem
by: Georgiou, Konstantinos, et al.
Published: (2023)

Multiset Metric Dimension of Binomial Random Graphs
by: Eide, Austin, et al.
Published: (2025)

Optimal Average Disk-Inspection via Fermat's Principle
by: Georgiou, Konstantinos
Published: (2025)

Weighted Group Search on the Disk & Improved Lower Bounds for Priority Evacuation
by: Georgiou, Konstantinos, et al.
Published: (2024)

Cliques, Chromatic Number, and Independent Sets in the Semi-random Process
by: Gamarnik, David, et al.
Published: (2023)

Playing Sudoku on random 3-regular graphs
by: Dippel, Jack, et al.
Published: (2025)

Achievable Burning Densities of Growing Grids
by: Barrett, Jordan, et al.
Published: (2026)

Asynchronous Majority Dynamics on Binomial Random Graphs
by: Mohan, Divyarthi, et al.
Published: (2023)

Multi-Agent Search-Type Problems on Polygons
by: Georgiou, Konstantinos, et al.
Published: (2024)

Disk and Partial Disk Inspection: Worst- to Average-Case and Pareto Upper Bounds
by: Conley, James, et al.
Published: (2024)

Building Hamiltonian Cycles in the Semi-Random Graph Process in Less Than $2n$ Rounds
by: Frieze, Alan, et al.
Published: (2023)

A Direct Proof of the Short-Side Advantage in Random Matching Markets
by: Mauras, Simon, et al.
Published: (2025)

Counting simplicial pairs in hypergraphs
by: Barrett, Jordan, et al.
Published: (2024)

Fast Makespan Minimization via Short ILPs
by: Hermelin, Danny, et al.
Published: (2026)

Spirals and Beyond: Competitive Plane Search with Multi-Speed Agents
by: Georgiou, Konstantinos, et al.
Published: (2025)

Canonical labelling of random regular graphs
by: Isaev, Mikhail, et al.
Published: (2026)

Efficient Algorithms for Minimizing the Kirchhoff Index via Adding Edges
by: Zhou, Xiaotian, et al.
Published: (2025)

Growth Rate of the Number of Empty Triangles in the Plane
by: Bhattacharya, Bhaswar B., et al.
Published: (2024)

Counting Tree-Like Multigraphs with a Given Number of Vertices and Multiple Edges
by: Ilyas, Muhammad, et al.
Published: (2025)

Trade-off between spread and width for tree decompositions
by: Bodlaender, Hans L., et al.
Published: (2026)

Number of Edges in 3-Connected Graphs with Cyclic Neighborhoods
by: Schneider, Samuel, et al.
Published: (2025)

Partitioning a Planar Graph into two Triangle-Forests
by: Knauer, Kolja, et al.
Published: (2024)

Enumeration of Tree-like Multigraphs with a Given Number of Vertices, Self-loops and Multiple Edges
by: Azam, Naveed Ahmed, et al.
Published: (2025)

Triangle-free 2-matchings
by: Paluch, Katarzyna
Published: (2023)

Note on the Number of Almost Ordinary Triangles
by: Dumitrescu, Adrian, et al.
Published: (2025)

Node-Weighted Triangles: Faster and Simpler
by: Akmal, Shyan, et al.
Published: (2026)

On the Number of Almost Empty Monochromatic Triangles
by: Bhattacharya, Bhaswar B., et al.
Published: (2026)

Triangle Detection in H-Free Graphs
by: Abboud, Amir, et al.
Published: (2025)

On the Structural Parameterizations of 2-Club with Triangle Constraints
by: Jacob, Ashwin, et al.
Published: (2025)

List coloring ordered graphs with forbidden induced subgraphs
by: Piecyk, Marta, et al.
Published: (2025)

A polynomial bound on the number of minimal separators and potential maximal cliques in $P_6$-free graphs of bounded clique number
by: Pilipczuk, Marcin, et al.
Published: (2023)

Polynomial-time recognition and maximum independent set in Burling graphs
by: Rzążewski, Paweł, et al.
Published: (2024)

Clique-width and induced topological minors
by: Bieliński, Paweł Rafał, et al.
Published: (2026)

Optimal Trading of a Charging-Station Company in Auction Markets for Electricity
by: Sohrabi, Farnaz, et al.
Published: (2025)

Vital Edges for (s,t)-mincut: Efficient Algorithms, Compact Structures, and Optimal Sensitivity Oracle
by: Baswana, Surender, et al.
Published: (2023)

Density Matters: A Complexity Dichotomy of Deleting Edges to Bound Subgraph Density
by: Bentert, Matthias, et al.
Published: (2026)

Graph Coloring Below Guarantees via Co-Triangle Packing
by: Akmal, Shyan, et al.
Published: (2025)

Induced matching treewidth and tree-independence number, revisited
by: Alon, Noga, et al.
Published: (2025)

Coloring and Recognizing Directed Interval Graphs
by: Gutowski, Grzegorz, et al.
Published: (2023)

Hitting all longest paths in $H$-free graphs and $H$-graphs
by: de Lima, Paloma T., et al.
Published: (2025)