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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISCAS (5) ![In: Proceedings of the 2001 International Symposium on Circuits and Systems, ISCAS 2001, Sydney, Australia, May 6-9, 2001, pp. 167-170, 2001, IEEE, 0-7803-6685-9. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
106 | Sung Kwon Kim |
An efficient parallel algorithm for the planar mincut linear arrangement problem for trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISPAN ![In: 1997 International Symposium on Parallel Architectures, Algorithms and Networks (ISPAN '97), 18-20 December 1997, Taipei, Taiwan, pp. 240-246, 1997, IEEE Computer Society, 0-8186-8259-0. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Design Autom. Electr. Syst. ![In: ACM Trans. Design Autom. Electr. Syst. 7(1), pp. 91-121, 2002. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theory Comput. Syst. ![In: Theory Comput. Syst. 45(2), pp. 372-380, 2009. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. ![In: IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 23(12), pp. 1684-1692, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
61 | Shantanu Dutt, Halim Theny |
Partitioning around roadblocks: tackling constraints with intermediate relaxations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICCAD ![In: Proceedings of the 1997 IEEE/ACM International Conference on Computer-Aided Design, ICCAD 1997, San Jose, CA, USA, November 9-13, 1997, pp. 350-355, 1997, IEEE Computer Society / ACM, 0-8186-8200-0. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Pattern Anal. Mach. Intell. ![In: IEEE Trans. Pattern Anal. Mach. Intell. 29(12), pp. 2079-2088, 2007. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Australasian Conference on Artificial Intelligence ![In: AI 2009: Advances in Artificial Intelligence, 22nd Australasian Joint Conference, Melbourne, Australia, December 1-4, 2009. Proceedings, pp. 101-110, 2009, Springer, 978-3-642-10438-1. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Great Lakes Symposium on VLSI ![In: Proceedings of the 16th ACM Great Lakes Symposium on VLSI 2006, Philadelphia, PA, USA, April 30 - May 1, 2006, pp. 67-72, 2006, ACM, 1-59593-347-6. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICCV ![In: 10th IEEE International Conference on Computer Vision (ICCV 2005), 17-20 October 2005, Beijing, China, pp. 922-929, 2005, IEEE Computer Society, 0-7695-2334-X. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
34 | Francisco J. Estrada, Allan D. Jepson |
Quantitative Evaluation of a Novel Image Segmentation Algorithm. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CVPR (2) ![In: 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR 2005), 20-26 June 2005, San Diego, CA, USA, pp. 1132-1139, 2005, IEEE Computer Society, 0-7695-2372-2. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COCOON ![In: Computing and Combinatorics, 10th Annual International Conference, COCOON 2004, Jeju Island, Korea, August 17-20, 2004, Proceedings, pp. 151-160, 2004, Springer, 3-540-22856-X. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
34 | Avrim Blum, John D. Lafferty, Mugizi Robert Rwebangira, Rajashekar Reddy |
Semi-supervised learning using randomized mincuts. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICML ![In: Machine Learning, Proceedings of the Twenty-first International Conference (ICML 2004), Banff, Alberta, Canada, July 4-8, 2004, 2004, ACM. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
34 | Shantanu Dutt, Hasan Arslan, Halim Theny |
Partitioning using second-order information and stochastic-gainfunctions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. ![In: IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 18(4), pp. 421-435, 1999. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
34 | Kanad Chakraborty, Natesan Venkateswaran |
Congestion Mitigation During Placement. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Great Lakes Symposium on VLSI ![In: 9th Great Lakes Symposium on VLSI (GLS-VLSI '99), 4-6 March 1999, Ann Arbor, MI, USA, pp. 228-229, 1999, IEEE Computer Society, 0-7695-0104-4. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
34 | Shantanu Dutt, Halim Theny |
Partitioning using second-order information and stochastic-gain functions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISPD ![In: Proceedings of the 1998 International Symposium on Physical Design, ISPD 1998, Monterey, CA, USA, April 6-8, 1998, pp. 112-117, 1998, ACM, 1-58113-021-X. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Pattern Recognit. ![In: Pattern Recognit. 134, pp. 109126, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
27 | Surender Baswana, Koustav Bhanja |
Vital Edges for (s, t)-mincut: Efficient Algorithms, Compact Structures, and Optimal Sensitivity Oracle. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2310.12096, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
27 | Surender Baswana, Shiv Kumar Gupta 0001, Till Knollmann |
Mincut Sensitivity Data Structures for the Insertion of an Edge. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 84(9), pp. 2702-2734, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
27 | Jason Li |
Deterministic Mincut in Almost-Linear Time. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2106.05513, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP BibTeX RDF |
|
27 | Jason Li 0006 |
Deterministic mincut in almost-linear time. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: STOC '21: 53rd Annual ACM SIGACT Symposium on Theory of Computing, Virtual Event, Italy, June 21-25, 2021., pp. 384-395, 2021, ACM, 978-1-4503-8053-9. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
27 | Avah Banerjee, Guoli Ding |
Online Mincut: Advice, Randomization and More. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2004.12223, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP BibTeX RDF |
|
27 | Surender Baswana, Shiv Kumar Gupta 0001, Till Knollmann |
Mincut Sensitivity Data Structures for the Insertion of an Edge. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: 28th Annual European Symposium on Algorithms, ESA 2020, September 7-9, 2020, Pisa, Italy (Virtual Conference)., pp. 12:1-12:14, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-162-7. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
27 | Filippo Maria Bianchi, Daniele Grattarola, Cesare Alippi |
Mincut pooling in Graph Neural Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1907.00481, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP BibTeX RDF |
|
27 | Alexander Shekhovtsov, Václav Hlavác |
A Distributed Mincut/Maxflow Algorithm Combining Path Augmentation and Push-Relabel. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Int. J. Comput. Vis. ![In: Int. J. Comput. Vis. 104(3), pp. 315-342, 2013. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Math. Imaging Vis. ![In: J. Math. Imaging Vis. 44(3), pp. 315-329, 2012. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SocProS ![In: Proceedings of the Second International Conference on Soft Computing for Problem Solving, SocProS 2012, December 28-30, 2012, JK Lakshmipat University (JKLU), Jaipur, India, pp. 895-903, 2012, Springer, 978-81-322-1601-8. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
27 | Alexander Shekhovtsov, Václav Hlavác |
A Distributed Mincut/Maxflow Algorithm Combining Path Augmentation and Push-Relabel ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1109.1146, 2011. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP BibTeX RDF |
|
27 | Se Yong Park, Anant Sahai |
An algebraic mincut-maxflow theorem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISIT ![In: 2011 IEEE International Symposium on Information Theory Proceedings, ISIT 2011, St. Petersburg, Russia, July 31 - August 5, 2011, pp. 608-612, 2011, IEEE, 978-1-4577-0596-0. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
27 | Alexander Shekhovtsov, Václav Hlavác |
A Distributed Mincut/Maxflow Algorithm Combining Path Augmentation and Push-Relabel. ![Search on Bibsonomy](Pics/bibsonomy.png) |
EMMCVPR ![In: Energy Minimazation Methods in Computer Vision and Pattern Recognition - 8th International Conference, EMMCVPR 2011, St. Petersburg, Russia, July 25-27, 2011. Proceedings, pp. 1-16, 2011, Springer, 978-3-642-23093-6. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
27 | Eduardo Sáenz-de-Cabezón, Henry P. Wynn |
Mincut ideals of two-terminal networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Appl. Algebra Eng. Commun. Comput. ![In: Appl. Algebra Eng. Commun. Comput. 21(6), pp. 443-457, 2010. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
27 | Valentin Polishchuk, Mikko Sysikaski |
Improved approximations for robust mincut and shortest path ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1010.2885, 2010. The full citation details ...](Pics/full.jpeg) |
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). ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICIP ![In: Proceedings of the International Conference on Image Processing, ICIP 2009, 7-10 November 2009, Cairo, Egypt, pp. 3381-3384, 2009, IEEE, 978-1-4244-5654-3. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
27 | Wei Feng 0005, Lei Xie 0001, Zhi-Qiang Liu |
Multicue Graph Mincut for Image Segmentation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACCV (2) ![In: Computer Vision - ACCV 2009, 9th Asian Conference on Computer Vision, Xi'an, China, September 23-27, 2009, Revised Selected Papers, Part II, pp. 707-717, 2009, Springer, 978-3-642-12303-0. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Appl. Math. ![In: Discret. Appl. Math. 156(3), pp. 385-396, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
27 | Victor S. Lempitsky, Andrew Blake 0001, Carsten Rother |
Image Segmentation by Branch-and-Mincut. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ECCV (4) ![In: Computer Vision - ECCV 2008, 10th European Conference on Computer Vision, Marseille, France, October 12-18, 2008, Proceedings, Part IV, pp. 15-29, 2008, Springer, 978-3-540-88692-1. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
27 | Kuo-Hsing Cheng, Shun-Wen Cheng |
Influences of minimum cut plane properties on the mincut circuit partitioning problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICECS ![In: Proceedings of the 2002 9th IEEE International Conference on Electronics, Circuits and Systems, ICECS 2002, Dubrovnik, Croatia, September 15-18, 2002, pp. 375-379, 2002, IEEE, 0-7803-7596-3. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
27 | Thomas Epping, Winfried Hochstättler, Marco E. Lübbecke |
MaxFlow-MinCut Duality for a Paint Shop Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
OR ![In: Operations Research Proceedings 2002, Selected Papers of the International Conference on Operations Research (SOR 2002), Klagenfurt, Austria, September 2-5, 2002, pp. 377-382, 2002, Springer, 978-3-540-00387-8. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
27 | Roderic D. M. Page |
Modified Mincut Supertrees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WABI ![In: Algorithms in Bioinformatics, Second International Workshop, WABI 2002, Rome, Italy, September 17-21, 2002, Proceedings, pp. 537-552, 2002, Springer, 3-540-44211-1. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICECS ![In: Proceedings of the 2001 8th IEEE International Conference on Electronics, Circuits and Systems, ICECS 2001, Malta, September 2-5, 2001, pp. 889-893, 2001, IEEE, 0-7803-7057-0. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
27 | P. Sadayappan, Fikret Erçal, J. Ramanujam |
Partitioning Graphs on Message-Passing Machines by Pairwise Mincut. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Inf. Sci. ![In: Inf. Sci. 111(1-4), pp. 223-237, 1998. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
|
27 | Masahiro Sano, Shintaro Shimogori, Fumiyasu Hirose |
Acceleration of mincut partitioning using hardware CAD accelerator TP5000. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ASP-DAC ![In: Proceedings of the ASP-DAC '97 Asia and South Pacific Design Automation Conference, Nippon Convention Center, Chiba, Japan, January 28-31, 1997, pp. 61-64, 1997, IEEE, 0-7803-3663-1. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
|
27 | Harold N. Gabow |
Perfect Arborescence Packing in Preflow Mincut Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 28-30 January 1996, Atlanta, Georgia, USA., pp. 528-538, 1996, ACM/SIAM, 0-89871-366-8. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
|
27 | Edmund Ihler, Dorothea Wagner, Frank Wagner 0001 |
Modeling Hypergraphs by Graphs with the Same Mincut Properties. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Inf. Process. Lett. ![In: Inf. Process. Lett. 45(4), pp. 171-175, 1993. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISCAS ![In: 1993 IEEE International Symposium on Circuits and Systems, ISCAS 1993, Chicago, Illinois, USA, May 3-6, 1993, pp. 2059-2062, 1993, IEEE, 0-7803-1281-3. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP BibTeX RDF |
|
27 | Achim G. Hoffmann |
Towards optimizing global MinCut partitioning. ![Search on Bibsonomy](Pics/bibsonomy.png) |
EURO-DAC ![In: Proceedings of the conference on European design automation, EURO-DAC'91, Amsterdam, The Netherlands, 1991, pp. 167-171, 1991, EEE Computer Society, 0-8186-2130-3. The full citation details ...](Pics/full.jpeg) |
1991 |
DBLP BibTeX RDF |
|
27 | Fikret Erçal, J. Ramanujam, P. Sadayappan |
Task Allocation onto a Hypercube by Recursive Mincut Bipartitioning. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Parallel Distributed Comput. ![In: J. Parallel Distributed Comput. 10(1), pp. 35-44, 1990. The full citation details ...](Pics/full.jpeg) |
1990 |
DBLP DOI BibTeX RDF |
|
27 | Fikret Erçal, J. Ramanujam, P. Sadayappan |
Task allocation onto a hypercube by recursive mincut bipartitioning. ![Search on Bibsonomy](Pics/bibsonomy.png) |
C³P ![In: Proceedings of the Third Conference on Hypercube Concurrent Computers and Applications - Architecture, Software, Computer Systems, and General Issues, C³P, Pasadena, California, USA, January 19-20, 1988, pp. 210-221, 1988, ACM, 978-0-89791-278-5. The full citation details ...](Pics/full.jpeg) |
1988 |
DBLP DOI BibTeX RDF |
|
27 | Carl Sechen, Dahe Chen |
An improved objective function for mincut circuit partitioning. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICCAD ![In: 1988 IEEE International Conference on Computer-Aided Design, ICCAD 1988, Santa Clara, CA, USA, November 7-10, 1988. Digest of Technical Papers, pp. 502-505, 1988, IEEE Computer Society, 0-8186-0869-2. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Algorithms ![In: J. Algorithms 5(4), pp. 531-546, 1984. The full citation details ...](Pics/full.jpeg) |
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. ![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. 236-238, 2005, ACM, 1-59593-021-3. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
VLSI Design ![In: 11th International Conference on VLSI Design (VLSI Design 1991), 4-7 January 1998, Chennai, India, pp. 59-64, 1998, IEEE Computer Society, 0-8186-8224-8. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Int. J. Comput. Vis. ![In: Int. J. Comput. Vis. 82(3), pp. 302-324, 2009. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Int. J. Comput. Vis. ![In: Int. J. Comput. Vis. 84(1), pp. 80-96, 2009. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Comput. Geom. ![In: Discret. Comput. Geom. 39(4), pp. 720-733, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Average distortion, Metric embeddings |
17 | Dirk Sudholt |
Memetic algorithms with variable-depth search to overcome local optima. ![Search on Bibsonomy](Pics/bibsonomy.png) |
GECCO ![In: Genetic and Evolutionary Computation Conference, GECCO 2008, Proceedings, Atlanta, GA, USA, July 12-16, 2008, pp. 787-794, 2008, ACM, 978-1-60558-130-9. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: STACS 2007, 24th Annual Symposium on Theoretical Aspects of Computer Science, Aachen, Germany, February 22-24, 2007, Proceedings, pp. 157-162, 2007, Springer, 978-3-540-70917-6. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
17 | Pushmeet Kohli, M. Pawan Kumar, Philip H. S. Torr |
P3 & Beyond: Solving Energies with Higher Order Cliques. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CVPR ![In: 2007 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR 2007), 18-23 June 2007, Minneapolis, Minnesota, USA, 2007, IEEE Computer Society, 1-4244-1179-3. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
17 | Julia Chuzhoy, Sanjeev Khanna |
Polynomial flow-cut gaps and hardness of directed cut problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 39th Annual ACM Symposium on Theory of Computing, San Diego, California, USA, June 11-13, 2007, pp. 179-188, 2007, ACM, 978-1-59593-631-8. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
EMMCVPR ![In: Energy Minimization Methods in Computer Vision and Pattern Recognition, 6th International Conference, EMMCVPR 2007, Ezhou, China, August 27-29, 2007, Proceedings, pp. 441-452, 2007, Springer, 978-3-540-74195-4. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
17 | Dmitrij Schlesinger |
Exact Solution of Permuted Submodular MinSum Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
EMMCVPR ![In: Energy Minimization Methods in Computer Vision and Pattern Recognition, 6th International Conference, EMMCVPR 2007, Ezhou, China, August 27-29, 2007, Proceedings, pp. 28-38, 2007, Springer, 978-3-540-74195-4. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
17 | Zhong-Zhen Wu, Shih-Chieh Chang |
Multiple wire reconnections based on implication flow graph. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Design Autom. Electr. Syst. ![In: ACM Trans. Design Autom. Electr. Syst. 11(4), pp. 939-952, 2006. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICCV ![In: 10th IEEE International Conference on Computer Vision (ICCV 2005), 17-20 October 2005, Beijing, China, pp. 349-356, 2005, IEEE Computer Society, 0-7695-2334-X. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
17 | Enrique Mérida Casermeiro, Domingo López-Rodríguez |
Graph Partitioning via Recurrent Multivalued Neural Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IWANN ![In: Computational Intelligence and Bioinspired Systems, 8th International Work-Conference on Artificial Neural Networks, IWANN 2005, Vilanova i la Geltrú, Barcelona, Spain, June 8-10, 2005, Proceedings, pp. 1149-1156, 2005, Springer, 3-540-26208-3. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
17 | Shlomo Moran, Satish Rao, Sagi Snir |
Using Semi-definite Programming to Enhance Supertree Resolvability. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WABI ![In: Algorithms in Bioinformatics, 5th International Workshop, WABI 2005, Mallorca, Spain, October 3-6, 2005, Proceedings, pp. 89-103, 2005, Springer, 3-540-29008-7. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
17 | Chandra Chekuri, Sanjeev Khanna, F. Bruce Shepherd |
Edge-Disjoint Paths in Planar Graphs. ![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. 71-80, 2004, IEEE Computer Society, 0-7695-2228-9. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
17 | Mongkol Ekpanyapong, Sung Kyu Lim |
Performance-driven global placement via adaptive network characterization. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ASP-DAC ![In: Proceedings of the 2004 Conference on Asia South Pacific Design Automation: Electronic Design and Solution Fair 2004, Yokohama, Japan, January 27-30, 2004, pp. 137-142, 2004, IEEE Computer Society, 0-7803-8175-0. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
17 | Yuri Rabinovich |
On average distortion of embedding metrics into the line and into L1. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 35th Annual ACM Symposium on Theory of Computing, June 9-11, 2003, San Diego, CA, USA, pp. 456-462, 2003, ACM, 1-58113-674-9. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
average metric distortion, planar metrics, finite metric spaces |
17 | Rajeev Murgai |
Efficient global fanout optimization algorithms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ASP-DAC ![In: Proceedings of ASP-DAC 2001, Asia and South Pacific Design Automation Conference 2001, January 30-February 2, 2001, Yokohama, Japan, pp. 571-576, 2001, ACM, 0-7803-6634-4. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
17 | Shantanu Dutt, Wenyong Deng |
Probability-based approaches to VLSI circuit partitioning. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. ![In: IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 19(5), pp. 534-549, 2000. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
17 | 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 |
|
17 | Stephen L. Hary, Füsun Özgüner |
Precedence-Constrained Task Allocation onto Point-to-Point Networks for Pipelined Execution. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Parallel Distributed Syst. ![In: IEEE Trans. Parallel Distributed Syst. 10(8), pp. 838-851, 1999. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. ![In: IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 17(8), pp. 655-667, 1998. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Euro-Par, Vol. II ![In: Euro-Par '96 Parallel Processing, Second International Euro-Par Conference, Lyon, France, August 26-29, 1996, Proceedings, Volume II, pp. 801-814, 1996, Springer, 3-540-61627-6. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS ![In: Mathematical Foundations of Computer Science 1990, MFCS'90, Banská Bystrica, Czechoslovakia, August 27-31, 1990, Proceedings, pp. 530-537, 1990, Springer, 3-540-52953-5. The full citation details ...](Pics/full.jpeg) |
1990 |
DBLP DOI BibTeX RDF |
|
17 | Victor Y. Pan, John H. Reif |
Extension of the Parallel Nested Dissection Algorithm to Path Algebra Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: Foundations of Software Technology and Theoretical Computer Science, Sixth Conference, New Delhi, India, December 18-20, 1986, Proceedings, pp. 470-487, 1986, Springer, 3-540-17179-7. The full citation details ...](Pics/full.jpeg) |
1986 |
DBLP DOI BibTeX RDF |
|