Imagen de Portada

Temporal Orienteering with Changing Fuel Costs

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Corsini, Timothée, Enright, Jessica, Larios-Jones, Laura, Meeks, Kitty
Formato:	Preprint
Publicado:	2025
Materias:	Discrete Mathematics
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Structural Parameters for Dense Temporal Graphs
por: Enright, Jessica, et al.
Publicado: (2024)

Reachability in temporal graphs under perturbation
por: Enright, Jessica, et al.
Publicado: (2024)

Families of tractable problems with respect to vertex-interval-membership width and its generalisations
por: Enright, Jessica, et al.
Publicado: (2025)

Approximating temporal modularity on graphs of small underlying treewidth
por: Agdur, Vilhelm, et al.
Publicado: (2025)

Temporal Triadic Closure: Finding Dense Structures in Social Networks That Evolve
por: Davot, Tom, et al.
Publicado: (2024)

FO and MSO Model Checking on Temporal Graphs
por: Döring, Michelle, et al.
Publicado: (2026)

Parameterised algorithms for temporally satisfying reconfiguration problems
por: Davot, Tom, et al.
Publicado: (2025)

Cops and Robbers on Multi-Layer Graphs
por: Enright, Jessica, et al.
Publicado: (2023)

Parameterized Algorithms for Balanced Cluster Edge Modification Problems
por: Madathil, Jayakrishnan, et al.
Publicado: (2024)

Tangled Paths: A Random Graph Model from Mallows Permutations
por: Enright, Jessica, et al.
Publicado: (2021)

Counting Subgraphs in Somewhere Dense Graphs
por: Bressan, Marco, et al.
Publicado: (2022)

Dismountability in Temporal Cliques Revisited
por: Carnevale, Daniele, et al.
Publicado: (2025)

Temporal Reachability Dominating Sets: contagion in temporal graphs
por: Kutner, David C., et al.
Publicado: (2023)

Chromatic discrepancy of locally $s$-colourable graphs
por: Corsini, Timothée, et al.
Publicado: (2025)

$O(n +f(k))$: Truly Linear FPT
por: Bumpus, Benjamin Merlin, et al.
Publicado: (2026)

A New Temporal Interpretation of Cluster Editing
por: Bocci, Cristiano, et al.
Publicado: (2022)

Making Graphs Irregular through Irregularising Walks
por: Bensmail, Julien, et al.
Publicado: (2025)

Directed branch-width: A directed analogue of tree-width
por: Bumpus, Benjamin Merlin, et al.
Publicado: (2020)

Cops & Robber on Periodic Temporal Graphs
por: De Carufel, Jean-Lou, et al.
Publicado: (2024)

In search of the lost tree: Hardness and relaxation of spanning trees in temporal graphs
por: Casteigts, Arnaud, et al.
Publicado: (2023)

Simple, strict, proper, happy: A study of reachability in temporal graphs
por: Casteigts, Arnaud, et al.
Publicado: (2022)

Stable Matching: Dealing with Changes in Preferences
por: Gangam, Rohith Reddy, et al.
Publicado: (2023)

Approximation Algorithms for Correlated Knapsack Orienteering
por: Espinosa, David Aleman, et al.
Publicado: (2024)

How to Color Temporal Graphs to Ensure Proper Transitions
por: Ibiapina, Allen, et al.
Publicado: (2025)

From Tripods to Bipods: Reducing the Queue Number of Planar Graphs Costs Just One Leg
por: Förster, Henry
Publicado: (2024)

Sharp Thresholds for Temporal Motifs and Doubling Time in Random Temporal Graphs
por: Austin, Henry, et al.
Publicado: (2026)

Temporal passing network in basketball: the effect of time pressure on the dynamics of team organization at micro and meso levels
por: Bourgeais, Quentin, et al.
Publicado: (2025)

A Temporal Graph Model to Study the Dynamics of Collective Behavior and Performance in Team Sports: An Application to Basketball
por: Bourgeais, Quentin, et al.
Publicado: (2024)

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

Menger's Theorem for Temporal Paths (Not Walks)
por: Ibiapina, Allen, et al.
Publicado: (2022)

Two-stage Stochastic Assignment Games
por: Sanità, Laura, et al.
Publicado: (2025)

Unsplittable Cost Flows from Unweighted Error-Bounded Variants
por: Swamy, Chaitanya, et al.
Publicado: (2025)

Faster and shorter synthesis of Hamiltonian simulation circuits
por: de Brugière, Timothée Goubault, et al.
Publicado: (2024)

The formula for the completion time of project networks
por: Castejón-Limas, Manuel, et al.
Publicado: (2024)

Temporal Network Analysis of Microservice Architectural Degradation
por: Bakhtin, Alexander
Publicado: (2025)

Optimizing Tensor Contraction Paths: A Greedy Algorithm Approach With Improved Cost Functions
por: Orgler, Sheela, et al.
Publicado: (2024)

Balanced-chromatic number and Hadwiger-like conjectures
por: Jiménez, Andrea, et al.
Publicado: (2023)

Directed Acyclic Outerplanar Graphs Have Constant Stack Number
por: Jungeblut, Paul, et al.
Publicado: (2022)

Forbidden Patterns in Mixed Linear Layouts
por: Haun, Deborah, et al.
Publicado: (2024)

Temporal Connectivity Augmentation
por: Bellitto, T., et al.
Publicado: (2025)