|
|
Venues (Conferences, Journals, ...)
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 19 occurrences of 14 keywords
|
|
|
Results
Found 33 publication records. Showing 33 according to the selection in the facets
Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
161 | Andrew B. Kahng, Shailesh Vaya, Alexander Zelikovsky |
New graph bipartizations for double-exposure, bright field alternating phase-shift mask layout. ![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. 133-138, 2001, ACM, 0-7803-6634-4. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
76 | Venkatesh Raman 0001, Saket Saurabh 0001, Somnath Sikdar |
Improved Exact Exponential Algorithms for Vertex Bipartization and Other Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICTCS ![In: Theoretical Computer Science, 9th Italian Conference, ICTCS 2005, Siena, Italy, October 12-14, 2005, Proceedings, pp. 375-389, 2005, Springer, 3-540-29106-7. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
53 | Falk Hüffner |
Algorithm Engineering for Optimal Graph Bipartization. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WEA ![In: Experimental and Efficient Algorithms, 4th InternationalWorkshop, WEA 2005, Santorini Island, Greece, May 10-13, 2005, Proceedings, pp. 240-252, 2005, Springer, 3-540-25920-1. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
52 | Hatem Tahri, Mourad Elloumi |
A New Approximation Algorithm for the Minimum Fragment Removal Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
BIRD ![In: Bioinformatics Research and Development, Second International Conference, BIRD 2008, Vienna, Austria, July 7-9, 2008, Proceedings, pp. 427-435, 2008, Springer, 978-3-540-70598-7. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
haplotype assembly, minimum fragment removal, vertex bipartization, algorithms, complexities, Graphs |
46 | Michel X. Goemans, David P. Williamson |
Primal-Dual Approximation Algorithms for Feedback Problems in Planar Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comb. ![In: Comb. 18(1), pp. 37-59, 1998. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
AMS Subject Classification (1991) Classes: 90C27, 68Q25, 05C85 |
46 | Michel X. Goemans, David P. Williamson |
Primal-Dual Approximation Algorithms for Feedback Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPCO ![In: Integer Programming and Combinatorial Optimization, 5th International IPCO Conference, Vancouver, British Columbia, Canada, June 3-5, 1996, Proceedings, pp. 147-161, 1996, Springer, 3-540-61310-2. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
|
30 | Lan Lin, Yixun Lin |
Graph Bipartization Problem with Applications to Via Minimization in VLSI Design. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Int. J. Found. Comput. Sci. ![In: Int. J. Found. Comput. Sci. 34(4), pp. 347-361, June 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
30 | Sayan Bandyapadhyay, William Lochet, Daniel Lokshtanov, Saket Saurabh 0001, Jie Xue 0003 |
True Contraction Decomposition and Almost ETH-Tight Bipartization for Unit-Disk Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SoCG ![In: 38th International Symposium on Computational Geometry, SoCG 2022, June 7-10, 2022, Berlin, Germany., pp. 11:1-11:16, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-227-3. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
30 | Timothy D. Goodrich, Eric Horton, Blair D. Sullivan |
An Updated Experimental Evaluation of Graph Bipartization Methods. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM J. Exp. Algorithmics ![In: ACM J. Exp. Algorithmics 26, pp. 12:1-12:24, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
30 | Sudeshna Kolay, Pranabendu Misra, M. S. Ramanujan 0001, Saket Saurabh 0001 |
Faster Graph bipartization. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comput. Syst. Sci. ![In: J. Comput. Syst. Sci. 109, pp. 45-55, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
30 | Marcin Pilipczuk, Michal Pilipczuk, Marcin Wrochna |
Edge Bipartization Faster than $$2^k$$ 2 k. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 81(3), pp. 917-966, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
30 | Mateusz Miotk, Jerzy Topp, Pawel Zylinski |
Bipartization of Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Graphs Comb. ![In: Graphs Comb. 35(5), pp. 1169-1177, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
30 | Timothy D. Goodrich, Eric Horton, Blair D. Sullivan |
Practical Graph Bipartization with Applications in Near-Term Quantum Computing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1805.01041, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP BibTeX RDF |
|
30 | Hanna Furmanczyk, Marek Kubale, Stanislaw P. Radziszowski |
On bipartization of cubic graphs by removal of an independent set. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Appl. Math. ![In: Discret. Appl. Math. 209, pp. 115-121, 2016. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
30 | Marcin Pilipczuk, Michal Pilipczuk, Marcin Wrochna |
Edge Bipartization Faster Than 2^k. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPEC ![In: 11th International Symposium on Parameterized and Exact Computation, IPEC 2016, August 24-26, 2016, Aarhus, Denmark, pp. 26:1-26:13, 2016, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-023-1. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
30 | Marcin Pilipczuk, Michal Pilipczuk, Marcin Wrochna |
Edge Bipartization faster than 2k. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1507.02168, 2015. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP BibTeX RDF |
|
30 | Hanna Furmanczyk, Marek Kubale, Stanislaw P. Radziszowski |
On bipartization of cubic graphs by removal of an independent set. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1406.2728, 2014. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP BibTeX RDF |
|
30 | Pierre Fouilhoux, Ali Ridha Mahjoub |
Solving VLSI design and DNA sequencing problems using bipartization of graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. Optim. Appl. ![In: Comput. Optim. Appl. 51(2), pp. 749-781, 2012. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
30 | |
On Approximating Graph Bipartization via Node Deletion ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1211.6724, 2012. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP BibTeX RDF |
|
30 | Dániel Marx, Barry O'Sullivan, Igor Razgon |
Treewidth Reduction for Constrained Separation and Bipartization Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 27th International Symposium on Theoretical Aspects of Computer Science, STACS 2010, March 4-6, 2010, Nancy, France, pp. 561-572, 2010, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-939897-16-3. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
30 | Falk Hüffner |
Algorithm Engineering for Optimal Graph Bipartization. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Graph Algorithms Appl. ![In: J. Graph Algorithms Appl. 13(2), pp. 77-98, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
30 | Dániel Marx, Barry O'Sullivan, Igor Razgon |
Treewidth reduction for constrained separation and bipartization problems ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/0902.3780, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP BibTeX RDF |
|
30 | Samuel Fiorini, Nadia Hardy, Bruce A. Reed, Adrian Vetta |
Planar graph bipartization in linear time. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Appl. Math. ![In: Discret. Appl. Math. 156(7), pp. 1175-1180, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
30 | Jiong Guo, Jens Gramm, Falk Hüffner, Rolf Niedermeier, Sebastian Wernicke 0001 |
Compression-based fixed-parameter algorithms for feedback vertex set and edge bipartization. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comput. Syst. Sci. ![In: J. Comput. Syst. Sci. 72(8), pp. 1386-1396, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
30 | Samuel Fiorini, Nadia Hardy, Bruce A. Reed, Adrian Vetta |
Planar graph bipartization in linear time. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. Notes Discret. Math. ![In: Electron. Notes Discret. Math. 19, pp. 265-271, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
30 | Heiko Schröder 0001, A. E. May, Imrich Vrto, Ondrej Sýkora |
Approximation Algorithms for the Vertex Bipartization Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SOFSEM ![In: SOFSEM '97: Theory and Practice of Informatics, 24th Seminar on Current Trends in Theory and Practice of Informatics, Milovy, Czech Republic, November 22-29, 1997, Proceedings, pp. 547-554, 1997, Springer, 3-540-63774-5. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
|
30 | Hyeong-Ah Choi, Kazuo Nakajima, Chong S. Rim |
Graph Bipartization and via Minimization. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIAM J. Discret. Math. ![In: SIAM J. Discret. Math. 2(1), pp. 38-47, 1989. The full citation details ...](Pics/full.jpeg) |
1989 |
DBLP DOI BibTeX RDF |
|
29 | Paola Festa, Panos M. Pardalos, Mauricio G. C. Resende |
Feedback Set Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Encyclopedia of Optimization ![In: Encyclopedia of Optimization, Second Edition, pp. 1005-1016, 2009, Springer, 978-0-387-74758-3. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Feedback set problem, Graph bipartization, Combinatorial optimization, Local search, GRASP, FORTRAN subroutines |
29 | Thomas Erlebach, Stamatis Stefanakos |
Wavelength Conversion in All-Optical Networks with Shortest-Path Routing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 43(1-2), pp. 43-61, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
Wavelength converter placement, Bipartization, Sufficient set, L-reduction, Graph algorithm, Wavelength assignment, Edge coloring |
29 | Paola Festa, Panos M. Pardalos, Mauricio G. C. Resende |
Algorithm 815: FORTRAN subroutines for computing approximate solutions of feedback set problems using GRASP. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Math. Softw. ![In: ACM Trans. Math. Softw. 27(4), pp. 456-464, 2001. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
feedback set problems, graph bipartization, Combinatorial optimization, local search, GRASP, FORTRAN subroutines |
23 | Charles C. Chiang, Andrew B. Kahng, Subarna Sinha, Xu Xu 0001, Alexander Zelikovsky |
Fast and Efficient Bright-Field AAPSM Conflict Detection and Correction. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. ![In: IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 26(1), pp. 115-126, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
23 | Jiong Guo, Jens Gramm, Falk Hüffner, Rolf Niedermeier, Sebastian Wernicke 0001 |
Improved Fixed-Parameter Algorithms for Two Feedback Set Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WADS ![In: Algorithms and Data Structures, 9th International Workshop, WADS 2005, Waterloo, Canada, August 15-17, 2005, Proceedings, pp. 158-168, 2005, Springer, 3-540-28101-0. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
23 | Sanjeev Khanna, Madhu Sudan 0001, Luca Trevisan |
Constraint Satisfaction: The Approximability of Minimization Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: Proceedings of the Twelfth Annual IEEE Conference on Computational Complexity, Ulm, Germany, June 24-27, 1997, pp. 282-296, 1997, IEEE Computer Society, 0-8186-7907-7. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
complete problems, computational classes, computational complexity, Approximation algorithms, combinatorial optimization |
Displaying result #1 - #33 of 33 (100 per page; Change: )
|
|