Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
15 | Ioan Alexandru Salomie, Adrian Munteanu 0001, Augustin Gavrilescu, Gauthier Lafruit, Peter Schelkens, Rudi Deklerck, Jan Cornelis 0001 |
MESHGRID-a compact, multiscalable and animation-friendly surface representation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Circuits Syst. Video Technol. ![In: IEEE Trans. Circuits Syst. Video Technol. 14(7), pp. 950-966, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
15 | Artur Czumaj, Hairong Zhao |
Fault-Tolerant Geometric Spanners. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Comput. Geom. ![In: Discret. Comput. Geom. 32(2), pp. 207-230, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
15 | Randall Dougherty, Vance Faber, Michael Murphy |
Unflippable Tetrahedral Complexes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Comput. Geom. ![In: Discret. Comput. Geom. 32(3), pp. 309-315, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
15 | James R. Ezick |
Resolving and applying constraint queries on context-sensitive analyses. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PASTE ![In: Proceedings of the 2004 ACM SIGPLAN-SIGSOFT Workshop on Program Analysis For Software Tools and Engineering, PASTE'04, Washington, DC, USA, June 7-8, 2004, pp. 2-7, 2004, ACM, 1-58113-910-1. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
static analysis, context-sensitive analysis |
15 | Dunja Mladenic, Marko Grobelnik |
Visualizing Very Large Graphs Using Clustering Neighborhoods. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Local Pattern Detection ![In: Local Pattern Detection, International Seminar, Dagstuhl Castle, Germany, April 12-16, 2004, Revised Selected Papers, pp. 89-97, 2004, Springer, 3-540-26543-0. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
15 | Erik D. Demaine, Fedor V. Fomin, Mohammad Taghi Hajiaghayi, Dimitrios M. Thilikos |
Subexponential parameterized algorithms on graphs of bounded-genus and H-minor-free graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2004, New Orleans, Louisiana, USA, January 11-14, 2004, pp. 830-839, 2004, SIAM, 0-89871-558-X. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP BibTeX RDF |
|
15 | Kathie Cameron, Elaine M. Eschen, Chính T. Hoàng, R. Sritharan |
The list partition problem for graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2004, New Orleans, Louisiana, USA, January 11-14, 2004, pp. 391-399, 2004, SIAM, 0-89871-558-X. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP BibTeX RDF |
|
15 | Magnús M. Halldórsson, Guy Kortsarz |
Multicoloring: Problems and Techniques. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS ![In: Mathematical Foundations of Computer Science 2004, 29th International Symposium, MFCS 2004, Prague, Czech Republic, August 22-27, 2004, Proceedings, pp. 25-41, 2004, Springer, 3-540-22823-3. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
15 | Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Leonid Khachiyan, Kazuhisa Makino |
Generating Paths and Cuts in Multi-pole (Di)graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS ![In: Mathematical Foundations of Computer Science 2004, 29th International Symposium, MFCS 2004, Prague, Czech Republic, August 22-27, 2004, Proceedings, pp. 298-309, 2004, Springer, 3-540-22823-3. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
15 | Edith Hemaspaandra, Lane A. Hemaspaandra, Stanislaw P. Radziszowski, Rahul Tripathi |
Complexity Results in Graph Reconstruction. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS ![In: Mathematical Foundations of Computer Science 2004, 29th International Symposium, MFCS 2004, Prague, Czech Republic, August 22-27, 2004, Proceedings, pp. 287-297, 2004, Springer, 3-540-22823-3. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
15 | Sudarshan Banerjee, Nikil D. Dutt |
Efficient search space exploration for HW-SW partitioning. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CODES+ISSS ![In: Proceedings of the 2nd IEEE/ACM/IFIP International Conference on Hardware/Software Codesign and System Synthesis, CODES+ISSS 2004, Stockholm, Sweden, September 8-10, 2004, pp. 122-127, 2004, ACM, 1-58113-937-3. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
HW-SW partitioning, dynamic cost function |
15 | Mikkel Thorup |
Fully-Dynamic All-Pairs Shortest Paths: Faster and Allowing Negative Cycles. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SWAT ![In: Algorithm Theory - SWAT 2004, 9th Scandinavian Workshop on Algorithm Theory, Humlebaek, Denmark, July 8-10, 2004, Proceedings, pp. 384-396, 2004, Springer, 3-540-22339-8. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
15 | Mee Yee Chan, Danny Z. Chen, Francis Y. L. Chin, Cao An Wang |
Construction of the Nearest Neighbor Embracing Graph of a Point Set. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SWAT ![In: Algorithm Theory - SWAT 2004, 9th Scandinavian Workshop on Algorithm Theory, Humlebaek, Denmark, July 8-10, 2004, Proceedings, pp. 150-160, 2004, Springer, 3-540-22339-8. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
15 | Klaus Volbert |
Experimental analysis of adjustable sectorized topologies for static ad hoc networks: extended abstract. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DIALM-POMC ![In: Proceedings of the DIALM-POMC Joint Workshop on Foundations of Mobile Computing, Philadelphia, PA, USA, October 1, 2004, pp. 102-111, 2004, ACM, 1-58113-921-7. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
algorithms, ad hoc networks, topology control, spanner |
15 | Erik D. Demaine, Fedor V. Fomin, Mohammad Taghi Hajiaghayi, Dimitrios M. Thilikos |
Bidimensional Parameters and Local Treewidth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LATIN ![In: LATIN 2004: Theoretical Informatics, 6th Latin American Symposium, Buenos Aires, Argentina, April 5-8, 2004, Proceedings, pp. 109-118, 2004, Springer, 3-540-21258-2. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
15 | Hayong Shin, Joon C. Park, Byoung Kyu Choi, Yun C. Chung, Siyoul Rhee |
Efficient Topology Construction from Triangle Soup. ![Search on Bibsonomy](Pics/bibsonomy.png) |
GMP ![In: 2004 Geometric Modeling and Processing (GMP 2004), Theory and Applications, 13-15 April 2004, Beijing, China, pp. 359-364, 2004, IEEE Computer Society, 0-7695-2078-2. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
15 | L. Sunil Chandran, N. S. Narayanaswamy |
On the Arrangement of Cliques in Chordal Graphs with Respect to the Cuts. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COCOON ![In: Computing and Combinatorics, 10th Annual International Conference, COCOON 2004, Jeju Island, Korea, August 17-20, 2004, Proceedings, pp. 151-160, 2004, Springer, 3-540-22856-X. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
15 | Venkatesh Raman 0001, Saket Saurabh 0001 |
Improved Parameterized Algorithms for Feedback Set Problems in Weighted Tournaments. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IWPEC ![In: Parameterized and Exact Computation, First International Workshop, IWPEC 2004, Bergen, Norway, September 14-17, 2004, Proceedings, pp. 260-270, 2004, Springer, 3-540-23071-8. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
15 | Satoshi Fujita, Yue Liang |
How to Provide Continuous Services by Mobile Servers in Communication Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PDCAT ![In: Parallel and Distributed Computing: Applications and Technologies, 5th International Conference, PDCAT 2004, Singapore, December 8-10, 2004, Proceedings, pp. 337-340, 2004, Springer, 3-540-24013-6. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
15 | Torsten Tholey |
A Dynamic Data Structure for Maintaining Disjoint Paths Information in Digraphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: Algorithms and Computation, 14th International Symposium, ISAAC 2003, Kyoto, Japan, December 15-17, 2003, Proceedings, pp. 565-574, 2003, Springer, 3-540-20695-7. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
15 | Shudong Jin, Azer Bestavros |
Small-World Characteristics of the Internet and Multicast Scaling. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MASCOTS ![In: 11th International Workshop on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems (MASCOTS 2003), 12-15 October 2003, Orlando, FL, USA, pp. 260-268, 2003, IEEE Computer Society, 0-7695-2039-1. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
15 | Kohei Muratani, Kokichi Sugihara |
Watermarking 3D Polygonal Meshes Using the Singular Spectrum Analysis. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IMA Conference on the Mathematics of Surfaces ![In: Mathematics of Surfaces, 10th IMA International Conference, Leeds, UK, September 15-17, 2003, Proceedings, pp. 85-98, 2003, Springer, 3-540-20053-3. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
15 | Mauritsius Tuga, Mirka Miller |
Delta-Optimum Exclusive Sum Labeling of Certain Graphs with Radius One. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IJCCGGT ![In: Combinatorial Geometry and Graph Theory, Indonesia-Japan Joint Conference,IJCCGGT 2003, Bandung, Indonesia, September 13-16, 2003, Revised Selected Papers, pp. 216-225, 2003, Springer, 3-540-24401-8. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
15 | Artur Czumaj, Hairong Zhao |
Fault-tolerant geometric spanners. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCG ![In: Proceedings of the 19th ACM Symposium on Computational Geometry, San Diego, CA, USA, June 8-10, 2003, pp. 1-10, 2003, ACM, 1-58113-663-3. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
fault-tolerant spanners, computational geometry, greedy algorithms, spanners |
15 | Abraham Flaxman, Alan M. Frieze, Trevor I. Fenner |
High Degree Vertices and Eigenvalues in the Preferential Attachment Graph. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RANDOM-APPROX ![In: Approximation, Randomization, and Combinatorial Optimization: Algorithms and Techniques, 6th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2003 and 7th International Workshop on Randomization and Approximation Techniques in Computer Science, RANDOM 2003, Princeton, NJ, USA, August 24-26, 2003, Proceedings, pp. 264-274, 2003, Springer, 3-540-40770-7. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
15 | Peter Lindstrom 0001 |
Out-of-core construction and visualization of multiresolution surfaces. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SI3D ![In: Proceedings of the 2003 Symposium on Interactive 3D Graphics, SI3D 2003, Monterey, California, USA, April 28-30, 2003, pp. 93-102, 2003, ACM, 1-58113-645-5. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
out-of-core algorithms, surface simplification, large-data visualization, view-dependent refinement |
15 | Janez Zaletelj, Jurij F. Tasic |
Optimization and Tracking of Polygon Vertices for Shape Coding. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CAIP ![In: Computer Analysis of Images and Patterns, 10th International Conference, CAIP 2003, Groningen, The Netherlands, August 25-27, 2003, Proceedings, pp. 418-425, 2003, Springer, 3-540-40730-8. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
15 | Laura A. Sanchis |
Experimental Analysis of Heuristic Algorithms for the Dominating Set Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 33(1), pp. 3-18, 2002. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
Approximation algorithms, Dominating set, Test cases |
15 | James Abello, Jeffrey L. Korn |
MGV: A System for Visualizing Massive Multidigraphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Vis. Comput. Graph. ![In: IEEE Trans. Vis. Comput. Graph. 8(1), pp. 21-38, 2002. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
visualization, graphs, hierarchies, External memory, massive data sets |
15 | Pierre-Marie Gandoin, Olivier Devillers |
Progressive lossless compression of arbitrary simplicial complexes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Graph. ![In: ACM Trans. Graph. 21(3), pp. 372-379, 2002. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
non manifold meshes, interactivity, coding, progressivity, mesh compression |
15 | Erik D. Demaine, Mohammad Taghi Hajiaghayi, Dimitrios M. Thilikos |
Exponential Speedup of Fixed-Parameter Algorithms on K3, 3-Minor-Free or K5-Minor-Free Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: Algorithms and Computation, 13th International Symposium, ISAAC 2002 Vancouver, BC, Canada, November 21-23, 2002, Proceedings, pp. 262-273, 2002, Springer, 3-540-00142-5. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
15 | Hiro Ito, Hiroshi Nagamochi, Yosuke Sugiyama, Masato Fujita |
File Transfer Tree Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: Algorithms and Computation, 13th International Symposium, ISAAC 2002 Vancouver, BC, Canada, November 21-23, 2002, Proceedings, pp. 441-452, 2002, Springer, 3-540-00142-5. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
15 | Takehiro Ito, Xiao Zhou 0001, Takao Nishizeki |
Partitioning Trees of Supply and Demand. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: Algorithms and Computation, 13th International Symposium, ISAAC 2002 Vancouver, BC, Canada, November 21-23, 2002, Proceedings, pp. 612-623, 2002, Springer, 3-540-00142-5. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
maximum partition problem, supply, algorithm, approximation, tree, demand, partition problem, FPTAS |
15 | Esther M. Arkin, Michael A. Bender, Sándor P. Fekete, Joseph S. B. Mitchell, Martin Skutella |
The freeze-tag problem: how to wake up a swarm of robots. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, January 6-8, 2002, San Francisco, CA, USA., pp. 568-577, 2002, ACM/SIAM, 0-89871-513-X. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP BibTeX RDF |
|
15 | Ojas Parekh |
Edge dominating and hypomatchable sets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, January 6-8, 2002, San Francisco, CA, USA., pp. 287-291, 2002, ACM/SIAM, 0-89871-513-X. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP BibTeX RDF |
|
15 | Chie Nara, Toshinori Sakai, Jorge Urrutia |
Maximal Number of Edges in Geometric Graphs without Convex Polygons. ![Search on Bibsonomy](Pics/bibsonomy.png) |
JCDCG ![In: Discrete and Computational Geometry, Japanese Conference, JCDCG 2002, Tokyo, Japan, December 6-9, 2002, Revised Papers, pp. 215-220, 2002, Springer, 3-540-20776-7. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
15 | Dániel Marx |
The Complexity of Tree Multicolorings. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS ![In: Mathematical Foundations of Computer Science 2002, 27th International Symposium, MFCS 2002, Warsaw, Poland, August 26-30, 2002, Proceedings, pp. 532-542, 2002, Springer, 3-540-44040-2. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
15 | Jan Kratochvíl, Zsolt Tuza, Margit Voigt |
On the b-Chromatic Number of Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science, 28th International Workshop, WG 2002, Cesky Krumlov, Czech Republic, June 13-15, 2002, Revised Papers, pp. 310-320, 2002, Springer, 3-540-00331-2. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
15 | Wen-Tzeng Huang, Woei-kae Chen, Chin-Hsing Chen |
On the Fault-Tolerant Pancyclicity of Crossed Cubes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICPADS ![In: 9th International Conference on Parallel and Distributed Systems, ICPADS 2002, Taiwan, ROC, December 17-20, 2002, pp. 483-488, 2002, IEEE Computer Society, 0-7695-1760-9. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
15 | Martin E. Dyer, Mark Jerrum, Eric Vigoda |
Rapidly Mixing Markov Chains for Dismantleable Constraint Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RANDOM ![In: Randomization and Approximation Techniques, 6th International Workshop, RANDOM 2002, Cambridge, MA, USA, September 13-15, 2002, Proceedings, pp. 68-77, 2002, Springer, 3-540-44147-6. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
15 | Shin Yoshizawa 0001, Alexander G. Belyaev, Hans-Peter Seidel |
A Simple Approach to Interactive Free-Form Shape Deformations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PG ![In: 10th Pacific Conference on Computer Graphics and Applications, PG 2002, Beijing, China, October 9-11, 2002, pp. 471-474, 2002, IEEE Computer Society, 0-7695-1784-6. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
constrained, directional and anisotropic free-form shape deformations |
15 | Yu-Liang Liu, Yue-Li Wang, D. J. Guan |
An Optimal Fault-Tolerant Routing Algorithm for Double-Loop Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Computers ![In: IEEE Trans. Computers 50(5), pp. 500-505, 2001. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
optimal message routing, fault-tolerant, Double-loop networks |
15 | Hao Li |
A Generalization of the Gallai-Roy Theorem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Graphs Comb. ![In: Graphs Comb. 17(4), pp. 681-685, 2001. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
15 | Xiao Zhou 0001, Takao Nishizeki |
Efficient Algorithms for Weighted Colorings of Series-Parallel Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: Algorithms and Computation, 12th International Symposium, ISAAC 2001, Christchurch, New Zealand, December 19-21, 2001, Proceedings, pp. 514-524, 2001, Springer, 3-540-42985-9. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
15 | Daniel Král, Jan Kratochvíl, Heinz-Jürgen Voss |
Complexity Note on Mixed Hypergraphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS ![In: Mathematical Foundations of Computer Science 2001, 26th International Symposium, MFCS 2001 Marianske Lazne, Czech Republic, August 27-31, 2001, Proceedings, pp. 474-486, 2001, Springer, 3-540-42496-2. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
15 | Jarek Rossignac |
3D Compression Made Simple: Edgebreaker with Zip&Wrap on a Corner-Table. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Shape Modeling International ![In: 2001 International Conference on Shape Modeling and Applications (SMI 2001), 7-11 May 2001, Genoa, Italy, pp. 278-, 2001, IEEE Computer Society, 0-7695-0853-7. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
15 | Yutaka Ohtake, Masahiro Horikawa, Alexander G. Belyaev |
Adaptive Smoothing Tangential Direction Fields on Polygonal Surfaces. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PG ![In: 9th Pacific Conference on Computer Graphics and Applications, PG 2001, Tokyo, Japan, October 16-18, 2001, pp. 189-197, 2001, IEEE Computer Society, 0-7695-1227-5. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
tangential direction fields, tracing streamlines, curvature features, non-photorealistic rendering, adaptive smoothing, polygonal surfaces |
15 | Volker Kaibel |
Reconstructing a Simple Polytope from Its Graph. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Combinatorial Optimization ![In: Combinatorial Optimization - Eureka, You Shrink!, Papers Dedicated to Jack Edmonds, 5th International Workshop, Aussois, France, March 5-9, 2001, Revised Papers, pp. 105-118, 2001, Springer, 3-540-00580-3. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
15 | Hristo N. Djidjev, Imrich Vrto |
An Improved Lower Bound for Crossing Numbers. ![Search on Bibsonomy](Pics/bibsonomy.png) |
GD ![In: Graph Drawing, 9th International Symposium, GD 2001 Vienna, Austria, September 23-26, 2001, Revised Papers, pp. 96-101, 2001, Springer, 3-540-43309-0. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
15 | Cristina G. Fernandes, Till Nierhoff |
The UPS Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: STACS 2001, 18th Annual Symposium on Theoretical Aspects of Computer Science, Dresden, Germany, February 15-17, 2001, Proceedings, pp. 238-246, 2001, Springer, 3-540-41695-1. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
15 | Jun-yong Noh, Ulrich Neumann |
Expression cloning. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIGGRAPH ![In: Proceedings of the 28th Annual Conference on Computer Graphics and Interactive Techniques, SIGGRAPH 2001, Los Angeles, California, USA, August 12-17, 2001, pp. 277-288, 2001, ACM, 1-58113-374-X. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
deformations, neural nets, facial animation, morphing |
15 | Xiao Zhou 0001, Takao Nishizeki |
Finding Independent Spanning Trees in Partial k-Trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: Algorithms and Computation, 11th International Conference, ISAAC 2000, Taipei, Taiwan, December 18-20, 2000, Proceedings, pp. 168-179, 2000, Springer, 3-540-41255-7. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
15 | Yu-Chung Lin, Su-Feng Tseng, Tsai-Ming Hsieh |
Cost minimization of partitioned circuits with complex resource constraints in FPGAs (poster abstract). ![Search on Bibsonomy](Pics/bibsonomy.png) |
FPGA ![In: Proceedings of the ACM/SIGDA International Symposium on Field Programmable Gate Arrays, FPGA 2000, Monterey, CA, USA, February 10-11, 2000, pp. 217, 2000, ACM, 1-58113-193-3. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
15 | Robert D. Carr, Toshihiro Fujito, Goran Konjevod, Ojas Parekh |
A 2 1/10-Approximation Algorithm for a Generalization of the Weighted Edge-Dominating Set Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: Algorithms - ESA 2000, 8th Annual European Symposium, Saarbrücken, Germany, September 5-8, 2000, Proceedings, pp. 132-142, 2000, Springer, 3-540-41004-X. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
15 | Sayaka Nagai, Shin-Ichi Nakano |
A Linear-Time Algorithm to Find Independent Spanning Trees in Maximal Planar Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science, 26th International Workshop, WG 2000, Konstanz, Germany, June 15-17, 2000, Proceedings, pp. 290-301, 2000, Springer, 3-540-41183-6. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
15 | Peter Lindstrom 0001 |
Out-of-core simplification of large polygonal models. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIGGRAPH ![In: Proceedings of the 27th Annual Conference on Computer Graphics and Interactive Techniques, SIGGRAPH 2000, New Orleans, LA, USA, July 23-28, 2000, pp. 259-262, 2000, ACM, 1-58113-208-5. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
15 | Toshimasa Ishii, Hiroshi Nagamochi |
On the Minimum Augmentation of an l-Connected Graph to a k-Connected Graph. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SWAT ![In: Algorithm Theory - SWAT 2000, 7th Scandinavian Workshop on Algorithm Theory, Bergen, Norway, July 5-7, 2000, Proceedings, pp. 286-299, 2000, Springer, 3-540-67690-2. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
15 | Zhi-Zhong Chen |
Approximation Algorithms for Independent Sets in Map Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COCOON ![In: Computing and Combinatorics, 6th Annual International Conference, COCOON 2000, Sydney, Australia, July 26-28, 2000, Proceedings, pp. 105-114, 2000, Springer, 3-540-67787-9. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
15 | Lata Narayanan, Jaroslav Opatrny |
Compact Routing on Chordal Rings of Degree 4. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 23(1), pp. 72-96, 1999. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
Compact routing schemes, Boolean routing, Distributed networks, Chordal rings, Interval routing |
15 | Dong-Gyu Park, Yang-Soo Kim, Hwan-Gue Cho |
Triangle Mesh Compression for Fast Rendering. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IV ![In: International Conference on Information Visualisation, IV 1999, London, England, UK, July 14-16, 1999, pp. 280-285, 1999, IEEE Computer Society, 0-7695-0210-5. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
Geometry Modeling, Mesh Compression, Realtime Rendering |
15 | Guangzheng Fei, Enhua Wu |
A real-time generation algorithm for progressive meshes in dynamic environments. ![Search on Bibsonomy](Pics/bibsonomy.png) |
VRST ![In: Proceedings of the ACM Symposium on Virtual Reality Software and Technology, VRST 1999, London, UK, December 20-22, 1999., pp. 178-179, 1999, ACM, 1-58113-141-0. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
15 | Igor Parfenoff, Florian Roussel, Irena Rusu |
Triangulated Neighbourhoods in C4-Free Berge Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science, 25th International Workshop, WG '99, Ascona, Switzerland, June 17-19, 1999, Proceedings, pp. 402-412, 1999, Springer, 3-540-66731-8. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
lexicographic breadth-first search, triangulated graph, perfectness |
15 | Michel X. Goemans, David P. Williamson |
Primal-Dual Approximation Algorithms for Feedback Problems in Planar Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comb. ![In: Comb. 18(1), pp. 37-59, 1998. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
AMS Subject Classification (1991) Classes: 90C27, 68Q25, 05C85 |
15 | Daniele Frigioni, Alberto Marchetti-Spaccamela, Umberto Nanni |
Semidynamic Algorithms for Maintaining Single-Source Shortest Path Trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 22(3), pp. 250-274, 1998. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
Single-source shortest path, Output complexity, Single-source shortest path, Output complexity, Key words, Dynamic algorithms, Dynamic algorithms, Amortized complexity, Amortized complexity |
15 | Sudipto Guha, Samir Khuller |
Approximation Algorithms for Connected Dominating Sets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 20(4), pp. 374-387, 1998. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
Approximation algorithms, Graph algorithms, Steiner trees, Dominating sets |
15 | H. S. M. Coxeter |
Seven Cubes and Ten 24-Cells. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Comput. Geom. ![In: Discret. Comput. Geom. 19(2), pp. 151-157, 1998. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
|
15 | Avner Shapiro, Ayellet Tal |
Polyhedron realization for shape transformation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Vis. Comput. ![In: Vis. Comput. 14(8/9), pp. 429-444, 1998. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
Polyhedron realization, Correspondence, Metamorphosis, Shape transformation |
15 | Hiroshi Nagamochi, Peter Eades |
Edge-Splitting and Edge-Connectivity Augmentation in Planar Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPCO ![In: Integer Programming and Combinatorial Optimization, 6th International IPCO Conference, Houston, Texas, USA, June 22-24, 1998, Proceedings, pp. 96-111, 1998, Springer, 3-540-64590-X. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
|
15 | Kazuyuki Miura, Daishiro Takahashi, Shin-Ichi Nakano, Takao Nishizeki |
A Linear-Time Algorithm to Find Four Independent Spanning Trees in Four-Connected Planar Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science, 24th International Workshop, WG '98, Smolenice Castle, Slovak Republic, June 18-20, 1998, Proceedings, pp. 310-323, 1998, Springer, 3-540-65195-0. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
|
15 | Maurizio Talamo, Paola Vocca |
Compact Implicit Representation of Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science, 24th International Workshop, WG '98, Smolenice Castle, Slovak Republic, June 18-20, 1998, Proceedings, pp. 164-176, 1998, Springer, 3-540-65195-0. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
|
15 | Weifa Liang, George Havas |
NC Approximation Algorithms for 2-Connectivity Augmentation in a Graph. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Euro-Par ![In: Euro-Par '97 Parallel Processing, Third International Euro-Par Conference, Passau, Germany, August 26-29, 1997, Proceedings, pp. 430-439, 1997, Springer, 3-540-63440-1. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
|
15 | Jan Kratochvíl, Andrzej Proskurowski, Jan Arne Telle |
Complexity of Colored Graph Covers I. Colored Directed Multigraphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science, 23rd International Workshop, WG '97, Berlin, Germany, June 18-20, 1997, Proceedings, pp. 242-257, 1997, Springer, 3-540-63757-5. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
|
15 | Susanne E. Hambrusch, Hyeong-Seok Lim |
Minimizing Broadcast Costs under Edge Reductions in Tree Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICPADS ![In: 1997 International Conference on Parallel and Distributed Systems (ICPADS '97), 11-13 December 1997, Seoul, Korea, Proceedings, pp. 188-195, 1997, IEEE Computer Society, 0-8186-8227-2. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
|
15 | Hsiao-Feng Steven Chen, D. T. Lee |
A faster algorithm for rubber-band equivalent transformation for planar VLSI layouts. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. ![In: IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 15(2), pp. 217-227, 1996. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
|
15 | Michel X. Goemans, David P. Williamson |
Primal-Dual Approximation Algorithms for Feedback Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPCO ![In: Integer Programming and Combinatorial Optimization, 5th International IPCO Conference, Vancouver, British Columbia, Canada, June 3-5, 1996, Proceedings, pp. 147-161, 1996, Springer, 3-540-61310-2. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
|
15 | Yuichi Asahiro, Kazuo Iwama, Hisao Tamaki, Takeshi Tokuyama |
Greedily Finding a Dense Subgraph. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SWAT ![In: Algorithm Theory - SWAT '96, 5th Scandinavian Workshop on Algorithm Theory, Reykjavík, Iceland, July 3-5, 1996, Proceedings, pp. 136-148, 1996, Springer, 3-540-61422-2. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
|
15 | Monika Rauch Henzinger, Jan Arne Telle |
Faster Algorithms for the Nonemptiness of Streett Automata and for Communication Protocol Pruning. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SWAT ![In: Algorithm Theory - SWAT '96, 5th Scandinavian Workshop on Algorithm Theory, Reykjavík, Iceland, July 3-5, 1996, Proceedings, pp. 16-27, 1996, Springer, 3-540-61422-2. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
|
15 | Monika Rauch Henzinger |
Approximating Minimum Cuts under Insertions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 22nd International Colloquium, ICALP95, Szeged, Hungary, July 10-14, 1995, Proceedings, pp. 280-291, 1995, Springer, 3-540-60084-1. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
|
15 | Gerard J. Chang, C. Pandu Rangan, Satyan R. Coorg |
Weighted Independent Perfect Domination on Cocomparability Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: Algorithms and Computation, 4th International Symposium, ISAAC '93, Hong Kong, December 15-17, 1993, Proceedings, pp. 506-514, 1993, Springer, 3-540-57568-5. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
independent perfect domination, cocomparability graph, interval graph |
15 | Sándor P. Fekete, William R. Pulleyblank |
Area Optimization of Simple Polygons. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCG ![In: Proceedings of the Ninth Annual Symposium on Computational GeometrySan Diego, CA, USA, May 19-21, 1993, pp. 173-182, 1993, ACM, 0-89791-582-8. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
|
15 | Koichi Wada 0001, Kimio Kawaguchi |
Efficient Algorithms for Tripartitioning Triconnected Graphs and 3-Edge-Connected Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science, 19th International Workshop, WG '93, Utrecht, The Netherlands, June 16-18, 1993, Proceedings, pp. 132-143, 1993, Springer, 3-540-57899-4. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
|
15 | Derek G. Corneil, Stephan Olariu, Lorna Stewart |
Asteroidal Triple-Free Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science, 19th International Workshop, WG '93, Utrecht, The Netherlands, June 16-18, 1993, Proceedings, pp. 211-224, 1993, Springer, 3-540-57899-4. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
|
15 | Stefan Kahrs |
Unlimp, Uniqueness as a Leitmotiv for Implementation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PLILP ![In: Programming Language Implementation and Logic Programming, 4th International Symposium, PLILP'92, Leuven, Belgium, August 26-28, 1992, Proceedings, pp. 115-129, 1992, Springer, 3-540-55844-6. The full citation details ...](Pics/full.jpeg) |
1992 |
DBLP DOI BibTeX RDF |
|
15 | Hans L. Bodlaender |
Kayles on Special Classes of Graphs - An Application of Sprague-Grundy Theory. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science, 18th International Workshop, WG '92, Wiesbaden-Naurod, Germany, June 19-20, 1992, Proceedings, pp. 90-102, 1992, Springer, 3-540-56402-0. The full citation details ...](Pics/full.jpeg) |
1992 |
DBLP DOI BibTeX RDF |
|
15 | Ton Kloks, Hans L. Bodlaender |
Testing Superperfection of k-Trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SWAT ![In: Algorithm Theory - SWAT '92, Third Scandinavian Workshop on Algorithm Theory, Helsinki, Finland, July 8-10, 1992, Proceedings, pp. 292-303, 1992, Springer, 3-540-55706-7. The full citation details ...](Pics/full.jpeg) |
1992 |
DBLP DOI BibTeX RDF |
|
15 | Anindo Bagchi, Edward F. Schmeichel, S. Louis Hakimi |
Parallel algorithms for information dissemination by packets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SPDP ![In: Proceedings of the Third IEEE Symposium on Parallel and Distributed Processing, SPDP 1991, 2-5 December 1991, Dallas, Texas, USA, pp. 274-281, 1991, IEEE Computer Society, 0-8186-2310-1. The full citation details ...](Pics/full.jpeg) |
1991 |
DBLP DOI BibTeX RDF |
|
15 | W. T. Liou, Jimmy J. M. Tan, Richard C. T. Lee |
Minimum rectangular partition problem for simple rectilinear polygons. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. ![In: IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 9(7), pp. 720-733, 1990. The full citation details ...](Pics/full.jpeg) |
1990 |
DBLP DOI BibTeX RDF |
|
15 | Qingzhou Wang, Kam-Hoi Cheng |
Parallel time complexity of a heuristic algorithm for the k-center problem with usage weights. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SPDP ![In: Proceedings of the Second IEEE Symposium on Parallel and Distributed Processing, SPDP 1990, Dallas, Texas, USA, December 9-13, 1990., pp. 254-257, 1990, IEEE Computer Society, 0-8186-2087-0. The full citation details ...](Pics/full.jpeg) |
1990 |
DBLP DOI BibTeX RDF |
|
15 | Youn-Sik Hong, Kyu Ho Park, Myunghwan Kim 0001 |
A heuristic algorithm for ordering the columns in one-dimensional logica arrays. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. ![In: IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 8(5), pp. 547-562, 1989. The full citation details ...](Pics/full.jpeg) |
1989 |
DBLP DOI BibTeX RDF |
|
15 | Garry L. Johns, Tai-Chi Lee |
S-Distance in Trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Great Lakes Computer Science Conference ![In: Computing in the 90's, The First Great Lakes Computer Science Conference, Kalamazzo, Michigan, USA, October 18-20, 1989, Proceedings, pp. 29-33, 1989, Springer, 3-540-97628-0. The full citation details ...](Pics/full.jpeg) |
1989 |
DBLP DOI BibTeX RDF |
|
15 | Lenwood S. Heath, Arnold L. Rosenberg, Bruce T. Smith |
The physical mapping problem for parallel architectures. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 35(3), pp. 603-634, 1988. The full citation details ...](Pics/full.jpeg) |
1988 |
DBLP DOI BibTeX RDF |
|
15 | Andrew V. Goldberg, Robert Endre Tarjan |
A new approach to the maximum-flow problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 35(4), pp. 921-940, 1988. The full citation details ...](Pics/full.jpeg) |
1988 |
DBLP DOI BibTeX RDF |
|
15 | Burkhard Monien, Ivan Hal Sudborough |
Min Cut is NP-Complete for Edge Weigthed Trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 13th International Colloquium, ICALP86, Rennes, France, July 15-19, 1986, Proceedings, pp. 265-274, 1986, Springer, 3-540-16761-7. The full citation details ...](Pics/full.jpeg) |
1986 |
DBLP DOI BibTeX RDF |
|
14 | Benjamin Doerr, Daniel Johannsen |
Edge-based representation beats vertex-based representation in shortest path problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
GECCO ![In: Genetic and Evolutionary Computation Conference, GECCO 2010, Proceedings, Portland, Oregon, USA, July 7-11, 2010, pp. 759-766, 2010, ACM, 978-1-4503-0072-8. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
evolutionary algorithm, shortest path, runtime analysis |
14 | Frank Thomson Leighton, Ankur Moitra |
Extensions and limits to vertex sparsification. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 42nd ACM Symposium on Theory of Computing, STOC 2010, Cambridge, Massachusetts, USA, 5-8 June 2010, pp. 47-56, 2010, ACM, 978-1-4503-0050-6. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
oblivious reductions, multicommodity flow |
14 | Enrico Malaguti |
The Vertex Coloring Problem and its generalizations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
4OR ![In: 4OR 7(1), pp. 101-104, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
MSC classification (2000) 05C15, 05C85 |
14 | Fedor V. Fomin, Serge Gaspers, Saket Saurabh 0001, Stéphan Thomassé |
A Linear Vertex Kernel for Maximum Internal Spanning Tree. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: Algorithms and Computation, 20th International Symposium, ISAAC 2009, Honolulu, Hawaii, USA, December 16-18, 2009. Proceedings, pp. 275-282, 2009, Springer, 978-3-642-10630-9. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
14 | Markus Chimani, Carsten Gutwenger, Petra Mutzel, Christian Wolf 0004 |
Inserting a vertex into a planar graph. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2009, New York, NY, USA, January 4-6, 2009, pp. 375-383, 2009, SIAM, 978-0-89871-680-1. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
14 | Riccardo Dondi, Guillaume Fertin, Stéphane Vialette |
Maximum Motif Problem in Vertex-Colored Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CPM ![In: Combinatorial Pattern Matching, 20th Annual Symposium, CPM 2009, Lille, France, June 22-24, 2009, Proceedings, pp. 221-235, 2009, Springer, 978-3-642-02440-5. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
14 | Carsten Witt |
Greedy Local Search and Vertex Cover in Sparse Random Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
TAMC ![In: Theory and Applications of Models of Computation, 6th Annual Conference, TAMC 2009, Changsha, China, May 18-22, 2009. Proceedings, pp. 410-419, 2009, Springer, 978-3-642-02016-2. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|