graphing < graphs < grasp

Facettes :

List of bibliographic references

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

Ident.	Authors (with country if any)	Title
000775 (2004)	Michael Sampels [Belgique]	On Generalized Moore Digraphs
000833 (1993)	Martin Middendorf [Allemagne]	Minimum broadcast time is NP-complete for 3-regular planar graphs and deadline 2
000888 (2005)	Makoto Iwayama [Japon] ; Yoshiki Niwa [Japon]	Just-in-Time Interactive Document Search
000B53 (1993)	Jordan Gergov ; Christoph Meinel	Analysis and manipulation of Boolean functions in terms of decision graphs
000B57 (1995)	Christoph Meinel ; Stephan Waack	Lower bounds for the modular communication complexity of various graph accessibility problems
000D19 (2002)	Stefan N Her [Allemagne] ; Oliver Zlotowski [Allemagne]	Design and Implementation of Efficient Data Types for Static Graphs
000E36 (1997)	Klaus Jansen [Allemagne]	Approximation results for the optimum cost chromatic partition problem
000E52 (2006)	Henning Fernau [Allemagne]	edge dominating set : Efficient Enumeration-Based Exact Algorithms
000F73 (2010)	Ljiljana Brankovic [Australie] ; Henning Fernau [Allemagne]	Combining Two Worlds: Parameterised Approximation for Vertex Cover
000F74 (1993)	Klaus Jansen [Allemagne] ; Petra Scheffler [Allemagne] ; Gerhard J. Woeginger [Autriche]	Maximum covering with D cliques
001060 (1993)	Hans L. Bodlaender [Pays-Bas] ; Klaus Jansen [Allemagne] ; Gerhard J. Woeginger [Autriche]	Scheduling with incompatible jobs
001094 (2001)	Alberto Caprara [Italie] ; Alessandro Panconesi [Italie] ; Romeo Rizzi [Italie]	Packing Cycles and Cuts in Undirected Graphs
001097 (1994)	Klaus Jansen [Allemagne] ; Haiko Müller [Allemagne]	The minimum broadcast time problem
001105 (1993)	Klaus Jansen ; Petra Scheffler	Generalized coloring for tree-like graphs
001131 (1997)	Klaus Jansen [Allemagne] ; Sabine Öhring	Approximation Algorithms for Time Constrained Scheduling
001152 (2002)	Markus Müller-Olm [Allemagne] ; Helmut Seidl [Allemagne]	Polynomial Constants Are Decidable
001171 (1995)	Hans L. Bodlaender [Pays-Bas] ; Klaus Jansen [Allemagne]	Restrictions of graph partition problems. Part I
001177 (1995)	Klaus Jansen [Allemagne] ; Haiko Müller [Allemagne]	The minimum broadcast time problem for several processor networks
001210 (1996)	Prosenjit Bose [Canada] ; Pedro Ramos [Espagne] ; Francisco Gomez [Espagne] ; Godfried Toussaint [Canada]	Drawing nice projections of objects in space
001267 (2008)	M. Burch [Allemagne] ; S. Diehl [Allemagne]	TimeRadarTrees: Visualizing Dynamic Compound Digraphs
001309 (1997)	Klaus Jansen [Allemagne]	The optimum cost chromatic partition problem

---

Pour manipuler ce document sous Unix (Dilib)

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

HfdIndexSelect -h $EXPLOR_AREA/Data/Istex/Curation/AbsEn.i -k "graphs" 

HfdIndexSelect -h $EXPLOR_AREA/Data/Istex/Curation/AbsEn.i  \
                -Sk "graphs" \
         | HfdSelect -Kh $EXPLOR_AREA/Data/Istex/Curation/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=   Curation
   |type=    indexItem
   |index=    AbsEn.i
   |clé=    graphs
}}

---

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