The following pages link to Eleonor Ciurea (Q261055):
Displaying 50 items.
- Inverse feasibility problems of the inverse maximum flow problems (Q261056) (← links)
- On graph-Lagrangians of hypergraphs containing dense subgraphs (Q467466) (← links)
- Revisiting the linear information flow algorithm (Q477998) (← links)
- Verifying global start-up for a Möbius ring-oscillator (Q479839) (← links)
- Lovász-Schrijver SDP-operator, near-perfect graphs and near-bipartite graphs (Q517302) (← links)
- Optimized algorithms for numerical calculation of the characteristics of multistream models with repeated calls (Q582199) (← links)
- New geometry-inspired relaxations and algorithms for the metric Steiner tree problem (Q647390) (← links)
- Powers of Hamilton cycles in pseudorandom graphs (Q681592) (← links)
- Cocliques in the Kneser graph on line-plane flags in \(\mathrm{PG}(4, Q)\) (Q722306) (← links)
- Induced subgraphs of graphs with large chromatic number. III: Long holes (Q722311) (← links)
- Diameter of parallelogramic honeycomb torus (Q813221) (← links)
- Cubic maximal nontraceable graphs (Q868358) (← links)
- Inverse minimum flow problem (Q874337) (← links)
- Score sequences in oriented graphs (Q874343) (← links)
- (Q920828) (redirect page) (← links)
- New methods for multi-commodity flows (Q920829) (← links)
- The pebbling threshold of the square of cliques (Q941367) (← links)
- Pentagons vs. triangles (Q941370) (← links)
- Quadripartite version of the Hajnal-Szemerédi theorem (Q941371) (← links)
- Optimal urban networks via mass transportation (Q947708) (← links)
- Nonsmooth modeling and simulation for switched circuits. (Q983164) (← links)
- Conference structures and consistency (Q1044966) (← links)
- Multi-terminal maximum flows in node-capacitated networks (Q1085773) (← links)
- Greedy concepts for network flow problems (Q1088884) (← links)
- Processor-efficient implementation of a maximum flow algorithm (Q1178222) (← links)
- On strongly polynomial variants of the networks simplex algorithm for the maximum flow problem (Q1180817) (← links)
- Lower bounds on the multiparty communication complexity (Q1267715) (← links)
- Order picking in an automatic warehouse: Solving online asymmetric TSPs (Q1304425) (← links)
- (Q1388048) (redirect page) (← links)
- Two problems concerning dynamic flows in node and arc capacitated networks (Q1388049) (← links)
- \(n\)-Tokyoites' loop-line commuter problem (Q1402069) (← links)
- Algorithms for minimum flows. (Q1566117) (← links)
- Sequential and parallel algorithms for minimum flows. (Q1880468) (← links)
- Dense induced bipartite subgraphs in triangle-free graphs (Q2003768) (← links)
- Synchronization techniques for chaotic communication systems. (Q2275410) (← links)
- Towards Erdős-Hajnal for graphs with no 5-hole (Q2288355) (← links)
- Vertex-flames in countable rooted digraphs preserving an Erdős-Menger separation for each vertex (Q2300160) (← links)
- Large hypertree width for sparse random hypergraphs (Q2343976) (← links)
- MC-based algorithm for a telecommunication network under node and budget constraints (Q2383899) (← links)
- Two new algorithms for the min-power broadcast problem in static ad hoc networks (Q2383911) (← links)
- Lower bounds for the game colouring number of partial \(k\)-trees and planar graphs (Q2427530) (← links)
- The smallest degree sum that yields potentially \(K_{r+1}-K_3\)-graphic sequences (Q2431967) (← links)
- Algebraic circuits (Q2452726) (← links)
- The threshold for the Erdős, Jacobson and Lehel conjecture to be true (Q2508636) (← links)
- Separation, dimension, and facet algorithms for node flow polyhedra (Q2638390) (← links)
- Distributed set-membership filtering for time-varying systems: a coding-decoding-based approach (Q2665174) (← links)
- (Q2711270) (← links)
- (Q2737536) (← links)
- (Q2754527) (← links)
- (Q2754571) (← links)
