algorithm < algorithms < alien

Facettes :

List of bibliographic references

Number of relevant bibliographic references: 21.
[0-20] [0 - 20][0 - 21][20-20][20-40]

Ident.	Authors (with country if any)	Title
000234 (2011)	Binh-Minh Bui-Xuan [Norvège] ; Pinar Heggernes [Norvège] ; Daniel Meister [Allemagne] ; Andrzej Proskurowski [États-Unis]	A Generic Approach to Decomposition Algorithms, with an Application to Digraph Decomposition
000315 (2010)	Henning Fernau [Allemagne] ; Serge Gaspers [France] ; Daniel Raible [Allemagne]	Exact and Parameterized Algorithms for Max Internal Spanning Tree
000418 (2009)	Stefan N Her [Allemagne] ; Daniel Schmitt [Allemagne]	Multi-core Implementations of Geometric Algorithms
000481 (2008)	Babak Mougouie [Allemagne]	Optimization Algorithms to Find Most Similar Deductive Consequences (MSDC)
000563 (2008)	Henning Fernau [Allemagne] ; Daniel Raible [Allemagne]	Exact Algorithms for Maximum Acyclic Subgraph on a Superclass of Cubic Graphs
000577 (2008)	Guoqiang Bai [Allemagne] ; Henning Fernau [Allemagne]	Constraint Bipartite Vertex Cover Simpler Exact Algorithms and Implementations
000698 (2006)	Henning Fernau [Allemagne]	edge dominating set : Efficient Enumeration-Based Exact Algorithms
000719 (2006)	Henning Fernau [Allemagne, Royaume-Uni]	Parameterized Algorithms for Hitting Set : The Weighted Case
000B34 (2002)	Christoph Meinel [Allemagne] ; Harald Sack [Allemagne] ; Arno Wagner [Suisse]	WWW.BDD-Portal.ORG: An Experimentation Platform for Binary Decision Diagram Algorithms
000B57 (2002)	Matthias B Sken [Allemagne] ; Stefan N Her [Allemagne]	GeoWin A Generic Tool for Interactive Visualization of Geometric Algorithms
000B73 (2002)	Christoph Meinel [Allemagne] ; Christian Stangier [Allemagne]	Algorithms and Heuristics in VLSI Design
000B74 (2002)	Eran Halperin [Israël] ; Uri Zwick [Israël]	A unified framework for obtaining improved approximation algorithms for maximum graph bisection problems
000E46 (1998)	P. Gritzmann [Allemagne] ; D. Prangenberg [Allemagne] ; S. De Vries [Allemagne] ; M. Wiegelmann [Allemagne]	Success and failure of certain reconstruction and uniqueness algorithms in discrete tomography
000F69 (1997)	Klaus Jansen [Allemagne] ; Sabine Öhring	Approximation Algorithms for Time Constrained Scheduling
001247 (1994)	Nguyen V. Thoai [Allemagne]	On the construction of test problems for concave minimization algorithms
001264 (1994)	Reiner Horst [Allemagne] ; Nguyen Van Thoai [Allemagne]	Constraint decomposition algorithms in global optimization
001338 (1993)	J. Huschens [Allemagne]	Exploiting additional structure in equality constrained optimization by structured SQP secant algorithms
001567 (1990)	Ekkehard W. Sachs [Allemagne]	Convergence of algorithms for perturbed optimization problems
001610 (1989)	R. Horst [Allemagne] ; N. V. Thoai [Viêt Nam]	Modification, implementation and comparison of three algorithms for globally solving linearly constrained concave minimization problems
001614 (1989)	Tran Vu Thieu [France]	Improvement and implementation of some algorithms for nonconvex optimization problems
001654 (1988)	Hoang Tuy [Viêt Nam] ; Reiner Horst [Allemagne]	Convergence and restart in branch-and-bound algorithms for global optimization. Application to concave minimization and D.C. Optimization problems

---

Pour manipuler ce document sous Unix (Dilib)

EXPLOR_STEP=$WICRI_ROOT/Wicri/Rhénanie/explor/UnivTrevesV1/Data/Istex/Checkpoint

HfdIndexSelect -h $EXPLOR_AREA/Data/Istex/Checkpoint/Title.i -k "algorithms" 

HfdIndexSelect -h $EXPLOR_AREA/Data/Istex/Checkpoint/Title.i  \
                -Sk "algorithms" \
         | HfdSelect -Kh $EXPLOR_AREA/Data/Istex/Checkpoint/biblio.hfd 

Pour mettre un lien sur cette page dans le réseau Wicri

{{Explor lien
   |wiki=    Wicri/Rhénanie
   |area=    UnivTrevesV1
   |flux=    Istex
   |étape=   Checkpoint
   |type=    indexItem
   |index=    Title.i
   |clé=    algorithms
}}

---

This area was generated with Dilib version V0.6.31. Data generation: Sat Jul 22 16:29:01 2017. Site generation: Wed Feb 28 14:55:37 2024