The following pages link to (Q4198056):
Displaying 50 items.
- On the query complexity of selecting minimal sets for monotone predicates (Q253999) (← links)
- Three-coloring triangle-free graphs on surfaces. I: Extending a coloring to a disk with one triangle. (Q290801) (← links)
- On the empirical scaling of run-time for finding optimal solutions to the travelling salesman problem (Q296693) (← links)
- On Lipschitz optimization based on gray-box piecewise linearization (Q304252) (← links)
- The complexity of priced control in elections (Q314424) (← links)
- Complexity results for storage loading problems with stacking constraints (Q321101) (← links)
- Integer programming models for feature selection: new extensions and a randomized solution algorithm (Q322475) (← links)
- Exact and heuristic approaches to solve the Internet shopping optimization problem with delivery costs (Q326228) (← links)
- Planar disjoint-paths completion (Q329285) (← links)
- On an exact method for the constrained shortest path problem (Q339592) (← links)
- Algorithms for the generalized weighted frequency assignment problem (Q339680) (← links)
- Vertex cover kernelization revisited. Upper and lower bounds for a refined parameter (Q372970) (← links)
- Black-box Trace\&Revoke codes (Q378263) (← links)
- Color-bounded hypergraphs. VI: Structural and functional jumps in complexity (Q383764) (← links)
- Finding paths with minimum shared edges (Q386426) (← links)
- Complexity of Canadian traveler problem variants (Q386993) (← links)
- A decomposition method for CNF minimality proofs (Q392185) (← links)
- A note on reverse scheduling with maximum lateness objective (Q398863) (← links)
- Motif matching using gapped patterns (Q401471) (← links)
- Minimal counterexamples for linear-time probabilistic verification (Q402125) (← links)
- Scheduling arc maintenance jobs in a network to maximize total flow over time (Q406493) (← links)
- Global quadratic minimization over bivalent constraints: necessary and sufficient global optimality condition (Q415403) (← links)
- Cooperative location games based on the minimum diameter spanning Steiner subgraph problem (Q423895) (← links)
- Improved estimation of duality gap in binary quadratic programming using a weighted distance measure (Q439501) (← links)
- Dynamic pricing problems with elastic demand (Q439910) (← links)
- A fuzzy genetic algorithm based on binary encoding for solving multidimensional knapsack problems (Q443043) (← links)
- New candidates welcome! Possible winners with respect to the addition of new candidates (Q449052) (← links)
- Formal context coverage based on isolated labels: an efficient solution for text feature extraction (Q454948) (← links)
- Subgraph isomorphism in graph classes (Q456655) (← links)
- Subexponential parameterized algorithms (Q458457) (← links)
- Reducing the number of required beds by rearranging the OR-schedule (Q480752) (← links)
- Scheduling of parallel machines with sequence-dependent batches and product incompatibilities in an automotive glass facility (Q490371) (← links)
- On the complexity of solving polytree-shaped limited memory influence diagrams with binary variables (Q490443) (← links)
- Google Scholar makes it hard -- the complexity of organizing one's publications (Q495683) (← links)
- Frequency-based similarity for parameterized sequences: formal framework, algorithms, and applications (Q497185) (← links)
- Reconstructing phylogenetic level-1 networks from nondense binet and trinet sets (Q513300) (← links)
- On making a distinguished vertex of minimum degree by vertex deletion (Q528861) (← links)
- Embedding processes in combinatorial game theory (Q534324) (← links)
- P systems with active membranes: Trading time for space (Q537818) (← links)
- Reconstructing polygons from scanner data (Q553352) (← links)
- Membership for growing context-sensitive grammars is polynomial (Q579948) (← links)
- The Banker's problem with precedences (Q582904) (← links)
- An exact method for the 2D guillotine strip packing problem (Q606187) (← links)
- The complexity of Boolean formula minimization (Q619911) (← links)
- Complexity of the traveling tournament problem (Q620946) (← links)
- Nash-solvable two-person symmetric cycle game forms (Q642972) (← links)
- Analysing DNA microarray data using Boolean techniques (Q646703) (← links)
- An exact algorithm for the maximum leaf spanning tree problem (Q653320) (← links)
- Restrictions of graph partition problems. I (Q672380) (← links)
- On approximating the longest path in a graph (Q679451) (← links)
