The following pages link to (Q3651735):
Displaying 50 items.
- Generalised cumulative arrays in secret sharing (Q851749) (← links)
- Optimisation of timetable-based, stochastic transit assignment models based on MSA (Q867561) (← links)
- Hierarchical characterization of complex networks (Q867697) (← links)
- Active learning for semi-supervised clustering based on locally linear propagation reconstruction (Q889394) (← links)
- Orders on intervals over partially ordered sets: extending Allen's algebra and interval graph results. (Q889876) (← links)
- On the negative cost girth problem in planar networks (Q891820) (← links)
- \(n\)-step cycle inequalities: facets for continuous multi-mixing set and strong cuts for multi-module capacitated lot-sizing problem (Q896282) (← links)
- Bichain graphs: geometric model and universal graphs (Q896651) (← links)
- A tie-break model for graph search (Q896657) (← links)
- Strong connectivity of sensor networks with double antennae (Q896697) (← links)
- A new preference handling technique for interactive multiobjective optimization without trading-off (Q897046) (← links)
- Range queries on uncertain data (Q897858) (← links)
- A linear characterization of the switching dynamic behavior of timed continuous Petri nets with structural conflicts (Q901256) (← links)
- Basic principles of the synthesis of logical-linguistic models (Q904442) (← links)
- An efficient tree decomposition method for permanents and mixed discriminants (Q905704) (← links)
- Algorithms and complexity analysis for robust single-machine scheduling problems (Q906553) (← links)
- Approximation schemes for packing with item fragmentation (Q927410) (← links)
- Two dimensional aggregation procedure: An alternative to the matrix algebraic algorithm (Q928164) (← links)
- Characterizing sets of jobs that admit optimal greedy-like algorithms (Q964871) (← links)
- A decomposition scheme for single stage scheduling problems (Q983632) (← links)
- Combinatorial optimization under uncertainty (Q1008321) (← links)
- Fast algorithms for the density finding problem (Q1024779) (← links)
- On the complexities of selected satisfiability and equivalence queries over Boolean formulas and inclusion queries over hulls (Q1040040) (← links)
- Extending STL with efficient data structures (Q1130172) (← links)
- Formal derivation of graph algorithmic programs using partition-and-recur (Q1273073) (← links)
- Transforming binary sequences using priority queues (Q1311418) (← links)
- Global minimum potential energy conformations of small molecules (Q1319003) (← links)
- A two-level metaheuristic for the all colors shortest path problem (Q1616945) (← links)
- Statistical mechanics of ontology based annotations (Q1618908) (← links)
- Improved upper bounds in the moving sofa problem (Q1621477) (← links)
- Randomized OBDD-based graph algorithms (Q1625606) (← links)
- Bottleneck bichromatic full Steiner trees (Q1628678) (← links)
- HV-planarity: algorithms and complexity (Q1628786) (← links)
- Computing simple paths from given points inside a polygon (Q1630775) (← links)
- Dynamic conflict-free colorings in the plane (Q1631778) (← links)
- Empirical analysis of algorithms for the shortest negative cost cycle problem (Q1634773) (← links)
- And/or-convexity: a graph convexity based on processes and deadlock models (Q1639288) (← links)
- Fair priority scheduling (FPS): a process scheduling algorithm based on skip ring data structure (Q1640419) (← links)
- Lagrangian numerical methods for ocean biogeochemical simulations (Q1640855) (← links)
- Parameterized complexity and approximation issues for the colorful components problems (Q1643155) (← links)
- The UMP exact test and the confidence interval for person parameters in IRT models (Q1643442) (← links)
- The \(S\)-\textsc{labeling} problem: an algorithmic tour (Q1647835) (← links)
- A theoretical framework for cardinality-based feature models: the semantics and computational aspects (Q1647962) (← links)
- A novel discretization scheme for the close enough traveling salesman problem (Q1652067) (← links)
- A two-resource allocation algorithm with an application to large-scale zero-sum defensive games (Q1652078) (← links)
- Optimal distributed task scheduling in volunteer clouds (Q1652245) (← links)
- Supplier selection and order allocation with green criteria: an MCDM and multi-objective optimization approach (Q1652253) (← links)
- A strongly polynomial contraction-expansion algorithm for network flow problems (Q1652310) (← links)
- GLNS: an effective large neighborhood search heuristic for the generalized traveling salesman problem (Q1652391) (← links)
- Generalization of the restricted planar location problems: unified metaheuristic algorithms (Q1654346) (← links)
