The following pages link to (Q3138899):
Displayed 17 items.
- Decentralized \(H_2\) observers for position and velocity estimation in vehicle formations with fixed topologies (Q450789) (← links)
- A fast and effective heuristic for the feedback arc set problem (Q688447) (← links)
- Exact localisations of feedback sets (Q722200) (← links)
- An updated survey on the linear ordering problem for weighted or unweighted tournaments (Q970187) (← links)
- Combinatorial algorithms for feedback problems in directed graphs (Q1007586) (← links)
- Edge crossings in drawings of bipartite graphs (Q1322570) (← links)
- Approximations for the maximum acyclic subgraph problem (Q1332750) (← links)
- Food webs: experts consuming families of experts (Q2199233) (← links)
- Crossing-constrained hierarchical drawings (Q2458930) (← links)
- A survey on the linear ordering problem for weighted or unweighted tournaments (Q2644372) (← links)
- Decentralized state observers for range-based position and velocity estimation in acyclic formations with fixed topologies (Q2796919) (← links)
- Restricted Common Superstring and Restricted Common Supersequence (Q3011876) (← links)
- The parallel complexity of approximation algorithms for the maximum acyclic subgraph problem (Q4009810) (← links)
- An Exact Method for the Minimum Feedback Arc Set Problem (Q5102057) (← links)
- Exact Algorithms for Maximum Acyclic Subgraph on a Superclass of Cubic Graphs (Q5452161) (← links)
- Extremal results on feedback arc sets in digraphs (Q6119220) (← links)
- Effective Computation of a Feedback Arc Set Using PageRank (Q6181948) (← links)