grape < graph < graphg

Facettes :

List of bibliographic references

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

Ident.	Authors (with country if any)	Title
000661 (2004)	Serge Linckels [Allemagne] ; Christoph Meinel [Allemagne]	Automatic Interpretation of Natural Language for a Multimedia E-learning Tool
000833 (1993)	Martin Middendorf [Allemagne]	Minimum broadcast time is NP-complete for 3-regular planar graphs and deadline 2
000869 (1993)	Ralph B. Hansen	Sonar investigations in the Laghi di Monticchio (Mt. Vúlture, Italy)
000889 (1995)	Christoph Meinel ; Stephan Waack	Lower bounds for the majority communication complexity of various graph accessibility problems
000A11 (1992)	Klaus Jansen [Allemagne]	An approximation algorithm for the general routing problem
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
000D49 (1996)	C. Meinel [Allemagne] ; S. Waack [Allemagne]	Lower bounds for the majority communication complexity of various graph accessibility problems
000D57 (1996)	Klaus Jansen [Allemagne]	A rainbow about T -colorings for complete graphs
000E36 (1997)	Klaus Jansen [Allemagne]	Approximation results for the optimum cost chromatic partition problem
000F56 (1993)	Hans L. Bodlaender [Pays-Bas] ; Klaus Jansen [Allemagne]	On the complexity of scheduling incompatible jobs with unit-times
000F74 (1993)	Klaus Jansen [Allemagne] ; Petra Scheffler [Allemagne] ; Gerhard J. Woeginger [Autriche]	Maximum covering with D cliques
001036 (1994)	Klaus Jansen [Allemagne]	On the complexity of allocation problems in high-level synthesis
001043 (2006)	Pragya Agarwal [Royaume-Uni] ; Roderic Béra [Royaume-Uni] ; Christophe Claramunt [France]	A Social and Spatial Network Approach to the Investigation of Research Communities over the World Wide Web
001060 (1993)	Hans L. Bodlaender [Pays-Bas] ; Klaus Jansen [Allemagne] ; Gerhard J. Woeginger [Autriche]	Scheduling with incompatible jobs
001089 (1999)	Helmut Seidl [Allemagne] ; Andreas Neumann [Allemagne]	On Guarding Nested Fixpoints
001094 (2001)	Alberto Caprara [Italie] ; Alessandro Panconesi [Italie] ; Romeo Rizzi [Italie]	Packing Cycles and Cuts in Undirected Graphs
001171 (1995)	Hans L. Bodlaender [Pays-Bas] ; Klaus Jansen [Allemagne]	Restrictions of graph partition problems. Part I
001210 (1996)	Prosenjit Bose [Canada] ; Pedro Ramos [Espagne] ; Francisco Gomez [Espagne] ; Godfried Toussaint [Canada]	Drawing nice projections of objects in space
001275 (2001)	Alberto Caprara [Italie]	On the Practical Solution of the Reversal Median Problem
001283 (1996)	Christoph Meinel ; Stephan Waack	The “log rank” conjecture for modular communication complexity

---

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 "graph" 

HfdIndexSelect -h $EXPLOR_AREA/Data/Istex/Curation/AbsEn.i  \
                -Sk "graph" \
         | 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é=    graph
}}

---

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