Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
106 | Shun-Wen Cheng, Kuo-Hsing Cheng |
ENISLE: an intuitive heuristic nearly optimal solution for mincut and ratio mincut partitioning. |
ISCAS (5) |
2001 |
DBLP DOI BibTeX RDF |
|
106 | Sung Kwon Kim |
An efficient parallel algorithm for the planar mincut linear arrangement problem for trees. |
ISPAN |
1997 |
DBLP DOI BibTeX RDF |
planar mincut, parallel algorithm, NP-complete, trees (mathematics), EREW PRAM, polynomial-time solvable |
78 | Shantanu Dutt, Wenyong Deng |
Cluster-aware iterative improvement techniques for partitioning large VLSI circuits. |
ACM Trans. Design Autom. Electr. Syst. |
2002 |
DBLP DOI BibTeX RDF |
VLSI circuit partitioning, mincut, physical design/layout, Clusters, iterative-improvement |
71 | Vladimir Lipets |
Bounds on Mincut for Cayley Graphs over Abelian Groups. |
Theory Comput. Syst. |
2009 |
DBLP DOI BibTeX RDF |
Mincut, Algorithms, Graph theory, Combinatorial optimization, Bounds, Cayley graphs, Bisection |
62 | Jason Cong, Sung Kyu Lim |
Retiming-based timing analysis with an application to mincut-based global placement. |
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. |
2004 |
DBLP DOI BibTeX RDF |
|
61 | Shantanu Dutt, Halim Theny |
Partitioning around roadblocks: tackling constraints with intermediate relaxations. |
ICCAD |
1997 |
DBLP DOI BibTeX RDF |
balance-ratio constraint, benefit estimation, blind relaxation, constraint-driven partitioning, estimate-driven relaxation, mincut partitioning, probabilistic gain, violating moves |
44 | Pushmeet Kohli, Philip H. S. Torr |
Dynamic Graph Cuts for Efficient Inference in Markov Random Fields. |
IEEE Trans. Pattern Anal. Mach. Intell. |
2007 |
DBLP DOI BibTeX RDF |
Dynamic graph cuts, st-mincut, Markov Random Fields, Energy Minimization, Video segmentation, Maximum flow |
34 | Yajie Miao, Chunping Li |
Topical Analysis for Identification of Web Communities. |
Australasian Conference on Artificial Intelligence |
2009 |
DBLP DOI BibTeX RDF |
Link Analysis, Web Community, Topical Analysis, Web Structure Mining |
34 | David Bañeres, Jordi Cortadella, Michael Kishinevsky |
Dominator-based partitioning for delay optimization. |
ACM Great Lakes Symposium on VLSI |
2006 |
DBLP DOI BibTeX RDF |
logic design, timing optimization, logic partitioning |
34 | Pushmeet Kohli, Philip H. S. Torr |
Effciently Solving Dynamic Markov Random Fields Using Graph Cuts. |
ICCV |
2005 |
DBLP DOI BibTeX RDF |
|
34 | Francisco J. Estrada, Allan D. Jepson |
Quantitative Evaluation of a Novel Image Segmentation Algorithm. |
CVPR (2) |
2005 |
DBLP DOI BibTeX RDF |
|
34 | L. Sunil Chandran, N. S. Narayanaswamy |
On the Arrangement of Cliques in Chordal Graphs with Respect to the Cuts. |
COCOON |
2004 |
DBLP DOI BibTeX RDF |
|
34 | Avrim Blum, John D. Lafferty, Mugizi Robert Rwebangira, Rajashekar Reddy |
Semi-supervised learning using randomized mincuts. |
ICML |
2004 |
DBLP DOI BibTeX RDF |
|
34 | Shantanu Dutt, Hasan Arslan, Halim Theny |
Partitioning using second-order information and stochastic-gainfunctions. |
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. |
1999 |
DBLP DOI BibTeX RDF |
|
34 | Kanad Chakraborty, Natesan Venkateswaran |
Congestion Mitigation During Placement. |
Great Lakes Symposium on VLSI |
1999 |
DBLP DOI BibTeX RDF |
|
34 | Shantanu Dutt, Halim Theny |
Partitioning using second-order information and stochastic-gain functions. |
ISPD |
1998 |
DBLP DOI BibTeX RDF |
|
27 | Chi Thang Duong, Thanh Tam Nguyen, Trung-Dung Hoang, Hongzhi Yin, Matthias Weidlich 0001, Quoc Viet Hung Nguyen |
Deep MinCut: Learning Node Embeddings by Detecting Communities. |
Pattern Recognit. |
2023 |
DBLP DOI BibTeX RDF |
|
27 | Surender Baswana, Koustav Bhanja |
Vital Edges for (s, t)-mincut: Efficient Algorithms, Compact Structures, and Optimal Sensitivity Oracle. |
CoRR |
2023 |
DBLP DOI BibTeX RDF |
|
27 | Surender Baswana, Shiv Kumar Gupta 0001, Till Knollmann |
Mincut Sensitivity Data Structures for the Insertion of an Edge. |
Algorithmica |
2022 |
DBLP DOI BibTeX RDF |
|
27 | Jason Li |
Deterministic Mincut in Almost-Linear Time. |
CoRR |
2021 |
DBLP BibTeX RDF |
|
27 | Jason Li 0006 |
Deterministic mincut in almost-linear time. |
STOC |
2021 |
DBLP DOI BibTeX RDF |
|
27 | Avah Banerjee, Guoli Ding |
Online Mincut: Advice, Randomization and More. |
CoRR |
2020 |
DBLP BibTeX RDF |
|
27 | Surender Baswana, Shiv Kumar Gupta 0001, Till Knollmann |
Mincut Sensitivity Data Structures for the Insertion of an Edge. |
ESA |
2020 |
DBLP DOI BibTeX RDF |
|
27 | Filippo Maria Bianchi, Daniele Grattarola, Cesare Alippi |
Mincut pooling in Graph Neural Networks. |
CoRR |
2019 |
DBLP BibTeX RDF |
|
27 | Alexander Shekhovtsov, Václav Hlavác |
A Distributed Mincut/Maxflow Algorithm Combining Path Augmentation and Push-Relabel. |
Int. J. Comput. Vis. |
2013 |
DBLP DOI BibTeX RDF |
|
27 | Victor S. Lempitsky, Andrew Blake 0001, Carsten Rother |
Branch-and-Mincut: Global Optimization for Image Segmentation with High-Level Priors. |
J. Math. Imaging Vis. |
2012 |
DBLP DOI BibTeX RDF |
|
27 | Debasree Maity, Indrajit Saha, Ujjwal Maulik, Dariusz Plewczynski |
Soft Computing Approach for VLSI Mincut Partitioning: The State of the Arts. |
SocProS |
2012 |
DBLP DOI BibTeX RDF |
|
27 | Alexander Shekhovtsov, Václav Hlavác |
A Distributed Mincut/Maxflow Algorithm Combining Path Augmentation and Push-Relabel |
CoRR |
2011 |
DBLP BibTeX RDF |
|
27 | Se Yong Park, Anant Sahai |
An algebraic mincut-maxflow theorem. |
ISIT |
2011 |
DBLP DOI BibTeX RDF |
|
27 | Alexander Shekhovtsov, Václav Hlavác |
A Distributed Mincut/Maxflow Algorithm Combining Path Augmentation and Push-Relabel. |
EMMCVPR |
2011 |
DBLP DOI BibTeX RDF |
|
27 | Eduardo Sáenz-de-Cabezón, Henry P. Wynn |
Mincut ideals of two-terminal networks. |
Appl. Algebra Eng. Commun. Comput. |
2010 |
DBLP DOI BibTeX RDF |
|
27 | Valentin Polishchuk, Mikko Sysikaski |
Improved approximations for robust mincut and shortest path |
CoRR |
2010 |
DBLP BibTeX RDF |
|
27 | Sang Hyun Park 0004, Soochahn Lee, Hackjoon Shim, Il Dong Yun, Sang Uk Lee, Kyoung Ho Lee, Heung Sik Kang, Joon Koo Han |
Fully automatic 3-D segmentation of knee bone compartments by iterative local branch-and-mincut on MR images from osteoarthritis initiative (OAI). |
ICIP |
2009 |
DBLP DOI BibTeX RDF |
|
27 | Wei Feng 0005, Lei Xie 0001, Zhi-Qiang Liu |
Multicue Graph Mincut for Image Segmentation. |
ACCV (2) |
2009 |
DBLP DOI BibTeX RDF |
|
27 | Gerhard Reinelt, Dirk Oliver Theis, Klaus Michael Wenger |
Computing finest mincut partitions of a graph and application to routing problems. |
Discret. Appl. Math. |
2008 |
DBLP DOI BibTeX RDF |
|
27 | Victor S. Lempitsky, Andrew Blake 0001, Carsten Rother |
Image Segmentation by Branch-and-Mincut. |
ECCV (4) |
2008 |
DBLP DOI BibTeX RDF |
|
27 | Kuo-Hsing Cheng, Shun-Wen Cheng |
Influences of minimum cut plane properties on the mincut circuit partitioning problems. |
ICECS |
2002 |
DBLP DOI BibTeX RDF |
|
27 | Thomas Epping, Winfried Hochstättler, Marco E. Lübbecke |
MaxFlow-MinCut Duality for a Paint Shop Problem. |
OR |
2002 |
DBLP DOI BibTeX RDF |
|
27 | Roderic D. M. Page |
Modified Mincut Supertrees. |
WABI |
2002 |
DBLP DOI BibTeX RDF |
|
27 | Kuo-Hsing Cheng, Shun-Wen Cheng |
A study on the relationship between initial node-edge pairs entropy and mincut circuit partitioning. |
ICECS |
2001 |
DBLP DOI BibTeX RDF |
|
27 | P. Sadayappan, Fikret Erçal, J. Ramanujam |
Partitioning Graphs on Message-Passing Machines by Pairwise Mincut. |
Inf. Sci. |
1998 |
DBLP DOI BibTeX RDF |
|
27 | Masahiro Sano, Shintaro Shimogori, Fumiyasu Hirose |
Acceleration of mincut partitioning using hardware CAD accelerator TP5000. |
ASP-DAC |
1997 |
DBLP DOI BibTeX RDF |
|
27 | Harold N. Gabow |
Perfect Arborescence Packing in Preflow Mincut Graphs. |
SODA |
1996 |
DBLP DOI BibTeX RDF |
|
27 | Edmund Ihler, Dorothea Wagner, Frank Wagner 0001 |
Modeling Hypergraphs by Graphs with the Same Mincut Properties. |
Inf. Process. Lett. |
1993 |
DBLP DOI BibTeX RDF |
|
27 | Shin'ichi Wakabayashi, Hiroshi Kusumoto, Hideki Mishima, Tetsushi Koide, Noriyoshi Yoshida |
Gate Array Placement Based on Mincut, Partitioning with Path Delay Constraints. |
ISCAS |
1993 |
DBLP BibTeX RDF |
|
27 | Achim G. Hoffmann |
Towards optimizing global MinCut partitioning. |
EURO-DAC |
1991 |
DBLP BibTeX RDF |
|
27 | Fikret Erçal, J. Ramanujam, P. Sadayappan |
Task Allocation onto a Hypercube by Recursive Mincut Bipartitioning. |
J. Parallel Distributed Comput. |
1990 |
DBLP DOI BibTeX RDF |
|
27 | Fikret Erçal, J. Ramanujam, P. Sadayappan |
Task allocation onto a hypercube by recursive mincut bipartitioning. |
C³P |
1988 |
DBLP DOI BibTeX RDF |
|
27 | Carl Sechen, Dahe Chen |
An improved objective function for mincut circuit partitioning. |
ICCAD |
1988 |
DBLP DOI BibTeX RDF |
|
27 | Eitan M. Gurari, Ivan Hal Sudborough |
Improved Dynamic Programming Algorithms for Bandwidth Minimization and the MinCut Linear Arrangement Problem. |
J. Algorithms |
1984 |
DBLP DOI BibTeX RDF |
|
27 | Tung-Chieh Chen, Tien-Chang Hsu, Zhe-Wei Jiang, Yao-Wen Chang |
NTUplace: a ratio partitioning based placement algorithm for large-scale mixed-size designs. |
ISPD |
2005 |
DBLP DOI BibTeX RDF |
mincut, ratio cut, placement |
27 | Subhashis Majumder, Subhas C. Nandy, Bhargab B. Bhattacharya |
Partitioning VLSI Floorplans by Staircase Channels for Global Routing. |
VLSI Design |
1998 |
DBLP DOI BibTeX RDF |
maxflow-mincut, algorithms, complexity, partitioning, NP-completeness, Global routing |
17 | Pushmeet Kohli, Lubor Ladicky, Philip H. S. Torr |
Robust Higher Order Potentials for Enforcing Label Consistency. |
Int. J. Comput. Vis. |
2009 |
DBLP DOI BibTeX RDF |
Discrete energy minimization, Markov and conditional random fields, Object recognition and segmentation |
17 | Kalin Kolev, Maria Klodt, Thomas Brox, Daniel Cremers |
Continuous Global Optimization in Multiview 3D Reconstruction. |
Int. J. Comput. Vis. |
2009 |
DBLP DOI BibTeX RDF |
Continuous global minimization, Multiview 3D reconstruction, Convex optimization |
17 | Yuri Rabinovich |
On Average Distortion of Embedding Metrics into the Line. |
Discret. Comput. Geom. |
2008 |
DBLP DOI BibTeX RDF |
Average distortion, Metric embeddings |
17 | Dirk Sudholt |
Memetic algorithms with variable-depth search to overcome local optima. |
GECCO |
2008 |
DBLP DOI BibTeX RDF |
Kernighan-Lin, variable-depth search, simulated annealing, combinatorial optimization, memetic algorithms, runtime analysis |
17 | Ilan Newman, Yuri Rabinovich |
Hard Metrics from Cayley Graphs of Abelian Groups. |
STACS |
2007 |
DBLP DOI BibTeX RDF |
|
17 | Pushmeet Kohli, M. Pawan Kumar, Philip H. S. Torr |
P3 & Beyond: Solving Energies with Higher Order Cliques. |
CVPR |
2007 |
DBLP DOI BibTeX RDF |
|
17 | Julia Chuzhoy, Sanjeev Khanna |
Polynomial flow-cut gaps and hardness of directed cut problems. |
STOC |
2007 |
DBLP DOI BibTeX RDF |
concurrent flow, directed multicut, directed sparsest cut, flow-cut gaps, hardness of approximation, multicommodity flow |
17 | Kalin Kolev, Maria Klodt, Thomas Brox, Selim Esedoglu, Daniel Cremers |
Continuous Global Optimization in Multiview 3D Reconstruction. |
EMMCVPR |
2007 |
DBLP DOI BibTeX RDF |
|
17 | Dmitrij Schlesinger |
Exact Solution of Permuted Submodular MinSum Problems. |
EMMCVPR |
2007 |
DBLP DOI BibTeX RDF |
|
17 | Zhong-Zhen Wu, Shih-Chieh Chang |
Multiple wire reconnections based on implication flow graph. |
ACM Trans. Design Autom. Electr. Syst. |
2006 |
DBLP DOI BibTeX RDF |
global flow optimization (GFO), implication flow graph (IFG), mandatory assignment, multiple wire reconnection, redundant wire, Automatic test pattern generation (ATPG) |
17 | Sudipta N. Sinha, Marc Pollefeys |
Multi-View Reconstruction Using Photo-consistency and Exact Silhouette Constraints: A Maximum-Flow Formulation. |
ICCV |
2005 |
DBLP DOI BibTeX RDF |
|
17 | Enrique Mérida Casermeiro, Domingo López-Rodríguez |
Graph Partitioning via Recurrent Multivalued Neural Networks. |
IWANN |
2005 |
DBLP DOI BibTeX RDF |
|
17 | Shlomo Moran, Satish Rao, Sagi Snir |
Using Semi-definite Programming to Enhance Supertree Resolvability. |
WABI |
2005 |
DBLP DOI BibTeX RDF |
|
17 | Chandra Chekuri, Sanjeev Khanna, F. Bruce Shepherd |
Edge-Disjoint Paths in Planar Graphs. |
FOCS |
2004 |
DBLP DOI BibTeX RDF |
|
17 | Mongkol Ekpanyapong, Sung Kyu Lim |
Performance-driven global placement via adaptive network characterization. |
ASP-DAC |
2004 |
DBLP DOI BibTeX RDF |
|
17 | Yuri Rabinovich |
On average distortion of embedding metrics into the line and into L1. |
STOC |
2003 |
DBLP DOI BibTeX RDF |
average metric distortion, planar metrics, finite metric spaces |
17 | Rajeev Murgai |
Efficient global fanout optimization algorithms. |
ASP-DAC |
2001 |
DBLP DOI BibTeX RDF |
|
17 | Shantanu Dutt, Wenyong Deng |
Probability-based approaches to VLSI circuit partitioning. |
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. |
2000 |
DBLP DOI BibTeX RDF |
|
17 | Andrew E. Caldwell, Andrew B. Kahng, Igor L. Markov |
Can recursive bisection alone produce routable placements? |
DAC |
2000 |
DBLP DOI BibTeX RDF |
|
17 | Stephen L. Hary, Füsun Özgüner |
Precedence-Constrained Task Allocation onto Point-to-Point Networks for Pipelined Execution. |
IEEE Trans. Parallel Distributed Syst. |
1999 |
DBLP DOI BibTeX RDF |
real-time systems, Task scheduling, direct networks, message scheduling, pipeline scheduling |
17 | Charles J. Alpert, Jen-Hsin Huang, Andrew B. Kahng |
Multilevel circuit partitioning. |
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. |
1998 |
DBLP DOI BibTeX RDF |
|
17 | Raymond Lo, Sun Chan, James C. Dehnert, Ross A. Towle |
Aggregate Operation Movement: A Min-Cut Approach to Global Code Motion. |
Euro-Par, Vol. II |
1996 |
DBLP DOI BibTeX RDF |
global code motion, software pipelining, network flow, superscalar, minimum cut, global scheduling |
17 | Manfred Wiegers |
The k-section of Treewidth Restricted Graphs. |
MFCS |
1990 |
DBLP DOI BibTeX RDF |
|
17 | Victor Y. Pan, John H. Reif |
Extension of the Parallel Nested Dissection Algorithm to Path Algebra Problems. |
FSTTCS |
1986 |
DBLP DOI BibTeX RDF |
|