Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
53 | Guy Even, Joseph Naor, Satish Rao, Baruch Schieber |
Divide-and-conquer approximation algorithms via spreading metrics. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 47(4), pp. 585-616, 2000. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
feedback set, spreading metrics, approximation algorithms, divide and conquer, multicut, linear arrangement |
33 | Michael Malmros Sørensen |
b-Tree Facets for the Simple Graph Partitioning Polytope. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Optim. ![In: J. Comb. Optim. 8(2), pp. 151-170, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
clustering, graph partitioning, polyhedral combinatorics, multicuts |
33 | Guy Even, Joseph Naor, Satish Rao, Baruch Schieber |
Divide-and-Conquer Approximation Algorithms via Spreading Metrics (Extended Abstract). ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 36th Annual Symposium on Foundations of Computer Science, Milwaukee, Wisconsin, USA, 23-25 October 1995, pp. 62-71, 1995, IEEE Computer Society, 0-8186-7183-1. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
divide-and-conquer approximation algorithms, spreading metrics, NP-hard graph optimization problems, graph optimization problems, fractional spreading metric, fractional lengths, optimisation problem, spreading metric, interval graph completion, storage-time product, computational complexity, optimisation, directed graphs, directed graphs, polynomial time, vertices, divide and conquer methods, multicuts, polynomial time approximation algorithm |
26 | Ojas Parekh, Danny Segev |
Path Hitting in Acyclic Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 52(4), pp. 466-486, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Edge cover, Tree augmentation, Tree multicut, Approximation algorithms, Linear programming, Primal-dual, Edge dominating set |
26 | Yuval Rabani, Leonard J. Schulman, Chaitanya Swamy |
Approximation algorithms for labeling hierarchical taxonomies. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2008, San Francisco, California, USA, January 20-22, 2008, pp. 671-680, 2008, SIAM. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP BibTeX RDF |
|
26 | Mingyu Xiao 0001 |
Algorithms for Multiterminal Cuts. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CSR ![In: Computer Science - Theory and Applications, Third International Computer Science Symposium in Russia, CSR 2008, Moscow, Russia, June 7-12, 2008, Proceedings, pp. 314-325, 2008, Springer, 978-3-540-79708-1. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Multiterminal Cut, Graph Algorithm, Fixed Parameter Tractability, Multicut |
25 | Evgeny Levinkov, Amirhossein Kardoost, Bjoern Andres, Margret Keuper |
Higher-Order Multicuts for Geometric Model Fitting and Motion Segmentation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Pattern Anal. Mach. Intell. ![In: IEEE Trans. Pattern Anal. Mach. Intell. 45(1), pp. 608-622, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
25 | Bjoern Andres, Silvia Di Gregorio, Jannik Irmai, Jan-Hendrik Lange |
A polyhedral study of lifted multicuts. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Optim. ![In: Discret. Optim. 47, pp. 100757, February 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
25 | Amirhossein Kardoost |
Minimum cost multicuts for image and motion segmentation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
|
2023 |
RDF |
|
25 | Kazushi Aiba, Kanji Tanaka 0003, Ryogo Yamamoto |
Minimum Cost Multicuts for Incorrect Landmark Edge Detection in Pose-graph SLAM. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2203.02887, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
25 | Bjoern Andres, Silvia Di Gregorio, Jannik Irmai, Jan-Hendrik Lange |
A Polyhedral Study of Lifted Multicuts. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2202.08068, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP BibTeX RDF |
|
25 | Steffen Jung 0001, Margret Keuper |
Learning to solve Minimum Cost Multicuts efficiently using Edge-Weighted Graph Convolutional Neural Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2204.01366, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
25 | Steffen Jung 0001, Margret Keuper |
Learning to Solve Minimum Cost Multicuts Efficiently Using Edge-Weighted Graph Convolutional Neural Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ECML/PKDD (2) ![In: Machine Learning and Knowledge Discovery in Databases - European Conference, ECML PKDD 2022, Grenoble, France, September 19-23, 2022, Proceedings, Part II, pp. 485-501, 2022, Springer, 978-3-031-26389-7. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
25 | Kazushi Aiba, Kanji Tanaka 0003, Ryogo Yamamoto |
Detecting Landmark Misrecognition in Pose-Graph SLAM via Minimum Cost Multicuts. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CIVEMSA ![In: IEEE 9th International Conference on Computational Intelligence and Virtual Environments for Measurement Systems and Applications, CIVEMSA 2022, Chemnitz, Germany, June 15-17, 2022, pp. 1-5, 2022, IEEE, 978-1-6654-3445-4. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
25 | Tobias Friedrich 0001, Davis Issac, Nikhil Kumar 0001, Nadym Mallek, Ziena Zeif |
A Primal-Dual Algorithm for Multicommodity Flows and Multicuts in Treewidth-2 Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX/RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2022, September 19-21, 2022, University of Illinois, Urbana-Champaign, USA (Virtual Conference)., pp. 55:1-55:18, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-249-5. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
25 | Amirhossein Kardoost, Margret Keuper |
Uncertainty in Minimum Cost Multicuts for Image and Motion Segmentation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2105.07469, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP BibTeX RDF |
|
25 | Vincent Cohen-Addad, Éric Colin de Verdière, Arnaud de Mesmay |
A Near-Linear Approximation Scheme for Multicuts of Embedded Graphs With a Fixed Number of Terminals. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIAM J. Comput. ![In: SIAM J. Comput. 50(1), pp. 1-31, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
25 | Amirhossein Kardoost, Margret Keuper |
Uncertainty in minimum cost multicuts for image and motion segmentation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
UAI ![In: Proceedings of the Thirty-Seventh Conference on Uncertainty in Artificial Intelligence, UAI 2021, Virtual Event, 27-30 July 2021, pp. 2029-2038, 2021, AUAI Press. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP BibTeX RDF |
|
25 | Kalun Ho, Avraam Chatzimichailidis, Margret Keuper, Janis Keuper |
MSM: Multi-stage Multicuts for Scalable Image Clustering. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISC Workshops ![In: High Performance Computing - ISC High Performance Digital 2021 International Workshops, Frankfurt am Main, Germany, June 24 - July 2, 2021, Revised Selected Papers, pp. 267-284, 2021, Springer, 978-3-030-90538-5. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
25 | Kalun Ho, Janis Keuper, Margret Keuper |
Unsupervised Multiple Person Tracking using AutoEncoder-Based Lifted Multicuts. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2002.01192, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP BibTeX RDF |
|
25 | Kazuhiro Kurita, Yasuaki Kobayashi |
Efficient Enumerations for Minimal Multicuts and Multiway Cuts. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2006.16222, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP BibTeX RDF |
|
25 | Kazuhiro Kurita, Yasuaki Kobayashi |
Efficient Enumerations for Minimal Multicuts and Multiway Cuts. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS ![In: 45th International Symposium on Mathematical Foundations of Computer Science, MFCS 2020, August 24-28, 2020, Prague, Czech Republic., pp. 60:1-60:14, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-159-7. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
25 | Jan-Hendrik Lange |
Multicut optimization guarantees & geometry of lifted multicuts. ![Search on Bibsonomy](Pics/bibsonomy.png) |
|
2020 |
RDF |
|
25 | Cédric Bentz |
An FPT Algorithm for Planar Multicuts with Sources and Sinks on the Outer Face. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 81(1), pp. 224-237, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
25 | Constantin Pape, Alex Matskevych, Julian Hennies, Anna Kreshuk |
Leveraging Domain Knowledge to improve EM image segmentation with Lifted Multicuts. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1905.10535, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP BibTeX RDF |
|
25 | Constantin Pape, Alex Matskevych, Adrian Wolny, Julian Hennies, Giulia Mizzon, Marion Louveaux, Jacob Musser, Alexis Maizel, Detlev Arendt, Anna Kreshuk |
Leveraging Domain Knowledge to Improve Microscopy Image Segmentation With Lifted Multicuts. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Frontiers Comput. Sci. ![In: Frontiers Comput. Sci. 1, pp. 6, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
25 | Emiliano Lancini |
TDIness and Multicuts. (Total dual intégralité et multicoupes). ![Search on Bibsonomy](Pics/bibsonomy.png) |
|
2019 |
RDF |
|
25 | Pavel Dvorák, Dusan Knop |
Parameterized Complexity of Length-bounded Cuts and Multicuts. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 80(12), pp. 3597-3617, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
25 | Vincent Cohen-Addad, Éric Colin de Verdière, Arnaud de Mesmay |
A Near-Linear Approximation Scheme for Multicuts of Embedded Graphs with a Fixed Number of Terminals. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2018, New Orleans, LA, USA, January 7-10, 2018, pp. 1439-1458, 2018, SIAM, 978-1-61197-503-1. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
25 | M. S. Ramanujan 0001, Saket Saurabh 0001 |
Linear-Time Parameterized Algorithms via Skew-Symmetric Multicuts. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Algorithms ![In: ACM Trans. Algorithms 13(4), pp. 46:1-46:25, 2017. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
25 | Éric Colin de Verdière |
Multicuts in Planar and Bounded-Genus Graphs with Bounded Number of Terminals. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 78(4), pp. 1206-1224, 2017. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
25 | Cédric Bentz |
An FPT algorithm for planar multicuts with sources and sinks on the outer face. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1708.05903, 2017. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP BibTeX RDF |
|
25 | Margret Keuper |
Higher-Order Minimum Cost Lifted Multicuts for Motion Segmentation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1704.01811, 2017. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP BibTeX RDF |
|
25 | Margret Keuper |
Higher-Order Minimum Cost Lifted Multicuts for Motion Segmentation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICCV ![In: IEEE International Conference on Computer Vision, ICCV 2017, Venice, Italy, October 22-29, 2017, pp. 4252-4260, 2017, IEEE Computer Society, 978-1-5386-1032-9. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
25 | Andrea Hornáková, Jan-Hendrik Lange, Bjoern Andres |
Analysis and Optimization of Graph Decompositions by Lifted Multicuts. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICML ![In: Proceedings of the 34th International Conference on Machine Learning, ICML 2017, Sydney, NSW, Australia, 6-11 August 2017, pp. 1539-1548, 2017, PMLR. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP BibTeX RDF |
|
25 | Jörg Hendrik Kappes, Markus Speth, Gerhard Reinelt, Christoph Schnörr |
Higher-order segmentation via multicuts. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. Vis. Image Underst. ![In: Comput. Vis. Image Underst. 143, pp. 104-119, 2016. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
25 | Vincent Cohen-Addad, Éric Colin de Verdière, Arnaud de Mesmay |
A Near-Linear Approximation Scheme for Multicuts of Embedded Graphs with a Fixed Number of Terminals. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1611.02966, 2016. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP BibTeX RDF |
|
25 | Jörg Hendrik Kappes, Paul Swoboda, Bogdan Savchynskyy, Tamir Hazan, Christoph Schnörr |
Multicuts and Perturb & MAP for Probabilistic Graph Clustering. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1601.02088, 2016. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP BibTeX RDF |
|
25 | Jörg Hendrik Kappes, Paul Swoboda, Bogdan Savchynskyy, Tamir Hazan, Christoph Schnörr |
Multicuts and Perturb & MAP for Probabilistic Graph Clustering. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Math. Imaging Vis. ![In: J. Math. Imaging Vis. 56(2), pp. 221-237, 2016. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
25 | Julian Yarkony |
Next Generation Multicuts for Semi-Planar Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1511.01994, 2015. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP BibTeX RDF |
|
25 | Éric Colin de Verdière |
Multicuts in Planar and Bounded-Genus Graphs with Bounded Number of Terminals. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1502.00911, 2015. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP BibTeX RDF |
|
25 | Margret Keuper, Evgeny Levinkov, Nicolas Bonneel, Guillaume Lavoué, Thomas Brox, Bjoern Andres |
Efficient Decomposition of Image and Mesh Graphs by Lifted Multicuts. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1505.06973, 2015. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP BibTeX RDF |
|
25 | Bjoern Andres |
Lifting of Multicuts. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1503.03791, 2015. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP BibTeX RDF |
|
25 | Margret Keuper, Bjoern Andres, Thomas Brox |
Motion Trajectory Segmentation via Minimum Cost Multicuts. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICCV ![In: 2015 IEEE International Conference on Computer Vision, ICCV 2015, Santiago, Chile, December 7-13, 2015, pp. 3271-3279, 2015, IEEE Computer Society, 978-1-4673-8391-2. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
25 | Margret Keuper, Evgeny Levinkov, Nicolas Bonneel, Guillaume Lavoué, Thomas Brox, Bjoern Andres |
Efficient Decomposition of Image and Mesh Graphs by Lifted Multicuts. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICCV ![In: 2015 IEEE International Conference on Computer Vision, ICCV 2015, Santiago, Chile, December 7-13, 2015, pp. 1751-1759, 2015, IEEE Computer Society, 978-1-4673-8391-2. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
25 | Éric Colin de Verdière |
Multicuts in Planar and Bounded-Genus Graphs with Bounded Number of Terminals. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: Algorithms - ESA 2015 - 23rd Annual European Symposium, Patras, Greece, September 14-16, 2015, Proceedings, pp. 373-385, 2015, Springer, 978-3-662-48349-7. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
25 | Jörg Hendrik Kappes, Paul Swoboda, Bogdan Savchynskyy, Tamir Hazan, Christoph Schnörr |
Probabilistic Correlation Clustering and Image Partitioning Using Perturbed Multicuts. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SSVM ![In: Scale Space and Variational Methods in Computer Vision - 5th International Conference, SSVM 2015, Lège-Cap Ferret, France, May 31 - June 4, 2015, Proceedings, pp. 231-242, 2015, Springer, 978-3-319-18460-9. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
25 | M. S. Ramanujan 0001, Saket Saurabh 0001 |
Linear Time Parameterized Algorithms via Skew-Symmetric Multicuts. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2014, Portland, Oregon, USA, January 5-7, 2014, pp. 1739-1748, 2014, SIAM, 978-1-61197-338-9. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
25 | Markus Speth |
Exact solutions for discrete graphical models: multicuts and reduction techniques. ![Search on Bibsonomy](Pics/bibsonomy.png) |
|
2014 |
RDF |
|
25 | M. S. Ramanujan 0001, Saket Saurabh 0001 |
Linear Time Parameterized Algorithms via Skew-Symmetric Multicuts ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1304.7505, 2013. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP BibTeX RDF |
|
25 | Jörg Hendrik Kappes, Markus Speth, Gerhard Reinelt, Christoph Schnörr |
Higher-order Segmentation via Multicuts ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1305.6387, 2013. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP BibTeX RDF |
|
25 | Cédric Bentz |
A polynomial-time algorithm for planar multicuts with few source-sink pairs ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1206.3999, 2012. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP BibTeX RDF |
|
25 | Cédric Bentz |
A Polynomial-Time Algorithm for Planar Multicuts with Few Source-Sink Pairs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPEC ![In: Parameterized and Exact Computation - 7th International Symposium, IPEC 2012, Ljubljana, Slovenia, September 12-14, 2012. Proceedings, pp. 109-119, 2012, Springer, 978-3-642-33292-0. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
25 | Cédric Bentz |
On the hardness of finding near-optimal multicuts in directed acyclic graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theor. Comput. Sci. ![In: Theor. Comput. Sci. 412(39), pp. 5325-5332, 2011. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
25 | Arindam Pal 0001 |
Minimum multicuts and Steiner forests for Okamura-Seymour graphs ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1102.5478, 2011. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP BibTeX RDF |
|
25 | Jörg H. Kappes, Markus Speth, Björn Andres, Gerhard Reinelt, Christoph Schnörr |
Globally Optimal Image Partitioning by Multicuts. ![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. 31-44, 2011, Springer, 978-3-642-23093-6. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
25 | Cédric Bentz |
New results on planar and directed multicuts. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. Notes Discret. Math. ![In: Electron. Notes Discret. Math. 34, pp. 207-211, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
25 | Cédric Bentz, Marie-Christine Costa, Lucas Létocart, Frédéric Roupin |
Multicuts and integral multiflows in rings. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Eur. J. Oper. Res. ![In: Eur. J. Oper. Res. 196(3), pp. 1251-1254, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
25 | Cédric Bentz |
A simple algorithm for multicuts in planar graphs with outer terminals. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Appl. Math. ![In: Discret. Appl. Math. 157(8), pp. 1959-1964, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
25 | Cédric Bentz |
On Planar and Directed Multicuts with few Source-Sink Pairs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CTW ![In: Proceedings of the 8th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, CTW 2009, Paris, France, June 2-4 2009, pp. 313-316, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP BibTeX RDF |
|
25 | Frank Neumann 0001, Joachim Reichel |
Approximating Minimum Multicuts by Evolutionary Multi-objective Algorithms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PPSN ![In: Parallel Problem Solving from Nature - PPSN X, 10th International Conference Dortmund, Germany, September 13-17, 2008, Proceedings, pp. 72-81, 2008, Springer, 978-3-540-87699-1. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
25 | Asaf Levin, Danny Segev |
Partial multicuts in trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theor. Comput. Sci. ![In: Theor. Comput. Sci. 369(1-3), pp. 384-395, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
25 | Joseph Cheriyan, Howard J. Karloff, Yuval Rabani |
Approximating Directed Multicuts. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comb. ![In: Comb. 25(3), pp. 251-269, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classification (2000): 05C20, 90C27, 05C85, 68W25 |
25 | Yana Kortsarts, Guy Kortsarz, Zeev Nutov |
Greedy approximation algorithms for directed multicuts. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Networks ![In: Networks 45(4), pp. 214-217, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
25 | Asaf Levin, Danny Segev |
Partial Multicuts in Trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WAOA ![In: Approximation and Online Algorithms, Third International Workshop, WAOA 2005, Palma de Mallorca, Spain, October 6-7, 2005, Revised Papers, pp. 320-333, 2005, Springer, 3-540-32207-8. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
25 | Yana Kortsarts, Guy Kortsarz, Zeev Nutov |
Approximation Algorithm for Directed Multicuts. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WAOA ![In: Approximation and Online Algorithms, Second International Workshop, WAOA 2004, Bergen, Norway, September 14-16, 2004, Revised Selected Papers, pp. 61-67, 2004, Springer, 3-540-24574-X. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
25 | Gruia Calinescu, Cristina G. Fernandes, Bruce A. Reed |
Multicuts in unweighted graphs and digraphs with bounded degree and bounded tree-width. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Algorithms ![In: J. Algorithms 48(2), pp. 333-359, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
25 | Gruia Calinescu, Cristina G. Fernandes |
Multicuts in Unweighted Digraphs with Bounded Degree and Bounded Tree-Width. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. Notes Discret. Math. ![In: Electron. Notes Discret. Math. 7, pp. 194-197, 2001. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
25 | Joseph Cheriyan, Howard J. Karloff, Yuval Rabani |
Approximating Directed Multicuts. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 42nd Annual Symposium on Foundations of Computer Science, FOCS 2001, 14-17 October 2001, Las Vegas, Nevada, USA, pp. 320-328, 2001, IEEE Computer Society, 0-7695-1390-5. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
25 | Guy Even, Joseph Naor, Baruch Schieber, Madhu Sudan 0001 |
Approximating Minimum Feedback Sets and Multicuts in Directed Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 20(2), pp. 151-174, 1998. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
|
25 | Gruia Calinescu, Cristina G. Fernandes, Bruce A. Reed |
Multicuts in Unweighted Graphs with Bounded Degree and Bounded Tree-Width. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPCO ![In: Integer Programming and Combinatorial Optimization, 6th International IPCO Conference, Houston, Texas, USA, June 22-24, 1998, Proceedings, pp. 137-152, 1998, Springer, 3-540-64590-X. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
|
25 | Philip N. Klein, Serge A. Plotkin, Satish Rao, Éva Tardos |
Approximation Algorithms for Steiner and Directed Multicuts. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Algorithms ![In: J. Algorithms 22(2), pp. 241-269, 1997. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
|