The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Searching for phrase Min-Cut (changed automatically) with no syntactic query expansion in all metadata.

Publication years (Num. hits)
1974-1986 (15) 1987-1990 (21) 1991-1994 (18) 1995-1996 (16) 1997-1998 (17) 1999-2001 (18) 2002-2003 (23) 2004 (16) 2005 (21) 2006 (30) 2007 (37) 2008 (22) 2009 (24) 2010 (17) 2011-2012 (16) 2013-2015 (22) 2016-2017 (16) 2018-2020 (21) 2021-2022 (20) 2023-2024 (8)
Publication types (Num. hits)
article(170) incollection(3) inproceedings(224) phdthesis(1)
Venues (Conferences, Journals, ...)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 238 occurrences of 179 keywords

Results
Found 398 publication records. Showing 398 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
191Hassene Aissi, Cristina Bazgan, Daniel Vanderpooten Complexity of the Min-Max (Regret) Versions of Cut Problems. Search on Bibsonomy ISAAC The full citation details ... 2005 DBLP  DOI  BibTeX  RDF min-max regret, s–t min cut, complexity, min cut, min-max
150Hannah Honghua Yang, D. F. Wong 0001 New algorithms for min-cut replication in partitioned circuits. Search on Bibsonomy ICCAD The full citation details ... 1995 DBLP  DOI  BibTeX  RDF Hyper-MAMC, VLSI circuit partitioning, k-way partition, k-way partitioned digraph, min-cut replication, partitioned circuits, VLSI, optimal algorithm, circuit layout CAD, hypergraphs, VLSI layout, digraphs, circuit layout
141Hannah Honghua Yang, Martin D. F. Wong Optimal min-area min-cut replication in partitioned circuits. Search on Bibsonomy IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. The full citation details ... 1998 DBLP  DOI  BibTeX  RDF
101Kazuhiro Takahashi, Kazuo Nakajima, Masayuki Terai, Koji Sato Adaptive cut line selection in min-cut placement for large scale sea-of-gates arrays. Search on Bibsonomy ICCAD The full citation details ... 1994 DBLP  DOI  BibTeX  RDF
91Teofilo F. Gonzalez, Toshio Murayama Alhorithms for a Class of Min-Cut and Max-Cut Problem. Search on Bibsonomy ISAAC The full citation details ... 1992 DBLP  DOI  BibTeX  RDF
90Wai-Kei Mak, D. F. Wong 0001 Minimum replication min-cut partitioning. Search on Bibsonomy ICCAD The full citation details ... 1996 DBLP  DOI  BibTeX  RDF min-cut partitioning, circuit partitioning, logic replication
89Srinivasa Rao Arikati, Shiva Chaudhuri, Christos D. Zaroliagis All-Pairs Min-Cut in Sparse Networks. Search on Bibsonomy FSTTCS The full citation details ... 1995 DBLP  DOI  BibTeX  RDF
71Kazuhiro Takahashi, Kazuo Nakajima, Masayuki Terai, Koji Sato Min-cut placement with global objective functions for large scale sea-of-gates arrays. Search on Bibsonomy IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. The full citation details ... 1995 DBLP  DOI  BibTeX  RDF
71Inderpal S. Bhandari, Mark Hirsch, Daniel P. Siewiorek The Min-cut Shuffle: Toward a Solution for the Global Effect Problem of Min-cut Placement. Search on Bibsonomy DAC The full citation details ... 1988 DBLP  BibTeX  RDF
66Troy A. Johnson, Rudolf Eigenmann, T. N. Vijaykumar Min-cut program decomposition for thread-level speculation. Search on Bibsonomy PLDI The full citation details ... 2004 DBLP  DOI  BibTeX  RDF partitioning, chip multiprocessor, thread-level speculation, min-cut, program decomposition
66Wai-Kei Mak, Martin D. F. Wong Minimum replication min-cut partitioning. Search on Bibsonomy IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. The full citation details ... 1997 DBLP  DOI  BibTeX  RDF
65Andrew B. Kahng, Sherief Reda Placement feedback: a concept and method for better min-cut placements. Search on Bibsonomy DAC The full citation details ... 2004 DBLP  DOI  BibTeX  RDF min-cut placement, terminal propagation, feedback
61Jianmin Li, John Lillis, Chung-Kuan Cheng Linear decomposition algorithm for VLSI design applications. Search on Bibsonomy ICCAD The full citation details ... 1995 DBLP  DOI  BibTeX  RDF linear placement, max-flow min-cut, eigenvector, circuit partitioning
61Frank Vahid Modifying Min-Cut for Hardware and Software Functional Partitioning. Search on Bibsonomy CODES The full citation details ... 1997 DBLP  DOI  BibTeX  RDF Kernighan/Lin, min-cut, Functional partitioning
57Jue Wang 0001, Pravin Bhat, Alex Colburn, Maneesh Agrawala, Michael F. Cohen Interactive video cutout. Search on Bibsonomy ACM Trans. Graph. The full citation details ... 2005 DBLP  DOI  BibTeX  RDF alpha matting, interactive video processing, mean-shift segmentation, graph-cut, min-cut
56Xijin Yan, Jun Yang, Zhen Zhang 0010 An outer bound for multisource multisink network coding with minimum cost consideration. Search on Bibsonomy IEEE Trans. Inf. Theory The full citation details ... 2006 DBLP  DOI  BibTeX  RDF K-pairs transmission, max-flow min-cut bound, multisource multisink network, network sharing bound, three-layer network, network coding, side information
56Yuri Boykov, Vladimir Kolmogorov An Experimental Comparison of Min-Cut/Max-Flow Algorithms for Energy Minimization in Vision. Search on Bibsonomy IEEE Trans. Pattern Anal. Mach. Intell. The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
56L. James Hwang, Abbas El Gamal Min-cut replication in partitioned networks. Search on Bibsonomy IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. The full citation details ... 1995 DBLP  DOI  BibTeX  RDF
56Md. Altaf-Ul-Amin, Toshihiro Koma, Ken Kurokawa, Shigehiko Kanaya Prediction of Protein Functions Based on Protein-Protein Interaction Networks: A Min-Cut Approach. Search on Bibsonomy ICDE Workshops The full citation details ... 2005 DBLP  DOI  BibTeX  RDF heuristic method, min-cut, protein function prediction, protein-protein interaction network
56Mikkel Thorup Fully-dynamic min-cut. Search on Bibsonomy STOC The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
53Mark R. Hartoog Analysis of placement procedures for VLSI standard cell layout. Search on Bibsonomy DAC The full citation details ... 1986 DBLP  DOI  BibTeX  RDF
51Jarrod A. Roy, Saurabh N. Adya, David A. Papa, Igor L. Markov Min-cut floorplacement. Search on Bibsonomy IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
51Daniel Golovin, Vineet Goyal, R. Ravi 0001 Pay Today for a Rainy Day: Improved Approximation Algorithms for Demand-Robust Min-Cut and Shortest Path Problems. Search on Bibsonomy STACS The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
51Wai-Kei Mak Min-cut partitioning with functional replication fortechnology-mapped circuits using minimum area overhead. Search on Bibsonomy IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
51Wai-Kei Mak Min-cut partitioning with functional replication for technology mapped circuits using minimum area overhead. Search on Bibsonomy ISPD The full citation details ... 2001 DBLP  DOI  BibTeX  RDF minimum cut, circuit partitioning, logic replication
46Yuri Boykov, Vladimir Kolmogorov An Experimental Comparison of Min-cut/Max-flow Algorithms for Energy Minimization in Vision. Search on Bibsonomy EMMCVPR The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
45Anil Raj, Chris H. Wiggins 0001 An Information-Theoretic Derivation of Min-Cut-Based Clustering. Search on Bibsonomy IEEE Trans. Pattern Anal. Mach. Intell. The full citation details ... 2010 DBLP  DOI  BibTeX  RDF graph diffusion, clustering, Graphs, information theory, min-cut, Information Bottleneck
45Mechthild Stoer, Frank Wagner 0001 A simple min-cut algorithm. Search on Bibsonomy J. ACM The full citation details ... 1997 DBLP  DOI  BibTeX  RDF min-cut
44Gopalakrishnan Vijayan Generalization of Min-Cut Partitioning to Tree Structures and Its Applications. Search on Bibsonomy IEEE Trans. Computers The full citation details ... 1991 DBLP  DOI  BibTeX  RDF min-cut partitioning, hyperedges, VLSI design applications, iterative improvement heuristic, routing, computational complexity, data structures, trees (mathematics), hypergraph, minimisation, minimisation, tree structures, vertices, cost function, nodes, pins
44Frank Thomson Leighton, Satish Rao An Approximate Max-Flow Min-Cut Theorem for Uniform Multicommodity Flow Problems with Applications to Approximation Algorithms Search on Bibsonomy FOCS The full citation details ... 1988 DBLP  DOI  BibTeX  RDF max-flow min-cut theorem, minimum quotient separators, 1/3-2/3 separators, VLSI layout area, approximation algorithms, distributed networks, bifurcators, crossing number, multicommodity flow problems, optimal approximation
41Andrew B. Kahng, Sherief Reda Wirelength minimization for min-cut placements via placement feedback. Search on Bibsonomy IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
41Mala L. Radhakrishnan, Sara L. Su Dead-End Elimination as a Heuristic for Min-Cut Image Segmentation. Search on Bibsonomy ICIP The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
41José M. Bioucas-Dias, Gonçalo Valadão Phase unwrapping: a new max-flow/min-cut based approach. Search on Bibsonomy ICIP (2) The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
41Andrew B. Kahng, Igor L. Markov, Sherief Reda Boosting: Min-Cut Placement with Improved Signal Delay. Search on Bibsonomy DATE The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
41Honghua Yang, D. F. Wong 0001 Efficient network flow based min-cut balanced partitioning. Search on Bibsonomy ICCAD The full citation details ... 1994 DBLP  DOI  BibTeX  RDF
41Burkhard Monien, Ivan Hal Sudborough Min Cut is NP-Complete for Edge Weigthed Trees. Search on Bibsonomy ICALP The full citation details ... 1986 DBLP  DOI  BibTeX  RDF
40Andrew B. Kahng, Igor L. Markov, Sherief Reda On legalization of row-based placements. Search on Bibsonomy ACM Great Lakes Symposium on VLSI The full citation details ... 2004 DBLP  DOI  BibTeX  RDF min-cut placement, legalization, detailed placement
40Mikkel Thorup Fully-Dynamic Min-Cut. Search on Bibsonomy Comb. The full citation details ... 2007 DBLP  DOI  BibTeX  RDF Mathematics Subject Classification (2000): 68Q25, 68W05, 94C12, 94C15, 90B25, 68R10, 05C85, 05C40, 90B10
40Oktay Günlük A New Min-Cut Max-Flow Ratio for Multicommodity Flows. Search on Bibsonomy IPCO The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
38Hannah Honghua Yang, Martin D. F. Wong Balanced partitioning. Search on Bibsonomy IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. The full citation details ... 1996 DBLP  DOI  BibTeX  RDF
36Stanislav Zivný, David A. Cohen, Peter G. Jeavons The Expressive Power of Binary Submodular Functions. Search on Bibsonomy MFCS The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Decomposition of submodular functions, Pseudo-Boolean optimisation, Submodular function minimisation, Min-Cut
36Ming Leng, Songnian Yu, Yang Chen An Effective Refinement Algorithm Based on Multilevel Paradigm for Graph Bipartitioning. Search on Bibsonomy PROLAMAT The full citation details ... 2006 DBLP  DOI  BibTeX  RDF multilevel paradigm, Tabu search, min-cut, graph bipartitioning
35Yuanning Li, Yonghong Tian 0001, Jingjing Yang, Ling-Yu Duan, Wen Gao 0001 Video retargeting with multi-scale trajectory optimization. Search on Bibsonomy Multimedia Information Retrieval The full citation details ... 2010 DBLP  DOI  BibTeX  RDF max-flow/min-cut, multi-scale trajectory optimization, spatio-temporal saliency, video retargeting
35Dietmar Ebner, Bernhard Scholz, Andreas Krall Progressive spill code placement. Search on Bibsonomy CASES The full citation details ... 2009 DBLP  DOI  BibTeX  RDF constrained min-cut, spilling, register allocation, SSA form
35Guilherme Ottoni, David I. August Communication optimizations for global multi-threaded instruction scheduling. Search on Bibsonomy ASPLOS The full citation details ... 2008 DBLP  DOI  BibTeX  RDF graph min-cut, communication, synchronization, data-flow analysis, multi-threading, instruction scheduling
35Tung-Chieh Chen, Yi-Lin Chuang, Yao-Wen Chang X-architecture placement based on effective wire models. Search on Bibsonomy ISPD The full citation details ... 2007 DBLP  DOI  BibTeX  RDF X architecture, partitioning, placement, physical design, Steiner tree, min cut, net weighting
35Xue-Bin Liang Matrix games in the multicast networks: maximum information flows with network switching. Search on Bibsonomy IEEE Trans. Inf. Theory The full citation details ... 2006 DBLP  DOI  BibTeX  RDF achievable information rate regions, matrix games, max-flow min-cut theorems, maximum information flows, multisource multicast networks, network switching, route packings, switching gaps, game theory, network coding, multicast routes, set-covering problems
35Timothy Gatzke, Cindy Grimm Feature Detection Using Curvature Maps and the Min-cut/Max-flow Algorithm. Search on Bibsonomy GMP The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
33Maren Martens, S. Thomas McCormick A Polynomial Algorithm for Weighted Abstract Flow. Search on Bibsonomy IPCO The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
32Saurabh N. Adya, S. Chaturvedi, Jarrod A. Roy, David A. Papa, Igor L. Markov Unification of partitioning, placement and floorplanning. Search on Bibsonomy ICCAD The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
32Ghazi Al-Rawi, John M. Cioffi, Mark Horowitz Optimizing the Mapping of Low-Density Parity Check Codes on Parallel Decoding Architectures. Search on Bibsonomy ITCC The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
31Ramesh Hariharan, Telikepalli Kavitha, Debmalya Panigrahi Efficient algorithms for computing all low s-t edge connectivities and related problems. Search on Bibsonomy SODA The full citation details ... 2007 DBLP  BibTeX  RDF
30Henning Bruhn, Jakub Cerný, Alexander Hall, Petr Kolman Single source multiroute flows and cuts on uniform capacity networks. Search on Bibsonomy SODA The full citation details ... 2007 DBLP  BibTeX  RDF
30Nawal Houhou, Xavier Bresson, Arthur Szlam, Tony F. Chan, Jean-Philippe Thiran Semi-supervised Segmentation Based on Non-local Continuous Min-Cut. Search on Bibsonomy SSVM The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
30Bertrand Guenin A Short Proof of Seymour's Characterization of the Matroids with the Max-Flow Min-Cut Property. Search on Bibsonomy IPCO The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
30Volker Elling, Karsten Schwan Min-Cut Methods for Mapping Dataflow Graphs. Search on Bibsonomy Euro-Par The full citation details ... 1999 DBLP  DOI  BibTeX  RDF
30Dorothea Wagner, Frank Wagner 0001 Between Min Cut and Graph Bisection. Search on Bibsonomy MFCS The full citation details ... 1993 DBLP  DOI  BibTeX  RDF
30Masayuki Terai, Kazuhiro Takahashi, Koji Sato A New Min-Cut Placement Algorithm for Timing Assurance Layout Design Meeting Net Length Constraint. Search on Bibsonomy DAC The full citation details ... 1990 DBLP  DOI  BibTeX  RDF
30Song Guo 0001, Victor C. M. Leung A Distributed Algorithm for Min-Max Tree and Max-Min Cut Problems in Communication Networks. Search on Bibsonomy IEEE/ACM Trans. Netw. The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
30Hassene Aissi, Cristina Bazgan, Daniel Vanderpooten Complexity of the min-max (regret) versions of min cut problems. Search on Bibsonomy Discret. Optim. The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
30David R. Karger Global Min-cuts in RNC, and Other Ramifications of a Simple Min-Cut Algorithm. Search on Bibsonomy SODA The full citation details ... 1993 DBLP  DOI  BibTeX  RDF
29Sudhanshu Chanpuriya, Cameron Musco Latent Random Steps as Relaxations of Max-Cut, Min-Cut, and More. Search on Bibsonomy CoRR The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
29Amir Abboud, Robert Krauthgamer, Ohad Trabelsi Cut-Equivalent Trees are Optimal for Min-Cut Queries. Search on Bibsonomy CoRR The full citation details ... 2020 DBLP  BibTeX  RDF
29Amir Abboud, Robert Krauthgamer, Ohad Trabelsi Cut-Equivalent Trees are Optimal for Min-Cut Queries. Search on Bibsonomy FOCS The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
29Sagnik Mukhopadhyay, Danupon Nanongkai Weighted min-cut: sequential, cut-query, and streaming algorithms. Search on Bibsonomy STOC The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
29Sagnik Mukhopadhyay, Danupon Nanongkai Weighted Min-Cut: Sequential, Cut-Query and Streaming Algorithms. Search on Bibsonomy CoRR The full citation details ... 2019 DBLP  BibTeX  RDF
29Vladimir A. Bondarenko, Andrei V. Nikolaev On Graphs of the Cone Decompositions for the Min-Cut and Max-Cut Problems. Search on Bibsonomy Int. J. Math. Math. Sci. The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
28David R. Karger, Debmalya Panigrahi A near-linear time algorithm for constructing a cactus representation of minimum cuts. Search on Bibsonomy SODA The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
27Andrew 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
27Joseph S. B. Mitchell On Maximum Flows in Polyhedral Domains. Search on Bibsonomy SCG The full citation details ... 1988 DBLP  DOI  BibTeX  RDF
26Aurore Amaudruz, Christina Fragouli Combinatorial algorithms for wireless information flow. Search on Bibsonomy SODA The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
26Sagi Snir, Satish Rao Using Max Cut to Enhance Rooted Trees Consistency. Search on Bibsonomy IEEE ACM Trans. Comput. Biol. Bioinform. The full citation details ... 2006 DBLP  DOI  BibTeX  RDF rooted triplets, semidefinite programming, Phylogenetic trees, supertrees
26Charles J. Alpert, Tony F. Chan, Dennis J.-H. Huang, Igor L. Markov, Kenneth Yan Quadratic Placement Revisited. Search on Bibsonomy DAC The full citation details ... 1997 DBLP  DOI  BibTeX  RDF
26Timo Kötzing, Per Kristian Lehre, Frank Neumann 0001, Pietro S. Oliveto Ant colony optimization and the minimum cut problem. Search on Bibsonomy GECCO The full citation details ... 2010 DBLP  DOI  BibTeX  RDF ant colony optimization, min-cut
26David R. Karger Minimum cuts in near-linear time. Search on Bibsonomy J. ACM The full citation details ... 2000 DBLP  DOI  BibTeX  RDF tree packing, optimization, connectivity, min-cut, Monte Carlo algorithm
25Noga Alon, Baruch Awerbuch, Yossi Azar, Niv Buchbinder, Joseph Naor A general approach to online network optimization problems. Search on Bibsonomy ACM Trans. Algorithms The full citation details ... 2006 DBLP  DOI  BibTeX  RDF Online network optimization, group Steiner, multi-cuts, competitive analysis, facility location, randomized rounding
25Ishai Menache, Shie Mannor, Nahum Shimkin Q-Cut - Dynamic Discovery of Sub-goals in Reinforcement Learning. Search on Bibsonomy ECML The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
25Ravindra K. Ahuja, Thomas L. Magnanti, James B. Orlin Maximum Flow Problem. Search on Bibsonomy Encyclopedia of Optimization The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Minimum cut problem, Augmenting path algorithm, Preflow-push algorithm, Max-flow min-cut theorem, Network, Maximum flow problem
25Antonin Chambolle, Jérôme Darbon On Total Variation Minimization and Surface Evolution Using Parametric Maximum Flows. Search on Bibsonomy Int. J. Comput. Vis. The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Crystalline and anisotropic mean curvature flow, Max-flow/min-cut, Parametric max-flow algorithms, Total variation, Submodular functions, Variational approaches
25Vladimir Kolmogorov, Carsten Rother Minimizing Nonsubmodular Functions with Graph Cuts-A Review. Search on Bibsonomy IEEE Trans. Pattern Anal. Mach. Intell. The full citation details ... 2007 DBLP  DOI  BibTeX  RDF quadratic pseudo-Boolean optimization, min cut/max flow, texture restoration, Markov Random Fields, Energy minimization
25Ramesh Hariharan, Telikepalli Kavitha, Debmalya Panigrahi, Anand Bhalgat An Õ(mn) Gomory-Hu tree construction algorithm for unweighted graphs. Search on Bibsonomy STOC The full citation details ... 2007 DBLP  DOI  BibTeX  RDF Gomory-Hu tree, cut tree, steiner edge connectivity, edge connectivity, min cut
25Liang-Liang Xie, Panganamala R. Kumar On the path-loss attenuation regime for positive cost and linear scaling of transport capacity in wireless networks. Search on Bibsonomy IEEE Trans. Inf. Theory The full citation details ... 2006 DBLP  DOI  BibTeX  RDF capacity of wireless networks, cut-set bound, max-flow min-cut bound, multiuser information theory, ad hoc networks, wireless networks, scaling laws, transport capacity, network information theory
25Christina Fragouli, Tarik Tabet On conditions for constant throughput in wireless networks. Search on Bibsonomy ACM Trans. Sens. Networks The full citation details ... 2006 DBLP  DOI  BibTeX  RDF Foundations of sensor and ad hoc networks, constant throughput, min cut bounds, sensor networks throughput, mobility, wireless networks, mobility model, multicommodity flow
25Jingtao Yu, Pingyi Fan, Kai Cai Capacity analysis of maximal flow in ad hoc networks. Search on Bibsonomy IWCMC The full citation details ... 2006 DBLP  DOI  BibTeX  RDF max-flow min-cut, routing, network coding, random graph, network capacity
25Georg Baier, Ekkehard Köhler, Martin Skutella The k-Splittable Flow Problem. Search on Bibsonomy Algorithmica The full citation details ... 2005 DBLP  DOI  BibTeX  RDF Max-flow min-cut, Approximation algorithm, Network flow, Unsplittable flow
25Palash Sarkar 0001, Paul J. Schellenberg Construction of Symmetric Balanced Squares with Blocksize More than One. Search on Bibsonomy Des. Codes Cryptogr. The full citation details ... 2003 DBLP  DOI  BibTeX  RDF symmetric Latin square, symmetric balanced square, min cut-max flow theorem, combinatorial design
25Ioannis C. Avramopoulos, Miltiades E. Anagnostou Optimal Component Configuration and Component Routing. Search on Bibsonomy IEEE Trans. Mob. Comput. The full citation details ... 2002 DBLP  DOI  BibTeX  RDF component allocation, component mobility, multiterminal cuts, max flow—min cut, mixed binary integer programming, Mobile agents, reconfiguration, NP-hard problems
25Jon M. Kleinberg Single-Source Unsplittable Flow. Search on Bibsonomy FOCS The full citation details ... 1996 DBLP  DOI  BibTeX  RDF max-flow min-cut, scheduling, load balancing, generalization, NP-hard, unsplittable flow, machine scheduling, capacity constraints
25Philip N. Klein, Ajit Agrawal, R. Ravi 0001, Satish Rao Approximation through Multicommodity Flow Search on Bibsonomy FOCS The full citation details ... 1990 DBLP  DOI  BibTeX  RDF minimum deletion, max-flow-min-cut theorem, approximation algorithms, multicommodity flow
22Gopalakrishnan Vijayan Partitioning logic on graph structures to minimize routing cost. Search on Bibsonomy IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. The full citation details ... 1990 DBLP  DOI  BibTeX  RDF
21L. Darrell Whitley, Andrew M. Sutton Partial neighborhoods of elementary landscapes. Search on Bibsonomy GECCO The full citation details ... 2009 DBLP  DOI  BibTeX  RDF elementary landscapes, fitness landscapes
21Stanislav Zivný, Peter G. Jeavons The Complexity of Valued Constraint Models. Search on Bibsonomy CP The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
21Yung-Chuan Jiang, Jhing-Fa Wang Temporal Partitioning Data Flow Graphs for Dynamically Reconfigurable Computing. Search on Bibsonomy IEEE Trans. Very Large Scale Integr. Syst. The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
21Mohit Lad, Ricardo V. Oliveira, Daniel Massey, Lixia Zhang 0001 Inferring the Origin of Routing Changes using Link Weights. Search on Bibsonomy ICNP The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
21Sidharth Jaggi, Peter Sanders 0001, Philip A. Chou, Michelle Effros, Sebastian Egner, Kamal Jain, Ludo M. G. M. Tolhuizen Polynomial time algorithms for multicast network code construction. Search on Bibsonomy IEEE Trans. Inf. Theory The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
21Aseem Agarwala, Ke Colin Zheng, Chris Pal, Maneesh Agrawala, Michael F. Cohen, Brian Curless, David Salesin, Richard Szeliski Panoramic video textures. Search on Bibsonomy ACM Trans. Graph. The full citation details ... 2005 DBLP  DOI  BibTeX  RDF panoramas, video-based rendering, video textures
21Indra Geys, Thomas P. Koninckx, Luc Van Gool Fast Interpolated Cameras by Combining a GPU based Plane Sweep with a Max-Flow Regularisation Algorithm. Search on Bibsonomy 3DPVT The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
21Jittat Fakcharoenphol, Kunal Talwar An Improved Decomposition Theorem for Graphs Excluding a Fixed Minor. Search on Bibsonomy RANDOM-APPROX The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
21Peter Sanders 0001, Sebastian Egner, Ludo M. G. M. Tolhuizen Polynomial time algorithms for network information flow. Search on Bibsonomy SPAA The full citation details ... 2003 DBLP  DOI  BibTeX  RDF communication, multicasting, randomized algorithm, finite field, coding, linear algebra, derandomization, network information theory
21Chris Buehler, Steven J. Gortler, Michael F. Cohen, Leonard McMillan Minimal Surfaces for Stereo. Search on Bibsonomy ECCV (3) The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
Displaying result #1 - #100 of 398 (100 per page; Change: )
Pages: [1][2][3][4][>>]
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