The following pages link to David Coudert (Q301595):
Displayed 41 items.
- Data center interconnection networks are not hyperbolic (Q301597) (← links)
- On the hyperbolicity of bipartite graphs and intersection graphs (Q317426) (← links)
- Robust energy-aware routing with redundancy elimination (Q342072) (← links)
- GMPLS label space minimization through hypergraph layouts (Q442249) (← links)
- Tradeoffs in process strategy games with application in the WDM reconfiguration problem (Q638539) (← links)
- A simple approach for lower-bounding the distortion in any hyperbolic embedding (Q1689928) (← links)
- Item:Q301595 (redirect page) (← links)
- Low time complexity algorithms for path computation in Cayley graphs (Q1735699) (← links)
- Computing and maximizing the exact reliability of wireless backhaul networks (Q1742207) (← links)
- On distance-preserving elimination orderings in graphs: complexity and algorithms (Q1752455) (← links)
- Characterization of graphs and digraphs with small process numbers (Q2275910) (← links)
- Finding disjoint paths in networks with star shared risk link groups (Q2344758) (← links)
- Non-deterministic graph searching in trees (Q2344776) (← links)
- Traffic grooming on the path (Q2382667) (← links)
- Applying clique-decomposition for computing Gromov hyperbolicity (Q2399620) (← links)
- A distributed algorithm for computing the node search number in trees (Q2429351) (← links)
- On Computing the Gromov Hyperbolicity (Q2828207) (← links)
- On Rerouting Connection Requests in Networks with Shared Bandwidth (Q2839218) (← links)
- Connectivity Inference in Mass Spectrometry Based Structure Determination (Q2849320) (← links)
- Recognition of $C_4$-Free and 1/2-Hyperbolic Graphs (Q2935290) (← links)
- Chance-Constrained Optimization of Reliable Fixed Broadband Wireless Networks (Q2940074) (← links)
- (Q2965980) (← links)
- Bin Packing with Colocations (Q2971155) (← links)
- A Chance-Constrained Model and Cutting Planes for Fixed Broadband Wireless Networks (Q3091480) (← links)
- Traffic Grooming: Combinatorial Results and Practical Resolutions (Q3404459) (← links)
- Designing Hypergraph Layouts to GMPLS Routing Strategies (Q3408160) (← links)
- (Q3424723) (← links)
- Pathwidth of outerplanar graphs (Q3445500) (← links)
- On Computing the Hyperbolicity of Real-World Graphs (Q3452784) (← links)
- Edge-Simple Circuits through 10 Ordered Vertices in Square Grids (Q3651541) (← links)
- (Q4608071) (← links)
- Revisiting Decomposition by Clique Separators (Q4610181) (← links)
- Isomorphisms of the De Bruijn digraph and free‐space optical networks (Q4785231) (← links)
- On DRC‐covering of K<sub>n</sub> by cycles (Q4800406) (← links)
- Fully Polynomial FPT Algorithms for Some Classes of Bounded Clique-width Graphs (Q4972678) (← links)
- Experimental Evaluation of a Branch-and-Bound Algorithm for Computing Pathwidth and Directed Pathwidth (Q5266611) (← links)
- Traffic Grooming in Unidirectional Wavelength-Division Multiplexed Rings with Grooming Ratio<i>C</i>= 6 (Q5470777) (← links)
- Structural Information and Communication Complexity (Q5710095) (← links)
- To Approximate Treewidth, Use Treelength! (Q5741086) (← links)
- Approximation and Online Algorithms (Q5896938) (← links)
- Enumeration of Far-apart Pairs by Decreasing Distance for Faster Hyperbolicity Computation (Q6127825) (← links)