|
|
Venues (Conferences, Journals, ...)
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 466 occurrences of 324 keywords
|
|
|
Results
Found 729 publication records. Showing 729 according to the selection in the facets
Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
104 | Sergei L. Bezrukov, Robert Elsässer, Burkhard Monien, Robert Preis, Jean-Pierre Tillich |
New Spectral Lower Bounds on the Bisection Width of 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. 23-34, 2000, Springer, 3-540-41183-6. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
93 | Piotr Berman, Marek Karpinski |
Approximation Hardness of Bounded Degree MIN-CSP and MIN-BISECTION. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 29th International Colloquium, ICALP 2002, Malaga, Spain, July 8-13, 2002, Proceedings, pp. 623-632, 2002, Springer, 3-540-43864-5. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
86 | Jacob G. Martin |
Spectral techniques for graph bisection in genetic algorithms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
GECCO ![In: Genetic and Evolutionary Computation Conference, GECCO 2006, Proceedings, Seattle, Washington, USA, July 8-12, 2006, pp. 1249-1256, 2006, ACM, 1-59593-186-4. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
genetic engineering, reduced rank approximation, spectral bisection, genetic algorithm, singular value decomposition, graph partitioning, graph bisection |
79 | Bobby Bodenheimer, Jingjing Meng, Haojie Wu, Gayathri Narasimham, Björn Rump, Timothy P. McNamara, Thomas H. Carr, John J. Rieser |
Distance estimation in virtual and real environments using bisection. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APGV ![In: Proceedings of the 4th Symposium on Applied Perception in Graphics and Visualization, APGV 2007, Tübingen, Germany, July 25-27, 2007, pp. 35-40, 2007, ACM, 978-1-59593-670-7. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
distance bisection, virtual reality (VR), distance perception, fractionation |
79 | Burkhard Monien, Robert Preis |
Upper Bounds on the Bisection Width of 3- and 4-Regular Graphs. ![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. 524-536, 2001, Springer, 3-540-42496-2. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
local improvement, graph partitioning, regular graphs, bisection width |
76 | Torsten Hoefler, Timo Schneider, Andrew Lumsdaine |
Multistage switches are not crossbars: Effects of static routing in high-performance networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CLUSTER ![In: Proceedings of the 2008 IEEE International Conference on Cluster Computing, 29 September - 1 October 2008, Tsukuba, Japan, pp. 116-125, 2008, IEEE Computer Society, 978-1-4244-2640-9. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
72 | Burkhard Monien, Stefan Schamberger |
Graph Partitioning with the Party Library: Helpful-Sets in Practice. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SBAC-PAD ![In: 16th Symposium on Computer Architecture and High Performance Computing (SBAC-PAD 2004), 27-29 October 2004, Foz do Iguacu, Brazil, pp. 198-205, 2004, IEEE Computer Society, 0-7695-2240-8. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
Heuristic Graph Partitioning, Helpful-Sets, Recursive bisection |
71 | Claudio Gutierrez 0001, Flavio Gutierrez, Maria-Cecilia Rivara |
A Geometric Approach to the Bisection Method. ![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. 172-180, 2004, Springer, 3-540-21258-2. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
71 | Klaus Jansen, Marek Karpinski, Andrzej Lingas, Eike Seidel |
Polynomial Time Approximation Schemes for MAX-BISECTION on Planar and Geometric Graphs. ![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. 365-375, 2001, Springer, 3-540-41695-1. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
61 | Lali Barrière, Josep Fàbrega |
Edge-Bisection of Chordal Rings. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS ![In: Mathematical Foundations of Computer Science 2000, 25th International Symposium, MFCS 2000, Bratislava, Slovakia, August 28 - September 1, 2000, Proceedings, pp. 162-171, 2000, Springer, 3-540-67901-4. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
61 | Andrew E. Caldwell, Andrew B. Kahng, Igor L. Markov |
Can recursive bisection alone produce routable placements? ![Search on Bibsonomy](Pics/bibsonomy.png) |
DAC ![In: Proceedings of the 37th Conference on Design Automation, Los Angeles, CA, USA, June 5-9, 2000., pp. 477-482, 2000, ACM. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
61 | Ralf Klasing |
The Relationship Between Gossiping in Vertex-Disjoint Paths Mode and Bisection Width. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS ![In: Mathematical Foundations of Computer Science 1994, 19th International Symposium, MFCS'94, Kosice, Slovakia, August 22 - 26, 1994, Proceedings, pp. 473-483, 1994, Springer, 3-540-58338-6. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
|
57 | Bernd Hamann, Benjamin W. Jordan, David F. Wiley |
On a Construction of a Hierarchy of Best Linear Spline Approximations Using Repeated Bisection. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Vis. Comput. Graph. ![In: IEEE Trans. Vis. Comput. Graph. 5(1), pp. 30-46, 1999. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
linear spline, visualization, Approximation, triangulation, spline, unstructured grid, hierarchical representation, scattered data, bisection, multiresolution method, best approximation, grid generation |
54 | Betsy Williams, Derek Johnson, Lucy R. Shores, Gayathri Narasimham |
Distance perception in virtual environments. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APGV ![In: Proceedings of the 5th Symposium on Applied Perception in Graphics and Visualization, APGV 2008, Los Angeles, California, USA, August 9-10, 2008, pp. 193, 2008, ACM, 978-1-59593-981-4. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
54 | Ted Carson, Russell Impagliazzo |
Hill-climbing finds random planted bisections. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, January 7-9, 2001, Washington, DC, USA., pp. 903-909, 2001, ACM/SIAM, 0-89871-490-7. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP BibTeX RDF |
|
54 | Graham Wood |
Bisection Global Optimization Methods. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Encyclopedia of Optimization ![In: Encyclopedia of Optimization, Second Edition, pp. 294-297, 2009, Springer, 978-0-387-74758-3. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Lipschitz continuity, Multidimensional bisection, Epigraph, Linear convergence, System, Reduction, Tiling, Bisection, Simplex, Elimination, Bracket |
54 | Uriel Feige, Robert Krauthgamer |
A polylogarithmic approximation of the minimum bisection. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 41st Annual Symposium on Foundations of Computer Science, FOCS 2000, 12-14 November 2000, Redondo Beach, California, USA, pp. 105-115, 2000, IEEE Computer Society, 0-7695-0850-2. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
polylogarithmic approximation, minimum bisection, vertex partitioning, bisection cost, computational complexity, complexity, computational geometry, graph theory, graph, edges, vertices, approximation ratio |
54 | Mark Jerrum, Gregory B. Sorkin |
Simulated Annealing for Graph Bisection ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 34th Annual Symposium on Foundations of Computer Science, Palo Alto, California, USA, 3-5 November 1993, pp. 94-103, 1993, IEEE Computer Society, 0-8186-4370-6. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
unique smallest bisection, simulated annealing, Metropolis algorithm, graph bisection |
50 | Charles-Edmond Bichot |
Metaheuristics for graph bisection. ![Search on Bibsonomy](Pics/bibsonomy.png) |
GECCO ![In: Genetic and Evolutionary Computation Conference, GECCO 2009, Proceedings, Montreal, Québec, Canada, July 8-12, 2009, pp. 1801-1802, 2009, ACM, 978-1-60558-325-9. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
metaheuristics, graph partitioning, iterated local search |
50 | Ameya R. Agnihotri, Satoshi Ono, Chen Li 0004, Mehmet Can Yildiz, Ateen Khatkhate, Cheng-Kok Koh, Patrick H. Madden |
Mixed block placement via fractional cut recursive bisection. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. ![In: IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 24(5), pp. 748-761, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
50 | Josep Díaz, Maria J. Serna, Nicholas C. Wormald |
Computation of the Bisection Width for Random d-Regular Graphs. ![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. 49-58, 2004, Springer, 3-540-21258-2. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
50 | Jonas Holmerin, Subhash Khot |
A Strong Inapproximability Gap for a Generalization of Minimum Bisection. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: 18th Annual IEEE Conference on Computational Complexity (Complexity 2003), 7-10 July 2003, Aarhus, Denmark, pp. 371-378, 2003, IEEE Computer Society, 0-7695-1879-6. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
50 | Eran Halperin, Uri Zwick |
A Unified Framework for Obtaining Improved Approximation Algorithms for Maximum Graph Bisection Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPCO ![In: Integer Programming and Combinatorial Optimization, 8th International IPCO Conference, Utrecht, The Netherlands, June 13-15, 2001, Proceedings, pp. 210-225, 2001, Springer, 3-540-42225-0. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
46 | Jonas Holmerin, Subhash Khot |
A new PCP outer verifier with applications to homogeneous linear equations and max-bisection. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 36th Annual ACM Symposium on Theory of Computing, Chicago, IL, USA, June 13-16, 2004, pp. 11-20, 2004, ACM, 1-58113-852-0. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
max-bisection, hardness of approximation, linear equations, PCPs |
46 | Pranava K. Jha |
A Counterexample to Tang and Padubidri's Claim about the Bisection Width of a Diagonal Mesh. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Computers ![In: IEEE Trans. Computers 52(5), pp. 676-677, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
Diagonal mesh, bisection width |
46 | Linda Kaufman |
An observation on bisection software for the symmetric tridiagonal eigenvalue problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Math. Softw. ![In: ACM Trans. Math. Softw. 26(4), pp. 520-526, 2000. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
eigenvalues, bisection |
43 | Toshimasa Ishii, Kengo Iwata, Hiroshi Nagamochi |
Bisecting a Four-Connected Graph with Three Resource Sets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: Algorithms and Computation, 16th International Symposium, ISAAC 2005, Sanya, Hainan, China, December 19-21, 2005, Proceedings, pp. 176-185, 2005, Springer, 3-540-30935-7. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
43 | Meinolf Sellmann, Norbert Sensen, Larissa Timajev |
Multicommodity Flow Approximation Used for Exact Graph Partitioning. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: Algorithms - ESA 2003, 11th Annual European Symposium, Budapest, Hungary, September 16-19, 2003, Proceedings, pp. 752-764, 2003, Springer, 3-540-20064-9. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
43 | George Karypis, Rajat Aggarwal, Vipin Kumar 0001, Shashi Shekhar |
Multilevel hypergraph partitioning: applications in VLSI domain. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Very Large Scale Integr. Syst. ![In: IEEE Trans. Very Large Scale Integr. Syst. 7(1), pp. 69-79, 1999. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
43 | Youssef Saab, Vasant B. Rao |
Fast effective heuristics for the graph bisectioning problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. ![In: IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 9(1), pp. 91-98, 1990. The full citation details ...](Pics/full.jpeg) |
1990 |
DBLP DOI BibTeX RDF |
|
40 | Patrick Geoffray, Torsten Hoefler |
Adaptive Routing Strategies for Modern High Performance Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Hot Interconnects ![In: 16th Annual IEEE Symposium on High Performance Interconnects (HOTI 2008), 26-28 August 2008, Stanford, CA, USA, pp. 165-172, 2008, IEEE Computer Society, 978-0-7695-3380-3. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
bisection bandwidth, adaptive routing, Clos networks, head-of-line blocking |
40 | Honghui Hu, Naijie Gu, Jing Cao |
A Note on Recursive Cube of Rings Network. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Parallel Distributed Syst. ![In: IEEE Trans. Parallel Distributed Syst. 16(10), pp. 1007-1008, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
Recursive Cube of Rings (RCR), disconnected graph, network diameter, bisection width |
40 | Samy Ait-Aoudia |
Numerical Solving of Geometric Constraints. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IV ![In: International Conference on Information Visualisation, IV 2002, London, England, UK, July 10-12, 2002, pp. 125-129, 2002, IEEE Computer Society, 0-7695-1656-4. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
bisection method, constraints, geometric modeling |
39 | Michael Armbruster, Marzena Fügenschuh, Christoph Helmberg, Alexander Martin 0001 |
A Comparative Study of Linear and Semidefinite Branch-and-Cut Methods for Solving the Minimum Graph Bisection Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPCO ![In: Integer Programming and Combinatorial Optimization, 13th International Conference, IPCO 2008, Bertinoro, Italy, May 26-28, 2008, Proceedings, pp. 112-124, 2008, Springer, 978-3-540-68886-0. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Branch and cut algorithms, semidefinite programs, polyhedral combinatorics, cutting plane algorithms |
39 | Jingjing Meng, John J. Rieser, Bobby Bodenheimer |
Distance estimation in virtual environments using bisection. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APGV ![In: Proceedings of the 3rd Symposium on Applied Perception in Graphics and Visualization, APGV 2006, Boston, Massachusetts, USA, July 28-29, 2006, pp. 146, 2006, ACM, 1-59593-429-4. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
39 | Ameya R. Agnihotri, Mehmet Can Yildiz, Ateen Khatkhate, Ajita Mathur, Satoshi Ono, Patrick H. Madden |
Fractional Cut: Improved Recursive Bisection Placement. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICCAD ![In: 2003 International Conference on Computer-Aided Design, ICCAD 2003, San Jose, CA, USA, November 9-13, 2003, pp. 307-310, 2003, IEEE Computer Society / ACM, 1-58113-762-1. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
39 | Josep Díaz, Norman Do, Maria J. Serna, Nicholas C. Wormald |
Bisection of Random Cubic 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. 114-125, 2002, Springer, 3-540-44147-6. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
39 | José D. P. Rolim, Ondrej Sýkora, Imrich Vrto |
Optimal Cutwidths and Bisection Widths of 2- and 3-Dimensional Meshes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science, 21st International Workshop, WG '95, Aachen, Germany, June 20-22, 1995, Proceedings, pp. 252-264, 1995, Springer, 3-540-60618-1. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
|
39 | Manfred Kunde |
Block Gossiping on Grids and Tori: Deterministic Sorting and Routing Match the Bisection Bound. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: Algorithms - ESA '93, First Annual European Symposium, Bad Honnef, Germany, September 30 - October 2, 1993, Proceedings, pp. 272-283, 1993, Springer, 3-540-57273-2. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
|
39 | Juraj Hromkovic, Burkhard Monien |
The Bisection Problem for Graphs of Degree 4 (Configuring Transputer Systems). ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS ![In: Mathematical Foundations of Computer Science 1991, 16th International Symposium, MFCS'91, Kazimierz Dolny, Poland, September 9-13, 1991, Proceedings, pp. 211-220, 1991, Springer, 3-540-54345-7. The full citation details ...](Pics/full.jpeg) |
1991 |
DBLP DOI BibTeX RDF |
|
39 | Thang Nguyen Bui, C. Heigham, Curt Jones, Frank Thomson Leighton |
Improving the Performance of the Kernighan-Lin and Simulated Annealing Graph Bisection Algorithms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DAC ![In: Proceedings of the 26th ACM/IEEE Design Automation Conference, Las Vegas, Nevada, USA, June 25-29, 1989., pp. 775-778, 1989, ACM Press. The full citation details ...](Pics/full.jpeg) |
1989 |
DBLP DOI BibTeX RDF |
|
39 | Saul Gorn |
Bisection Routine (Algorithm 4). ![Search on Bibsonomy](Pics/bibsonomy.png) |
Commun. ACM ![In: Commun. ACM 3(3), pp. 174, 1960. The full citation details ...](Pics/full.jpeg) |
1960 |
DBLP DOI BibTeX RDF |
|
35 | Youssef Saab |
A Fast and Robust Network Bisection Algorithm. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Computers ![In: IEEE Trans. Computers 44(7), pp. 903-913, 1995. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
VLSI networks, approximation algorithms, hypergraphs, Bisection, iterative improvement |
35 | Manfred Kunde |
Concentrated Regular Data Streams on Grids: Sorting and Routing Near to the Bisection Bound ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 32nd Annual Symposium on Foundations of Computer Science, San Juan, Puerto Rico, 1-4 October 1991, pp. 141-150, 1991, IEEE Computer Society, 0-8186-2445-0. The full citation details ...](Pics/full.jpeg) |
1991 |
DBLP DOI BibTeX RDF |
offline routing, concentrated regular data streams, bisection bound, 1-1 sorting, h-h sorting, routing, sorting, deterministic algorithms, permutation routing |
34 | Amin Coja-Oghlan, Oliver Cooley, Mihyun Kang, Kathrin Skubch |
The Minimum Bisection in the Planted Bisection Model. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theory Comput. ![In: Theory Comput. 13(1), pp. 1-22, 2017. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
34 | Amin Coja-Oghlan, Oliver Cooley, Mihyun Kang, Kathrin Skubch |
The minimum bisection in the planted bisection model. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1505.02985, 2015. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP BibTeX RDF |
|
34 | Amin Coja-Oghlan, Oliver Cooley, Mihyun Kang, Kathrin Skubch |
The Minimum Bisection in the Planted Bisection Model. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2015, August 24-26, 2015, Princeton, NJ, USA, pp. 710-725, 2015, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-939897-89-7. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
33 | Carl Olsson, Anders P. Eriksson, Fredrik Kahl |
Efficient Optimization for L-problems using Pseudoconvexity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICCV ![In: IEEE 11th International Conference on Computer Vision, ICCV 2007, Rio de Janeiro, Brazil, October 14-20, 2007, pp. 1-8, 2007, IEEE Computer Society, 978-1-4244-1630-1. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
33 | Amin Coja-Oghlan |
A spectral heuristic for bisecting random graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2005, Vancouver, British Columbia, Canada, January 23-25, 2005, pp. 850-859, 2005, SIAM, 0-89871-585-7. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP BibTeX RDF |
|
33 | Tae-Young Choe, Chan-Ik Park |
A k-way Graph Partitioning Algorithm Based on Clustering by Eigenvector. ![Search on Bibsonomy](Pics/bibsonomy.png) |
International Conference on Computational Science ![In: Computational Science - ICCS 2004, 4th International Conference, Kraków, Poland, June 6-9, 2004, Proceedings, Part II, pp. 598-601, 2004, Springer, 3-540-22115-8. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
33 | Bernard Mans, Igor E. Shparlinski |
Bisecting and Gossiping in Circulant Graphs. ![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. 589-598, 2004, Springer, 3-540-21258-2. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
33 | André DeHon |
Rent's rule based switching requirements. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SLIP ![In: The Third IEEE/ACM International Workshop on System-Level Interconnect Prediction (SLIP 2001), March 31 - April 1, 2001, DoubleTree Hotel, Rohnert Park, CA, USA, Proceedings, pp. 197-204, 2001, ACM. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
switching requirements, hierarchical networks, Rent's rule |
33 | Chao-Wei Ou, Sanjay Ranka |
Parallel Incremental Graph Partitioning. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Parallel Distributed Syst. ![In: IEEE Trans. Parallel Distributed Syst. 8(8), pp. 884-896, 1997. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
parallel, Linear-programming, refinement, mapping, remapping |
33 | George Karypis, Rajat Aggarwal, Vipin Kumar 0001, Shashi Shekhar |
Multilevel Hypergraph Partitioning: Application in VLSI Domain. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DAC ![In: Proceedings of the 34st Conference on Design Automation, Anaheim, California, USA, Anaheim Convention Center, June 9-13, 1997., pp. 526-529, 1997, ACM Press, 0-89791-920-3. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
|
33 | Burkhard Monien, Ralf Diekmann, Reinhard Lüling |
Communication Throughput of Interconnection Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS ![In: Mathematical Foundations of Computer Science 1994, 19th International Symposium, MFCS'94, Kosice, Slovakia, August 22 - 26, 1994, Proceedings, pp. 72-86, 1994, Springer, 3-540-58338-6. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
|
33 | Chao-Wei Ou, Sanjay Ranka |
Parallel incremental graph partitioning using linear programming. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SC ![In: Proceedings Supercomputing '94, Washington, DC, USA, November 14-18, 1994, pp. 458-467, 1994, IEEE Computer Society, 0-8186-6605-6. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
|
29 | Kurt Mehlhorn, Michael Sagraloff |
Isolating real roots of real polynomials. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISSAC ![In: Symbolic and Algebraic Computation, International Symposium, ISSAC 2009, Seoul, Republic of Korea, July 29-31, 2009, Proceedings, pp. 247-254, 2009, ACM, 978-1-60558-609-0. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
bisection algorithm, bitstream coefficient, descartes' rule of sign, real polynomial, root isolation |
29 | Kenneth Weiss 0001, Leila De Floriani |
Sparse terrain pyramids. ![Search on Bibsonomy](Pics/bibsonomy.png) |
GIS ![In: 16th ACM SIGSPATIAL International Symposium on Advances in Geographic Information Systems, ACM-GIS 2008, November 5-7, 2008, Irvine, California, USA, Proceedings, pp. 15, 2008, ACM, 978-1-60558-323-5. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
diamond hierarchies, longest edge bisection, multiresolution terrain models, nested triangle meshes |
29 | Francisco Damasceno Freitas, João Yoshiyuki Ishihara, Geovany de Araújo Borges |
An Efficient Technique for Computing a Sub-optimal Disturbance Attenuation Hinfinity Control Problem Feedback Solution. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CSE ![In: Proceedings of the 11th IEEE International Conference on Computational Science and Engineering, CSE 2008, São Paulo, SP, Brazil, July 16-18, 2008, pp. 471-478, 2008, IEEE Computer Society, 978-0-7695-3193-9. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Kleiman method, Smith method, optimal control, bisection, Riccati equation, Lyapunov equation |
29 | Ting Zhang, Bican Xia |
A New Method for Real Root Isolation of Univariate Polynomials. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Math. Comput. Sci. ![In: Math. Comput. Sci. 1(2), pp. 305-320, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Real root isolation, interval Newton operator, bisection method, Maple, interval arithmetic |
29 | Behrooz Parhami, Mikhail A. Rakov |
Perfect Difference Networks and Related Interconnection Structures for Parallel and Distributed Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Parallel Distributed Syst. ![In: IEEE Trans. Parallel Distributed Syst. 16(8), pp. 714-724, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
hyperstar, low-diameter network, two-hop connectivity, interconnection network, Bipartite graph, diameter, degree, chordal ring, regular network, bisection width |
29 | Peter Lindstrom 0001, Valerio Pascucci |
Terrain Simplification Simplified: A General Framework for View-Dependent Out-of-Core Visualization. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Vis. Comput. Graph. ![In: IEEE Trans. Vis. Comput. Graph. 8(3), pp. 239-254, 2002. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
continuous levels of detail, edge bisection, geomorphing, external memory paging, out-of-core algorithms, data layouts, Terrain visualization, surface simplification, error metrics, view-dependent refinement |
29 | Hüuseyin Kutluca, Tahsin M. Kurç, Cevdet Aykanat |
Image-Space Decomposition Algorithms for Sort-First Parallel Volume Rendering of Unstructured Grids. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Supercomput. ![In: J. Supercomput. 15(1), pp. 51-93, 2000. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
sort-first parallelism, image-space decomposition, chains-on-chains partitioning, jagged decomposition, rectilinear decomposition, orthogonal recursive bisection, Hilbert space-filling curve, graph partitioning, unstructured grids, direct volume rendering |
29 | Chien-Ping Chang, Ting-Yi Sung, Lih-Hsing Hsu |
Edge Congestion and Topological Properties of Crossed Cubes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Parallel Distributed Syst. ![In: IEEE Trans. Parallel Distributed Syst. 11(1), pp. 64-80, 2000. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
edge congestion, hypercubes, embedding, shortest path routing, wide diameter, fault diameter, Crossed cubes, bisection width |
29 | Parthasarathi Dasgupta, Anup K. Sen, Subhas C. Nandy, Bhargab B. Bhattacharya |
Geometric bipartitioning problem and its applications to VLSI. ![Search on Bibsonomy](Pics/bibsonomy.png) |
VLSI Design ![In: 9th International Conference on VLSI Design (VLSI Design 1996), 3-6 January 1996, Bangalore, India, pp. 400-405, 1996, IEEE Computer Society, 0-8186-7228-5. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
geometric bipartitioning problem, layout design, rectilinear modules, staircase, monotone increasing, classical graph bisection problem, weighted permutation graph, integer edge weights, designated nodes, absolute value, edge weights, routing, computational complexity, VLSI, VLSI, graph theory, NP-complete, branch-and-bound, floorplan, heuristic algorithm, search problems, geometry, network routing, circuit layout CAD, hierarchical decomposition |
29 | José M. Badía, Antonio M. Vidal |
Efficient solution of the eigenproblem of banded symmetric Toeplitz matrices on multicomputers. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PDP ![In: 3rd Euromicro Workshop on Parallel and Distributed Processing (PDP '95), January 25-27, 1995, San Remo, Italy, pp. 416-423, 1995, IEEE Computer Society, 0-8186-7031-2. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
eigenproblem, banded symmetric Toeplitz matrices, bisection method, eigenstructure, network of transputers, farming technique, parallel algorithms, parallel algorithms, multicomputers, distributed memory multiprocessor, mathematics computing, eigenvalues and eigenfunctions, Toeplitz matrices |
29 | Yu-Chee Tseng, Sandeep K. S. Gupta, Dhabaleswar K. Panda 0001 |
An efficient scheme for complete exchange in 2D tori. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPPS ![In: Proceedings of IPPS '95, The 9th International Parallel Processing Symposium, April 25-28, 1995, Santa Barbara, California, USA, pp. 532-536, 1995, IEEE Computer Society, 0-8186-7074-6. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
2D tori, wormhole-routed tori, bisection bandwidth, parallel algorithms, parallel computing, multiprocessor interconnection networks, mesh networks, complete exchange, all-to-all personalized communication |
29 | Sabine R. Öhring, Maximilian Ibel, Sajal K. Das 0001, Mohan Kumar |
On generalized fat trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPPS ![In: Proceedings of IPPS '95, The 9th International Parallel Processing Symposium, April 25-28, 1995, Santa Barbara, California, USA, pp. 37-44, 1995, IEEE Computer Society, 0-8186-7074-6. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
generalized fat trees, multiprocesser interconnection networks, connection machine architecture, pruned butterflies, fat tree based architecture, inner nodes, leaf processors, recursive scalability, maximal fault-tolerance, logarithmic diameter bisection scalability, fault tolerant self-routing, reliability, parallel architectures, fault tolerant computing, broadcasting, hypercubes, multiprocessor interconnection networks, trees, meshes, communication complexity, symmetry, routers, network routing, switches, rings, pyramids, tori, CM-5 |
29 | John R. Gilbert, Gary L. Miller, Shang-Hua Teng |
Geometric mesh partitioning: implementation and experiments. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPPS ![In: Proceedings of IPPS '95, The 9th International Parallel Processing Symposium, April 25-28, 1995, Santa Barbara, California, USA, pp. 418-427, 1995, IEEE Computer Society, 0-8186-7074-6. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
geometric mesh partitioning, equal-sized pieces, geometric coordinates, mesh vertices, Matlab code, spectral bisection, computational geometry, mesh generation, finite element analysis, irregular mesh, finite element meshes |
29 | Ralf Diekmann, Reinhard Lüling, Burkhard Monien, Carsten Spräner |
A parallel local-search algorithm for the k-partitioning problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
HICSS (2) ![In: 28th Annual Hawaii International Conference on System Sciences (HICSS-28), January 3-6, 1995, Kihei, Maui, Hawaii, USA, pp. 41-50, 1995, IEEE Computer Society, 0-8186-6945-4. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
parallel local-search algorithm, k-partitioning problem, helpful sets, abstraction technique, runtime dynamic graph shrinking, MIMD systems, parallel algorithms, computational complexity, graph theory, heuristics, search problems, computation times, heuristic programming, stochastic methods, parallel efficiency, graph bisection, solution quality, processor numbers |
29 | Steven L. Scott, James R. Goodman |
The Impact of Pipelined Channels on k-ary n-Cube Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Parallel Distributed Syst. ![In: IEEE Trans. Parallel Distributed Syst. 5(1), pp. 2-16, 1994. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
pipelined channels, bisection constraints, optimaldimensionality, pipelined-channel networks, switching overhead, performance evaluation, multiprocessor interconnection networks, pipeline processing, cycle time, k-ary n-cube networks, message lengths |
28 | Yong-Hyuk Kim |
An Enzyme-Inspired Approach to Surmount Barriers in Graph Bisection. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICCSA (1) ![In: Computational Science and Its Applications - ICCSA 2008, International Conference, Perugia, Italy, June 30 - July 3, 2008, Proceedings, Part I, pp. 841-851, 2008, Springer, 978-3-540-69838-8. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
28 | John Y. Oliver, Diana Franklin, Frederic T. Chong, Venkatesh Akella |
Using Application Bisection Bandwidth to Guide Tile Size Selection for the Synchroscalar Tile-Based Architecture. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Trans. High Perform. Embed. Archit. Compil. ![In: Transactions on High-Performance Embedded Architectures and Compilers I, pp. 259-278, 2007, Springer, 978-3-540-71527-6. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
28 | K. Wendy Tang, Ridha Kamoua |
An Upper Bound for the Bisection Width of a Diagonal Mesh. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Computers ![In: IEEE Trans. Computers 56(3), pp. 429-431, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
architectures, Network topologies |
28 | Xiaomao Liu, Shujuan Cao, Junbin Gao, Jun Zhang 0062 |
The Kernelized Geometrical Bisection Methods. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISNN (2) ![In: Advances in Neural Networks - ISNN 2007, 4th International Symposium on Neural Networks, ISNN 2007, Nanjing, China, June 3-7, 2007, Proceedings, Part II, pp. 680-688, 2007, Springer, 978-3-540-72392-9. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
28 | Michael Armbruster, Marzena Fügenschuh, Christoph Helmberg, Nikolay Jetchev, Alexander Martin 0001 |
Hybrid Genetic Algorithm Within Branch-and-Cut for the Minimum Graph Bisection Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
EvoCOP ![In: Evolutionary Computation in Combinatorial Optimization, 6th European Conference, EvoCOP 2006, Budapest, Hungary, April 10-12, 2006, Proceedings, pp. 1-12, 2006, Springer, 3-540-33178-6. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
28 | Inwook Hwang, Yong-Hyuk Kim, Byung Ro Moon |
Multi-attractor gene reordering for graph bisection. ![Search on Bibsonomy](Pics/bibsonomy.png) |
GECCO ![In: Genetic and Evolutionary Computation Conference, GECCO 2006, Proceedings, Seattle, Washington, USA, July 8-12, 2006, pp. 1209-1216, 2006, ACM, 1-59593-186-4. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
gene reordering, repairing scheme, schema preprocessing, vertex ordering, genetic algorithm, graph partitioning |
28 | Huaxi Gu, Qiming Xie, Kun Wang 0001, Jie Zhang 0003, Yunsong Li |
X-Torus: A Variation of Torus Topology with Lower Diameter and Larger Bisection Width. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICCSA (5) ![In: Computational Science and Its Applications - ICCSA 2006, International Conference, Glasgow, UK, May 8-11, 2006, Proceedings, Part V, pp. 149-157, 2006, Springer, 3-540-34079-3. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
28 | Johannes Mayer |
Adaptive Random Testing by Bisection with Restriction. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICFEM ![In: Formal Methods and Software Engineering, 7th International Conference on Formal Engineering Methods, ICFEM 2005, Manchester, UK, November 1-4, 2005, Proceedings, pp. 251-263, 2005, Springer, 3-540-29797-9. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
28 | Ameya R. Agnihotri, Satoshi Ono, Patrick H. Madden |
Recursive bisection placement: feng shui 5.0 implementation details. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISPD ![In: Proceedings of the 2005 International Symposium on Physical Design, ISPD 2005, San Francisco, California, USA, April 3-6, 2005, pp. 230-232, 2005, ACM, 1-59593-021-3. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
mixed block design, placement, floorplanning |
28 | Johannes Mayer |
Adaptive Random Testing by Bisection and Localization. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FATES ![In: Formal Approaches to Software Testing, 5th International Workshop, FATES 2005, Edinburgh, UK, July 11, 2005, Revised Selected Papers, pp. 72-86, 2005, Springer, 3-540-34454-3. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
28 | Michael Armbruster, Marzena Fügenschuh, Christoph Helmberg, Nikolay Jetchev, Alexander Martin 0001 |
LP-based Genetic Algorithm for the Minimum Graph Bisection Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
OR ![In: Operations Research Proceedings 2005, Selected Papers of the Annual International Conference of the German Operations Research Society (GOR), Bremen, Germany, September 7-9, 2005, pp. 315-320, 2005, 978-3-540-32537-6. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
28 | Wenceslas Fernandez de la Vega, Marek Karpinski, Claire Kenyon |
Approximation schemes for Metric Bisection and partitioning. ![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. 506-515, 2004, SIAM, 0-89871-558-X. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP BibTeX RDF |
|
28 | Subhash Khot |
Ruling Out PTAS for Graph Min-Bisection, Densest Subgraph and Bipartite Clique. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 45th Symposium on Foundations of Computer Science (FOCS 2004), 17-19 October 2004, Rome, Italy, Proceedings, pp. 136-145, 2004, IEEE Computer Society, 0-7695-2228-9. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
28 | Ateen Khatkhate, Chen Li 0004, Ameya R. Agnihotri, Mehmet Can Yildiz, Satoshi Ono, Cheng-Kok Koh, Patrick H. Madden |
Recursive bisection based mixed block placement. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISPD ![In: Proceedings of the 2004 International Symposium on Physical Design, ISPD 2004, Phoenix, Arizona, USA, April 18-21, 2004, pp. 84-89, 2004, ACM, 1-58113-817-2. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
mixed block design, placement, floorplanning |
28 | Spencer D. Shellman, Kris Sikorski |
Algorithm 825: A deep-cut bisection envelope algorithm for fixed points. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Math. Softw. ![In: ACM Trans. Math. Softw. 29(3), pp. 309-325, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
nonlinear partial differential equations, game theory, economics, Fixed points |
28 | Marek Karpinski |
Approximability of the Minimum Bisection Problem: An Algorithmic Challenge. ![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. 59-67, 2002, Springer, 3-540-44040-2. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
28 | Rainer Feldmann, Burkhard Monien, Peter Mysliwietz, Stefan Tschöke |
A Better Upper Bound on the Bisection Width of de Bruijn Networks (Extended Abstract). ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: STACS 97, 14th Annual Symposium on Theoretical Aspects of Computer Science, Lübeck, Germany, February 27 - March 1, 1997, Proceedings, pp. 511-522, 1997, Springer, 3-540-62616-6. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
|
28 | Dorothea Wagner, Frank Wagner 0001 |
Between Min Cut and Graph Bisection. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS ![In: Mathematical Foundations of Computer Science 1993, 18th International Symposium, MFCS'93, Gdansk, Poland, August 30 - September 3, 1993, Proceedings, pp. 744-750, 1993, Springer, 3-540-57182-5. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
|
28 | R. Baker Kearfott, Manuel Novoa |
Algorithm 681: INTBIS, a portable interval Newton/bisection package. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Math. Softw. ![In: ACM Trans. Math. Softw. 16(2), pp. 152-157, 1990. The full citation details ...](Pics/full.jpeg) |
1990 |
DBLP DOI BibTeX RDF |
|
22 | Kenneth Weiss 0001, Leila De Floriani |
Supercubes: A High-Level Primitive for Diamond Hierarchies. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Vis. Comput. Graph. ![In: IEEE Trans. Vis. Comput. Graph. 15(6), pp. 1603-1610, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
22 | Ralf Morgenstern, Marcus Heldmann, Thomas F. Münte, Bodo Vogt |
Evaluation of Probabilities and Brain Activity - An EEG-Study. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Brain Informatics ![In: Brain Informatics, International Conference, BI 2009, Beijing, China, October 22-24, 2009, Proceedings, pp. 74-83, 2009, Springer, 978-3-642-04953-8. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
22 | Jun Liu 0003, Jieping Ye |
Efficient Euclidean projections in linear time. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICML ![In: Proceedings of the 26th Annual International Conference on Machine Learning, ICML 2009, Montreal, Quebec, Canada, June 14-18, 2009, pp. 657-664, 2009, ACM, 978-1-60558-516-1. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
22 | Saeedeh Bakhshi, Hamid Sarbazi-Azad |
Efficient VLSI Layout of Edge Product Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DELTA ![In: 4th IEEE International Symposium on Electronic Design, Test and Applications, DELTA 2008, Hong Kong, January 23-25, 2008, pp. 555-560, 2008, IEEE Computer Society, 978-0-7695-3110-6. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Edge graph product, Collinear layout, Interconnection networks, Networks on chip, VLSI layout |
22 | Yongduek Seo, Richard I. Hartley |
A Fast Method to Minimize L Error Norm for Geometric Vision Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICCV ![In: IEEE 11th International Conference on Computer Vision, ICCV 2007, Rio de Janeiro, Brazil, October 14-20, 2007, pp. 1-8, 2007, IEEE Computer Society, 978-1-4244-1630-1. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
22 | Raimund Ubar, Sergei Kostin, Jaan Raik, Teet Evartson, Harri Lensen |
Fault Diagnosis in Integrated Circuits with BIST. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DSD ![In: Tenth Euromicro Conference on Digital System Design: Architectures, Methods and Tools (DSD 2007), 29-31 August 2007, Lübeck, Germany, pp. 604-610, 2007, IEEE Computer Society, 0-7695-2978-X. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
22 | Ekasit Kijsipongse, Sudsanguan Ngamsuriyaroj |
Column-Based Partitioning for Data in High Dimensional Space. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICPP ![In: 2007 International Conference on Parallel Processing (ICPP 2007), September 10-14, 2007, Xi-An, China, pp. 13, 2007, IEEE Computer Society. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
22 | Shaoying Wang, Huaxi Gu, Changshan Wang |
RTOIN: a new scalable optical interconnection network. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Infoscale ![In: Proceedings of the 2nf International Conference on Scalable Information Systems, Infoscale 2007, Suzhou, China, June 6-8, 2007, pp. 1, 2007, ACM, 978-1-59593-757-5. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
scalability, parallel computing, torus, ring, optical interconnection network |
22 | Mikael Onsjö, Osamu Watanabe 0001 |
A Simple Message Passing Algorithm for Graph Partitioning Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: Algorithms and Computation, 17th International Symposium, ISAAC 2006, Kolkata, India, December 18-20, 2006, Proceedings, pp. 507-516, 2006, Springer, 3-540-49694-7. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
22 | Giulia Galbiati, Francesco Maffioli |
Approximating Maximum Cut with Limited Unbalance. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WAOA ![In: Approximation and Online Algorithms, 4th International Workshop, WAOA 2006, Zurich, Switzerland, September 14-15, 2006, Revised Papers, pp. 202-213, 2006, Springer, 3-540-69513-3. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
approximation algorithm, randomized algorithm, semidefinite programming |
Displaying result #1 - #100 of 729 (100 per page; Change: ) Pages: [ 1][ 2][ 3][ 4][ 5][ 6][ 7][ 8][ >>] |
|