The following pages link to (Q3651735):
Displaying 50 items.
- Dynamic passenger assignment for major railway disruptions considering information interventions (Q2005908) (← links)
- The complexity of finding small separators in temporal graphs (Q2009634) (← links)
- Online hole healing for sensor coverage (Q2010111) (← links)
- Robust algorithms for total completion time (Q2010916) (← links)
- The natural algorithmic approach of mixed trigonometric-polynomial problems (Q2012330) (← links)
- Maximum flows in generalized processing networks (Q2012883) (← links)
- On partial sorting in restricted rounds (Q2013879) (← links)
- Distributed resource allocation with binary decisions via Newton-like neural network dynamics (Q2021311) (← links)
- ASA-graphs for efficient data representation and processing (Q2023584) (← links)
- On integer closure in a system of unit two variable per inequality constraints (Q2023870) (← links)
- An adaptive large neighbourhood search heuristic for routing and scheduling feeder vessels in multi-terminal ports (Q2023947) (← links)
- Minimum constellation covers: hardness, approximability and polynomial cases (Q2025056) (← links)
- Graph spanners: a tutorial review (Q2026289) (← links)
- Compact formulations and an iterated local search-based matheuristic for the minimum weighted feedback vertex set problem (Q2028800) (← links)
- A bi-objective heuristic approach for green identical parallel machine scheduling (Q2029023) (← links)
- Solving the length constrained \(K\)-drones rural postman problem (Q2030543) (← links)
- Note on long paths in Eulerian digraphs (Q2034059) (← links)
- A parameterized perspective on protecting elections (Q2034407) (← links)
- Sparse randomized shortest paths routing with Tsallis divergence regularization (Q2036747) (← links)
- Search complexity: a way for the quantitative analysis of the search space (Q2039682) (← links)
- \({\mathcal{W}}_\infty \)-transport with discrete target as a combinatorial matching problem (Q2042000) (← links)
- Minimum \(k\)-critical bipartite graphs (Q2043356) (← links)
- Mixed-integer optimal control problems with switching costs: a shortest path approach (Q2044973) (← links)
- Algebraic Bayesian networks: checking backbone connectivity (Q2047545) (← links)
- An Ito-Taylor weak 3.0 method for stochastic dynamics of nonlinear systems (Q2049749) (← links)
- Computing the depth distribution of a set of boxes (Q2049979) (← links)
- The one-cop-moves game on planar graphs (Q2051905) (← links)
- What paradoxes depend on (Q2054131) (← links)
- Efficient single-pair all-shortest-path query processing for massive dynamic networks (Q2055599) (← links)
- Double-base chains for scalar multiplications on elliptic curves (Q2055666) (← links)
- Analyzing unit read-once refutations in difference constraint systems (Q2055789) (← links)
- Rooted spanning superpixels (Q2056121) (← links)
- Complexity of linear minimization and projection on some sets (Q2060605) (← links)
- On sums of monotone functions over smooth numbers (Q2062508) (← links)
- On the computational complexity of the secure state-reconstruction problem (Q2063856) (← links)
- Preservation of normality by transducers (Q2064521) (← links)
- Efficient data validation for geographical interlocking systems (Q2065531) (← links)
- A nondeterministic Turing machine variant to compute functions (Q2067632) (← links)
- Faster tensor train decomposition for sparse data (Q2068649) (← links)
- Černý's conjecture and the road colouring problem (Q2074216) (← links)
- Parameterized and exact algorithms for finding a read-once resolution refutation in 2CNF formulas (Q2075363) (← links)
- Scheduling truck drivers with interdependent routes under European Union regulations (Q2076913) (← links)
- The weighted \(k\)-center problem in trees for fixed \(k\) (Q2077394) (← links)
- Isometries of the hypercube: a tool for Boolean regulatory networks analysis (Q2077693) (← links)
- Range minimum queries in minimal space (Q2078612) (← links)
- Cutting bamboo down to size (Q2078615) (← links)
- On knot-free vertex deletion: fine-grained parameterized complexity analysis of a deadlock resolution graph problem (Q2078619) (← links)
- A salp swarm algorithm based on Harris Eagle foraging strategy (Q2079378) (← links)
- A tree search heuristic for the resource constrained project scheduling problem with transfer times (Q2079399) (← links)
- Method and algorithms for adaptive multiagent resource scheduling in heterogeneous distributed computing environments (Q2081120) (← links)
