The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Searching for Bisection with no syntactic query expansion in all metadata.

Publication years (Num. hits)
1960-1986 (15) 1987-1990 (18) 1991-1992 (15) 1993-1994 (23) 1995 (21) 1996-1997 (37) 1998-1999 (26) 2000 (28) 2001 (25) 2002 (26) 2003 (28) 2004 (32) 2005 (36) 2006 (31) 2007 (36) 2008 (35) 2009 (37) 2010 (17) 2011-2012 (30) 2013 (17) 2014 (17) 2015 (29) 2016 (20) 2017 (24) 2018 (20) 2019 (18) 2020 (18) 2021 (15) 2022-2023 (27) 2024 (8)
Publication types (Num. hits)
article(354) incollection(11) inproceedings(362) phdthesis(2)
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
104Sergei 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 WG The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
93Piotr Berman, Marek Karpinski Approximation Hardness of Bounded Degree MIN-CSP and MIN-BISECTION. Search on Bibsonomy ICALP The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
86Jacob G. Martin Spectral techniques for graph bisection in genetic algorithms. Search on Bibsonomy GECCO The full citation details ... 2006 DBLP  DOI  BibTeX  RDF genetic engineering, reduced rank approximation, spectral bisection, genetic algorithm, singular value decomposition, graph partitioning, graph bisection
79Bobby 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 APGV The full citation details ... 2007 DBLP  DOI  BibTeX  RDF distance bisection, virtual reality (VR), distance perception, fractionation
79Burkhard Monien, Robert Preis Upper Bounds on the Bisection Width of 3- and 4-Regular Graphs. Search on Bibsonomy MFCS The full citation details ... 2001 DBLP  DOI  BibTeX  RDF local improvement, graph partitioning, regular graphs, bisection width
76Torsten Hoefler, Timo Schneider, Andrew Lumsdaine Multistage switches are not crossbars: Effects of static routing in high-performance networks. Search on Bibsonomy CLUSTER The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
72Burkhard Monien, Stefan Schamberger Graph Partitioning with the Party Library: Helpful-Sets in Practice. Search on Bibsonomy SBAC-PAD The full citation details ... 2004 DBLP  DOI  BibTeX  RDF Heuristic Graph Partitioning, Helpful-Sets, Recursive bisection
71Claudio Gutierrez 0001, Flavio Gutierrez, Maria-Cecilia Rivara A Geometric Approach to the Bisection Method. Search on Bibsonomy LATIN The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
71Klaus Jansen, Marek Karpinski, Andrzej Lingas, Eike Seidel Polynomial Time Approximation Schemes for MAX-BISECTION on Planar and Geometric Graphs. Search on Bibsonomy STACS The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
61Lali Barrière, Josep Fàbrega Edge-Bisection of Chordal Rings. Search on Bibsonomy MFCS The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
61Andrew E. Caldwell, Andrew B. Kahng, Igor L. Markov Can recursive bisection alone produce routable placements? Search on Bibsonomy DAC The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
61Ralf Klasing The Relationship Between Gossiping in Vertex-Disjoint Paths Mode and Bisection Width. Search on Bibsonomy MFCS The full citation details ... 1994 DBLP  DOI  BibTeX  RDF
57Bernd Hamann, Benjamin W. Jordan, David F. Wiley On a Construction of a Hierarchy of Best Linear Spline Approximations Using Repeated Bisection. Search on Bibsonomy IEEE Trans. Vis. Comput. Graph. The full citation details ... 1999 DBLP  DOI  BibTeX  RDF linear spline, visualization, Approximation, triangulation, spline, unstructured grid, hierarchical representation, scattered data, bisection, multiresolution method, best approximation, grid generation
54Betsy Williams, Derek Johnson, Lucy R. Shores, Gayathri Narasimham Distance perception in virtual environments. Search on Bibsonomy APGV The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
54Ted Carson, Russell Impagliazzo Hill-climbing finds random planted bisections. Search on Bibsonomy SODA The full citation details ... 2001 DBLP  BibTeX  RDF
54Graham Wood Bisection Global Optimization Methods. Search on Bibsonomy Encyclopedia of Optimization The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Lipschitz continuity, Multidimensional bisection, Epigraph, Linear convergence, System, Reduction, Tiling, Bisection, Simplex, Elimination, Bracket
54Uriel Feige, Robert Krauthgamer A polylogarithmic approximation of the minimum bisection. Search on Bibsonomy FOCS The full citation details ... 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
54Mark Jerrum, Gregory B. Sorkin Simulated Annealing for Graph Bisection Search on Bibsonomy FOCS The full citation details ... 1993 DBLP  DOI  BibTeX  RDF unique smallest bisection, simulated annealing, Metropolis algorithm, graph bisection
50Charles-Edmond Bichot Metaheuristics for graph bisection. Search on Bibsonomy GECCO The full citation details ... 2009 DBLP  DOI  BibTeX  RDF metaheuristics, graph partitioning, iterated local search
50Ameya 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 IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
50Josep Díaz, Maria J. Serna, Nicholas C. Wormald Computation of the Bisection Width for Random d-Regular Graphs. Search on Bibsonomy LATIN The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
50Jonas Holmerin, Subhash Khot A Strong Inapproximability Gap for a Generalization of Minimum Bisection. Search on Bibsonomy CCC The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
50Eran Halperin, Uri Zwick A Unified Framework for Obtaining Improved Approximation Algorithms for Maximum Graph Bisection Problems. Search on Bibsonomy IPCO The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
46Jonas Holmerin, Subhash Khot A new PCP outer verifier with applications to homogeneous linear equations and max-bisection. Search on Bibsonomy STOC The full citation details ... 2004 DBLP  DOI  BibTeX  RDF max-bisection, hardness of approximation, linear equations, PCPs
46Pranava K. Jha A Counterexample to Tang and Padubidri's Claim about the Bisection Width of a Diagonal Mesh. Search on Bibsonomy IEEE Trans. Computers The full citation details ... 2003 DBLP  DOI  BibTeX  RDF Diagonal mesh, bisection width
46Linda Kaufman An observation on bisection software for the symmetric tridiagonal eigenvalue problem. Search on Bibsonomy ACM Trans. Math. Softw. The full citation details ... 2000 DBLP  DOI  BibTeX  RDF eigenvalues, bisection
43Toshimasa Ishii, Kengo Iwata, Hiroshi Nagamochi Bisecting a Four-Connected Graph with Three Resource Sets. Search on Bibsonomy ISAAC The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
43Meinolf Sellmann, Norbert Sensen, Larissa Timajev Multicommodity Flow Approximation Used for Exact Graph Partitioning. Search on Bibsonomy ESA The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
43George Karypis, Rajat Aggarwal, Vipin Kumar 0001, Shashi Shekhar Multilevel hypergraph partitioning: applications in VLSI domain. Search on Bibsonomy IEEE Trans. Very Large Scale Integr. Syst. The full citation details ... 1999 DBLP  DOI  BibTeX  RDF
43Youssef Saab, Vasant B. Rao Fast effective heuristics for the graph bisectioning problem. Search on Bibsonomy IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. The full citation details ... 1990 DBLP  DOI  BibTeX  RDF
40Patrick Geoffray, Torsten Hoefler Adaptive Routing Strategies for Modern High Performance Networks. Search on Bibsonomy Hot Interconnects The full citation details ... 2008 DBLP  DOI  BibTeX  RDF bisection bandwidth, adaptive routing, Clos networks, head-of-line blocking
40Honghui Hu, Naijie Gu, Jing Cao A Note on Recursive Cube of Rings Network. Search on Bibsonomy IEEE Trans. Parallel Distributed Syst. The full citation details ... 2005 DBLP  DOI  BibTeX  RDF Recursive Cube of Rings (RCR), disconnected graph, network diameter, bisection width
40Samy Ait-Aoudia Numerical Solving of Geometric Constraints. Search on Bibsonomy IV The full citation details ... 2002 DBLP  DOI  BibTeX  RDF bisection method, constraints, geometric modeling
39Michael 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 IPCO The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Branch and cut algorithms, semidefinite programs, polyhedral combinatorics, cutting plane algorithms
39Jingjing Meng, John J. Rieser, Bobby Bodenheimer Distance estimation in virtual environments using bisection. Search on Bibsonomy APGV The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
39Ameya R. Agnihotri, Mehmet Can Yildiz, Ateen Khatkhate, Ajita Mathur, Satoshi Ono, Patrick H. Madden Fractional Cut: Improved Recursive Bisection Placement. Search on Bibsonomy ICCAD The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
39Josep Díaz, Norman Do, Maria J. Serna, Nicholas C. Wormald Bisection of Random Cubic Graphs. Search on Bibsonomy RANDOM The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
39José D. P. Rolim, Ondrej Sýkora, Imrich Vrto Optimal Cutwidths and Bisection Widths of 2- and 3-Dimensional Meshes. Search on Bibsonomy WG The full citation details ... 1995 DBLP  DOI  BibTeX  RDF
39Manfred Kunde Block Gossiping on Grids and Tori: Deterministic Sorting and Routing Match the Bisection Bound. Search on Bibsonomy ESA The full citation details ... 1993 DBLP  DOI  BibTeX  RDF
39Juraj Hromkovic, Burkhard Monien The Bisection Problem for Graphs of Degree 4 (Configuring Transputer Systems). Search on Bibsonomy MFCS The full citation details ... 1991 DBLP  DOI  BibTeX  RDF
39Thang 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 DAC The full citation details ... 1989 DBLP  DOI  BibTeX  RDF
39Saul Gorn Bisection Routine (Algorithm 4). Search on Bibsonomy Commun. ACM The full citation details ... 1960 DBLP  DOI  BibTeX  RDF
35Youssef Saab A Fast and Robust Network Bisection Algorithm. Search on Bibsonomy IEEE Trans. Computers The full citation details ... 1995 DBLP  DOI  BibTeX  RDF VLSI networks, approximation algorithms, hypergraphs, Bisection, iterative improvement
35Manfred Kunde Concentrated Regular Data Streams on Grids: Sorting and Routing Near to the Bisection Bound Search on Bibsonomy FOCS The full citation details ... 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
34Amin Coja-Oghlan, Oliver Cooley, Mihyun Kang, Kathrin Skubch The Minimum Bisection in the Planted Bisection Model. Search on Bibsonomy Theory Comput. The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
34Amin Coja-Oghlan, Oliver Cooley, Mihyun Kang, Kathrin Skubch The minimum bisection in the planted bisection model. Search on Bibsonomy CoRR The full citation details ... 2015 DBLP  BibTeX  RDF
34Amin Coja-Oghlan, Oliver Cooley, Mihyun Kang, Kathrin Skubch The Minimum Bisection in the Planted Bisection Model. Search on Bibsonomy APPROX-RANDOM The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
33Carl Olsson, Anders P. Eriksson, Fredrik Kahl Efficient Optimization for L-problems using Pseudoconvexity. Search on Bibsonomy ICCV The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
33Amin Coja-Oghlan A spectral heuristic for bisecting random graphs. Search on Bibsonomy SODA The full citation details ... 2005 DBLP  BibTeX  RDF
33Tae-Young Choe, Chan-Ik Park A k-way Graph Partitioning Algorithm Based on Clustering by Eigenvector. Search on Bibsonomy International Conference on Computational Science The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
33Bernard Mans, Igor E. Shparlinski Bisecting and Gossiping in Circulant Graphs. Search on Bibsonomy LATIN The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
33André DeHon Rent's rule based switching requirements. Search on Bibsonomy SLIP The full citation details ... 2001 DBLP  DOI  BibTeX  RDF switching requirements, hierarchical networks, Rent's rule
33Chao-Wei Ou, Sanjay Ranka Parallel Incremental Graph Partitioning. Search on Bibsonomy IEEE Trans. Parallel Distributed Syst. The full citation details ... 1997 DBLP  DOI  BibTeX  RDF parallel, Linear-programming, refinement, mapping, remapping
33George Karypis, Rajat Aggarwal, Vipin Kumar 0001, Shashi Shekhar Multilevel Hypergraph Partitioning: Application in VLSI Domain. Search on Bibsonomy DAC The full citation details ... 1997 DBLP  DOI  BibTeX  RDF
33Burkhard Monien, Ralf Diekmann, Reinhard Lüling Communication Throughput of Interconnection Networks. Search on Bibsonomy MFCS The full citation details ... 1994 DBLP  DOI  BibTeX  RDF
33Chao-Wei Ou, Sanjay Ranka Parallel incremental graph partitioning using linear programming. Search on Bibsonomy SC The full citation details ... 1994 DBLP  DOI  BibTeX  RDF
29Kurt Mehlhorn, Michael Sagraloff Isolating real roots of real polynomials. Search on Bibsonomy ISSAC The full citation details ... 2009 DBLP  DOI  BibTeX  RDF bisection algorithm, bitstream coefficient, descartes' rule of sign, real polynomial, root isolation
29Kenneth Weiss 0001, Leila De Floriani Sparse terrain pyramids. Search on Bibsonomy GIS The full citation details ... 2008 DBLP  DOI  BibTeX  RDF diamond hierarchies, longest edge bisection, multiresolution terrain models, nested triangle meshes
29Francisco 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 CSE The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Kleiman method, Smith method, optimal control, bisection, Riccati equation, Lyapunov equation
29Ting Zhang, Bican Xia A New Method for Real Root Isolation of Univariate Polynomials. Search on Bibsonomy Math. Comput. Sci. The full citation details ... 2007 DBLP  DOI  BibTeX  RDF Real root isolation, interval Newton operator, bisection method, Maple, interval arithmetic
29Behrooz Parhami, Mikhail A. Rakov Perfect Difference Networks and Related Interconnection Structures for Parallel and Distributed Systems. Search on Bibsonomy IEEE Trans. Parallel Distributed Syst. The full citation details ... 2005 DBLP  DOI  BibTeX  RDF hyperstar, low-diameter network, two-hop connectivity, interconnection network, Bipartite graph, diameter, degree, chordal ring, regular network, bisection width
29Peter Lindstrom 0001, Valerio Pascucci Terrain Simplification Simplified: A General Framework for View-Dependent Out-of-Core Visualization. Search on Bibsonomy IEEE Trans. Vis. Comput. Graph. The full citation details ... 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
29Hüuseyin Kutluca, Tahsin M. Kurç, Cevdet Aykanat Image-Space Decomposition Algorithms for Sort-First Parallel Volume Rendering of Unstructured Grids. Search on Bibsonomy J. Supercomput. The full citation details ... 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
29Chien-Ping Chang, Ting-Yi Sung, Lih-Hsing Hsu Edge Congestion and Topological Properties of Crossed Cubes. Search on Bibsonomy IEEE Trans. Parallel Distributed Syst. The full citation details ... 2000 DBLP  DOI  BibTeX  RDF edge congestion, hypercubes, embedding, shortest path routing, wide diameter, fault diameter, Crossed cubes, bisection width
29Parthasarathi Dasgupta, Anup K. Sen, Subhas C. Nandy, Bhargab B. Bhattacharya Geometric bipartitioning problem and its applications to VLSI. Search on Bibsonomy VLSI Design The full citation details ... 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
29José M. Badía, Antonio M. Vidal Efficient solution of the eigenproblem of banded symmetric Toeplitz matrices on multicomputers. Search on Bibsonomy PDP The full citation details ... 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
29Yu-Chee Tseng, Sandeep K. S. Gupta, Dhabaleswar K. Panda 0001 An efficient scheme for complete exchange in 2D tori. Search on Bibsonomy IPPS The full citation details ... 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
29Sabine R. Öhring, Maximilian Ibel, Sajal K. Das 0001, Mohan Kumar On generalized fat trees. Search on Bibsonomy IPPS The full citation details ... 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
29John R. Gilbert, Gary L. Miller, Shang-Hua Teng Geometric mesh partitioning: implementation and experiments. Search on Bibsonomy IPPS The full citation details ... 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
29Ralf Diekmann, Reinhard Lüling, Burkhard Monien, Carsten Spräner A parallel local-search algorithm for the k-partitioning problem. Search on Bibsonomy HICSS (2) The full citation details ... 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
29Steven L. Scott, James R. Goodman The Impact of Pipelined Channels on k-ary n-Cube Networks. Search on Bibsonomy IEEE Trans. Parallel Distributed Syst. The full citation details ... 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
28Yong-Hyuk Kim An Enzyme-Inspired Approach to Surmount Barriers in Graph Bisection. Search on Bibsonomy ICCSA (1) The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
28John 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 Trans. High Perform. Embed. Archit. Compil. The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
28K. Wendy Tang, Ridha Kamoua An Upper Bound for the Bisection Width of a Diagonal Mesh. Search on Bibsonomy IEEE Trans. Computers The full citation details ... 2007 DBLP  DOI  BibTeX  RDF architectures, Network topologies
28Xiaomao Liu, Shujuan Cao, Junbin Gao, Jun Zhang 0062 The Kernelized Geometrical Bisection Methods. Search on Bibsonomy ISNN (2) The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
28Michael 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 EvoCOP The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
28Inwook Hwang, Yong-Hyuk Kim, Byung Ro Moon Multi-attractor gene reordering for graph bisection. Search on Bibsonomy GECCO The full citation details ... 2006 DBLP  DOI  BibTeX  RDF gene reordering, repairing scheme, schema preprocessing, vertex ordering, genetic algorithm, graph partitioning
28Huaxi 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 ICCSA (5) The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
28Johannes Mayer Adaptive Random Testing by Bisection with Restriction. Search on Bibsonomy ICFEM The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
28Ameya R. Agnihotri, Satoshi Ono, Patrick H. Madden Recursive bisection placement: feng shui 5.0 implementation details. Search on Bibsonomy ISPD The full citation details ... 2005 DBLP  DOI  BibTeX  RDF mixed block design, placement, floorplanning
28Johannes Mayer Adaptive Random Testing by Bisection and Localization. Search on Bibsonomy FATES The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
28Michael Armbruster, Marzena Fügenschuh, Christoph Helmberg, Nikolay Jetchev, Alexander Martin 0001 LP-based Genetic Algorithm for the Minimum Graph Bisection Problem. Search on Bibsonomy OR The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
28Wenceslas Fernandez de la Vega, Marek Karpinski, Claire Kenyon Approximation schemes for Metric Bisection and partitioning. Search on Bibsonomy SODA The full citation details ... 2004 DBLP  BibTeX  RDF
28Subhash Khot Ruling Out PTAS for Graph Min-Bisection, Densest Subgraph and Bipartite Clique. Search on Bibsonomy FOCS The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
28Ateen 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 ISPD The full citation details ... 2004 DBLP  DOI  BibTeX  RDF mixed block design, placement, floorplanning
28Spencer D. Shellman, Kris Sikorski Algorithm 825: A deep-cut bisection envelope algorithm for fixed points. Search on Bibsonomy ACM Trans. Math. Softw. The full citation details ... 2003 DBLP  DOI  BibTeX  RDF nonlinear partial differential equations, game theory, economics, Fixed points
28Marek Karpinski Approximability of the Minimum Bisection Problem: An Algorithmic Challenge. Search on Bibsonomy MFCS The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
28Rainer 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 STACS The full citation details ... 1997 DBLP  DOI  BibTeX  RDF
28Dorothea Wagner, Frank Wagner 0001 Between Min Cut and Graph Bisection. Search on Bibsonomy MFCS The full citation details ... 1993 DBLP  DOI  BibTeX  RDF
28R. Baker Kearfott, Manuel Novoa Algorithm 681: INTBIS, a portable interval Newton/bisection package. Search on Bibsonomy ACM Trans. Math. Softw. The full citation details ... 1990 DBLP  DOI  BibTeX  RDF
22Kenneth Weiss 0001, Leila De Floriani Supercubes: A High-Level Primitive for Diamond Hierarchies. Search on Bibsonomy IEEE Trans. Vis. Comput. Graph. The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
22Ralf Morgenstern, Marcus Heldmann, Thomas F. Münte, Bodo Vogt Evaluation of Probabilities and Brain Activity - An EEG-Study. Search on Bibsonomy Brain Informatics The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
22Jun Liu 0003, Jieping Ye Efficient Euclidean projections in linear time. Search on Bibsonomy ICML The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
22Saeedeh Bakhshi, Hamid Sarbazi-Azad Efficient VLSI Layout of Edge Product Networks. Search on Bibsonomy DELTA The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Edge graph product, Collinear layout, Interconnection networks, Networks on chip, VLSI layout
22Yongduek Seo, Richard I. Hartley A Fast Method to Minimize L Error Norm for Geometric Vision Problems. Search on Bibsonomy ICCV The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
22Raimund Ubar, Sergei Kostin, Jaan Raik, Teet Evartson, Harri Lensen Fault Diagnosis in Integrated Circuits with BIST. Search on Bibsonomy DSD The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
22Ekasit Kijsipongse, Sudsanguan Ngamsuriyaroj Column-Based Partitioning for Data in High Dimensional Space. Search on Bibsonomy ICPP The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
22Shaoying Wang, Huaxi Gu, Changshan Wang RTOIN: a new scalable optical interconnection network. Search on Bibsonomy Infoscale The full citation details ... 2007 DBLP  DOI  BibTeX  RDF scalability, parallel computing, torus, ring, optical interconnection network
22Mikael Onsjö, Osamu Watanabe 0001 A Simple Message Passing Algorithm for Graph Partitioning Problems. Search on Bibsonomy ISAAC The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
22Giulia Galbiati, Francesco Maffioli Approximating Maximum Cut with Limited Unbalance. Search on Bibsonomy WAOA The full citation details ... 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][>>]
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by L3S.
Previously maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.
open data data released under the ODC-BY 1.0 license