|
|
Venues (Conferences, Journals, ...)
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 27 occurrences of 27 keywords
|
|
|
Results
Found 10 publication records. Showing 10 according to the selection in the facets
Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
15 | Jaroslav Nesetril, Patrice Ossona de Mendez |
Linear time low tree-width partitions and algorithmic consequences. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 38th Annual ACM Symposium on Theory of Computing, Seattle, WA, USA, May 21-23, 2006, pp. 391-400, 2006, ACM, 1-59593-134-1. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
bounded expansion, fraternal augmentation, coloration, first order logic, subgraph isomorphism, tree-width, graph minor |
11 | Holger Keding, Markus Willems, Martin Coors, Heinrich Meyr |
FRIDGE: A Fixed-Point Design and Simulation Environment. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DATE ![In: 1998 Design, Automation and Test in Europe (DATE '98), February 23-26, 1998, Le Palais des Congrès de Paris, Paris, France, pp. 429-435, 1998, IEEE Computer Society, 0-8186-8359-7. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
FRIDGE, interpolative approach, fixed-C, assignment-time instantiation, simulation, design, interpolation, quantization, fixed-point |
8 | Sanjeev Arora |
Polynomial Time Approximation Schemes for Euclidean Traveling Salesman and other Geometric Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 45(5), pp. 753-782, 1998. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
approximation algorithms, matching, traveling salesman problem, network design, Steiner problem |
5 | Christian Schindelhauer, Klaus Volbert, Martin Ziegler 0001 |
Spanners, Weak Spanners, and Power Spanners for Wireless Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: Algorithms and Computation, 15th International Symposium, ISAAC 2004, Hong Kong, China, December 20-22, 2004, Proceedings, pp. 805-821, 2004, Springer, 3-540-24131-0. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
5 | Sanjeev Arora |
Nearly Linear Time Approximation Schemes for Euclidean TSP and other Geometric Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 38th Annual Symposium on Foundations of Computer Science, FOCS '97, Miami Beach, Florida, USA, October 19-22, 1997, pp. 554-563, 1997, IEEE Computer Society, 0-8186-8197-7. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
randomized polynomial time approximation, Euclidean TSP, optimum traveling salesman tour, Euclidean problems, nearly-linear time approximation, randomized, Steiner Tree, parallel implementations, randomised algorithms, geometric problems |
3 | Guillermo Durán, Min Chih Lin, Sergio Mera, Jayme Luiz Szwarcfiter |
Algorithms for finding clique-transversals of graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Ann. Oper. Res. ![In: Ann. Oper. Res. 157(1), pp. 37-45, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Clique-transversals, Helly circular-arc graphs, free circular-arc graphs, Algorithms, Circular-arc graphs |
3 | Carlo Filippi, Alessandro Agnetis |
An asymptotically exact algorithm for the high-multiplicity bin packing problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Math. Program. ![In: Math. Program. 104(1), pp. 21-37, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classification (2000) 20E28, 20G40, 20C20 |
3 | Nelly Litvak, Uri Yechiali |
Routing in Queues with Delayed Information. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Queueing Syst. Theory Appl. ![In: Queueing Syst. Theory Appl. 43(1-2), pp. 147-165, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
delayed information, multiple-server queues, routing, decomposition, vacation models |
3 | Arfst Nickelsen |
Deciding Verbose Languages with Linear Advice. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS ![In: Mathematical Foundations of Computer Science 1997, 22nd International Symposium, MFCS'97, Bratislava, Slovakia, August 25-29, 1997, Proceedings, pp. 438-447, 1997, Springer, 3-540-63437-1. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
|
3 | Mario Alberto López, Ravi Janardan, Sartaj K. Sahni |
Efficient net extraction for restricted orientation designs [VLSI layout]. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. ![In: IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 15(9), pp. 1151-1159, 1996. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
|
Displaying result #1 - #10 of 10 (100 per page; Change: )
|
|