Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
71 | Olgica Milenkovic, Navin Kashyap, David Leyba |
Shortened Array Codes of Large Girth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Inf. Theory ![In: IEEE Trans. Inf. Theory 52(8), pp. 3707-3722, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
71 | Thomas P. Hayes |
Randomly coloring graphs of girth at least five. ![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. 269-278, 2003, ACM, 1-58113-674-9. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
Glauber dynamics, concentration inequalities, posterior analysis, graph coloring, Markov chain Monte Carlo, Chernoff bounds |
69 | Jun Wu, Xiaolin Tian 0001 |
An Algorithm Based on Girth-location for MR Head Image Segmentation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
BMEI (2) ![In: Proceedings of the 2008 International Conference on BioMedical Engineering and Informatics, BMEI 2008, May 28-30, 2008, Sanya, Hainan, China - Volume 2, pp. 3-7, 2008, IEEE Computer Society. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Girth-Location, connective areas, MR Head Image, Image Segmentation |
57 | Mostafa Esmaeili, Mehdi Gholami |
Geometrically-structured maximum-girth LDPC block and convolutional codes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE J. Sel. Areas Commun. ![In: IEEE J. Sel. Areas Commun. 27(6), pp. 831-845, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
57 | Xiaofu Wu, Xiaohu You 0001, Chunming Zhao |
A necessary and sufficient condition for determining the girth of quasi-cyclic LDPC codes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Commun. ![In: IEEE Trans. Commun. 56(6), pp. 854-857, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
57 | Sunghwan Kim, Jong-Seon No, Habong Chung, Dong-Joon Shin |
Quasi-Cyclic Low-Density Parity-Check Codes With Girth Larger Than 12. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Inf. Theory ![In: IEEE Trans. Inf. Theory 53(8), pp. 2885-2891, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
57 | Mark E. O'Sullivan |
Algebraic construction of sparse matrices with large girth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Inf. Theory ![In: IEEE Trans. Inf. Theory 52(2), pp. 718-727, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
55 | Weiting Cao, Michael J. Pelsmajer |
The Toughness of a Toroidal Graph with Connectivity 3 and Girth 6 is Exactly 1. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Graphs Comb. ![In: Graphs Comb. 20(2), pp. 181-183, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
Toughness, Toroidal graph, Connectivity, Girth |
54 | Hossein Hajiabolhassan, Xuding Zhu |
Sparse H-Colourable Graphs of Bounded Maximum Degree. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Graphs Comb. ![In: Graphs Comb. 20(1), pp. 65-71, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
Uniquely H-colourable graphs, Bounded maximum degree, Girth |
54 | Noga Alon, Ayal Zaks |
Algorithmic Aspects of Acyclic Edge Colorings. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 32(4), pp. 611-614, 2002. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
Acyclic edge coloring, Girth |
51 | Angie Westover-Muñoz, David Landsbergen, Amanda M. Girth |
Citizen Engagement in Technically Dynamic Environments. ![Search on Bibsonomy](Pics/bibsonomy.png) |
EGOV-CeDEM-ePart-* ![In: Proceedings of Ongoing Research, Practitioners, Posters, Workshops, and Projects at EGOV-CeDEM-ePart 2020 co-located with the IFIP WG 8.5 International Conference EGOV-CeDEM-ePart 2020, Linköping University, Sweden (Online), 31 August-2 September 2020, pp. 79-88, 2020, CEUR-WS.org. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP BibTeX RDF |
|
43 | Jin Lu 0002, José M. F. Moura |
TS-LDPC Codes: Turbo-Structured Codes With Large Girth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Inf. Theory ![In: IEEE Trans. Inf. Theory 53(3), pp. 1080-1094, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
43 | Reinhard Diestel, Christof Rempel |
Dense Minors In Graphs Of Large Girth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comb. ![In: Comb. 25(1), pp. 111-116, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classification (2000): 05C35, 05C83 |
43 | Bane Vasic, Karunakar Pedagani, Milos Ivkovic |
High-rate girth-eight low-density parity-check codes on rectangular integer lattices. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Commun. ![In: IEEE Trans. Commun. 52(8), pp. 1248-1252, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
43 | William Klostermeyer, Cun-Quan Zhang |
n-Tuple Coloring of Planar Graphs with Large Odd Girth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Graphs Comb. ![In: Graphs Comb. 18(1), pp. 119-132, 2002. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
43 | Hristo N. Djidjev |
Computing the Girth of a Planar Graph. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 27th International Colloquium, ICALP 2000, Geneva, Switzerland, July 9-15, 2000, Proceedings, pp. 821-831, 2000, Springer, 3-540-67715-1. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
43 | L. Sunil Chandran |
A High Girth Graph Construction and a Lower Bound for Hitting Set Size for Combinatorial Rectangles. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: Foundations of Software Technology and Theoretical Computer Science, 19th Conference, Chennai, India, December 13-15, 1999, Proceedings, pp. 283-290, 1999, Springer, 3-540-66836-5. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
43 | Wolfgang Mader 0001 |
Topological Subgraphs in Graphs of Large Girth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comb. ![In: Comb. 18(3), pp. 405-412, 1998. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
AMS Subject Classification (1991) Classes: 05C35 |
42 | Spyros C. Kontogiannis, Paul G. Spirakis |
Well Supported Approximate Equilibria in Bimatrix Games: A Graph Theoretic Approach. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS ![In: Mathematical Foundations of Computer Science 2007, 32nd International Symposium, MFCS 2007, Ceský Krumlov, Czech Republic, August 26-31, 2007, Proceedings, pp. 596-608, 2007, Springer, 978-3-540-74455-9. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
42 | Jan Kratochvíl, Martin Pergel |
Geometric Intersection Graphs: Do Short Cycles Help? ![Search on Bibsonomy](Pics/bibsonomy.png) |
COCOON ![In: Computing and Combinatorics, 13th Annual International Conference, COCOON 2007, Banff, Canada, July 16-19, 2007, Proceedings, pp. 118-128, 2007, Springer, 978-3-540-73544-1. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
42 | Antar Bandyopadhyay, David Gamarnik |
Counting without sampling: new algorithms for enumeration problems using statistical physics. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2006, Miami, Florida, USA, January 22-26, 2006, pp. 890-899, 2006, ACM Press, 0-89871-605-5. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
42 | Giulio Colavolpe, Gianpietro Germi |
On the application of factor graphs and the sum-product algorithm to ISI channels. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Commun. ![In: IEEE Trans. Commun. 53(5), pp. 818-825, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
40 | Ravindra S. Goonetilleke, Channa P. Witana, Jianhui Zhao 0001, Shuping Xiong |
The Pluses and Minuses of Obtaining Measurements from Digital Scans. ![Search on Bibsonomy](Pics/bibsonomy.png) |
HCI (11) ![In: Digital Human Modeling, Second International Conference, ICDHM 2009, Held as Part of HCI International 2009, San Diego, CA, USA, July 19-24, 2009. Proceedings, pp. 681-690, 2009, Springer, 978-3-642-02808-3. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
foot, brannock, measurement, registration, alignment, Scanning, width, girth |
40 | Genjiu Xu, Xueliang Li 0001, Shenggui Zhang |
The Binding Number of a Digraph. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CJCDGCGT ![In: Discrete Geometry, Combinatorics and Graph Theory, 7th China-Japan Conference, CJCDGCGT 2005, Tianjin, China, November 18-20, 2005, Xi'an, China, November 22-24, 2005, Revised Selected Papers, pp. 221-227, 2005, Springer, 978-3-540-70665-6. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
Binding number, Caccetta-Häggkvist Conjecture, directed graph, girth |
30 | György Kiss, Stefko Miklavic, Tamás Szonyi |
A stability result for girth-regular graphs with even girth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Graph Theory ![In: J. Graph Theory 100(1), pp. 163-181, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
30 | Farzane Amirzade, Mohammad-Reza Sadeghi 0001 |
Analytical Lower Bounds on the Size of Elementary Trapping Sets of Variable-Regular LDPC Codes With Any Girth and Irregular Ones With Girth 8. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Commun. ![In: IEEE Trans. Commun. 66(6), pp. 2313-2321, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
30 | Farzane Amirzade, Mohammad-Reza Sadeghi 0001 |
Analytical lower bounds for the size of elementary trapping sets of variable-regular LDPC codes with any girth and irregular ones with girth 8. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1706.01703, 2017. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP BibTeX RDF |
|
30 | Camino Balbuena, Pedro García-Vázquez, Luis Pedro Montejano 0001, Julián Salas |
On the λ′-optimality in graphs with odd girth g and even girth h. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Appl. Math. Lett. ![In: Appl. Math. Lett. 24(7), pp. 1041-1045, 2011. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
30 | Camino Balbuena, Pedro García-Vázquez, Luis Pedro Montejano 0001 |
Superconnectivity of graphs with odd girth g and even girth h. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Appl. Math. ![In: Discret. Appl. Math. 159(2-3), pp. 91-99, 2011. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
30 | Judit Nagy-György |
Online coloring graphs with high girth and high odd girth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Oper. Res. Lett. ![In: Oper. Res. Lett. 38(3), pp. 185-187, 2010. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
30 | Luis Pedro Montejano 0001, Camino Balbuena, Pedro García-Vázquez |
On the Superconnectivity in graphs with odd girth g and even girth h. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. Notes Discret. Math. ![In: Electron. Notes Discret. Math. 34, pp. 537-541, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
30 | Hua Chen, Zhigang Cao |
A Measure of the Girth Histogram for Improved Girth-Conditioning Construction of LDPC Codes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Commun. Lett. ![In: IEEE Commun. Lett. 11(4), pp. 340-342, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
29 | Mohsen Bayati, Andrea Montanari, Amin Saberi |
Generating random graphs with large girth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2009, New York, NY, USA, January 4-6, 2009, pp. 566-575, 2009, SIAM, 978-0-89871-680-1. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
29 | Oren Weimann, Raphael Yuster |
Computing the Girth of a Planar Graph in O(n logn) Time. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP (1) ![In: Automata, Languages and Programming, 36th International Colloquium, ICALP 2009, Rhodes, Greece, July 5-12, 2009, Proceedings, Part I, pp. 764-773, 2009, Springer, 978-3-642-02926-4. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
29 | Flavio Chierichetti, Andrea Vattani |
The Local Nature of List Colorings for Graphs of High Girth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP (1) ![In: Automata, Languages and Programming, 35th International Colloquium, ICALP 2008, Reykjavik, Iceland, July 7-11, 2008, Proceedings, Part I: Tack A: Algorithms, Automata, Complexity, and Games, pp. 320-332, 2008, Springer, 978-3-540-70574-1. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
29 | Carlos Ansótegui, Ramón Béjar, Cèsar Fernández, Carles Mateu |
From High Girth Graphs to Hard Instances. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CP ![In: Principles and Practice of Constraint Programming, 14th International Conference, CP 2008, Sydney, Australia, September 14-18, 2008. Proceedings, pp. 298-312, 2008, Springer, 978-3-540-85957-4. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
29 | John Craddock, Mark F. Flanagan, Stephen James Redmond, Anthony D. Fagan |
Construction of Girth 8 LDPC Codes based on Multidimensional Finite Lattices. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISCC ![In: Proceedings of the 12th IEEE Symposium on Computers and Communications (ISCC 2007), July 1-4, Aveiro, Portugal, pp. 655-659, 2007, IEEE Computer Society, 978-1-4244-1520-5. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
29 | Sunghwan Kim, Jong-Seon No, Habong Chung, Dong-Joon Shin |
On the girth of tanner (3, 5) quasi-cyclic LDPC codes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Inf. Theory ![In: IEEE Trans. Inf. Theory 52(4), pp. 1739-1744, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
29 | Lap Chi Lau, Michael Molloy 0001 |
Randomly Colouring Graphs with Girth Five and Large Maximum Degree. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LATIN ![In: LATIN 2006: Theoretical Informatics, 7th Latin American Symposium, Valdivia, Chile, March 20-24, 2006, Proceedings, pp. 665-676, 2006, Springer, 3-540-32755-X. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
29 | Natalia Oksimets |
Euler Tours of Maximum Girth in K2n+1 and K2n, 2n. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Graphs Comb. ![In: Graphs Comb. 21(1), pp. 107-118, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
29 | Zhishi Pan, Xuding Zhu |
Graphs of Large Girth with Prescribed Partial Circular Colourings. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Graphs Comb. ![In: Graphs Comb. 21(1), pp. 119-129, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
Mathematical Subject Classification 05C15 |
29 | Martin Kochol |
Girth restrictions for the 5-flow conjecture. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2005, Vancouver, British Columbia, Canada, January 23-25, 2005, pp. 705-707, 2005, SIAM, 0-89871-585-7. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP BibTeX RDF |
|
29 | Yair Glasner |
Ramanujan Graphs with Small Girth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comb. ![In: Comb. 23(3), pp. 487-502, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
AMS Subject Classification (2000): 05Cxx, 05C25, 22E40 |
29 | Xuechao Li, Rong Luo |
Edge Coloring of Embedded Graphs with Large Girth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Graphs Comb. ![In: Graphs Comb. 19(3), pp. 393-401, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
Edge chromatic number, Euler contribution, Edge coloring |
29 | Michael Molloy 0001 |
The Glauber dynamics on colourings of a graph with high girth and maximum degree. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings on 34th Annual ACM Symposium on Theory of Computing, May 19-21, 2002, Montréal, Québec, Canada, pp. 91-98, 2002, ACM, 1-58113-495-9. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
rapidly mixing, Markov chain |
29 | Nathan Linial, Avner Magen, Assaf Naor |
Girth and euclidean distortion. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings on 34th Annual ACM Symposium on Theory of Computing, May 19-21, 2002, Montréal, Québec, Canada, pp. 705-711, 2002, ACM, 1-58113-495-9. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
EUCLID |
29 | Wolfgang Mader 0001 |
Subdivisions of a Graph of Maximal Degree n + 1 in Graphs of Average Degree n\epsilon and Large Girth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comb. ![In: Comb. 21(2), pp. 251-265, 2001. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
AMS Subject Classification (2000) Classes: 05C83, 05C35 |
29 | Yoshiharu Kohayakawa, Bernd Kreuter, Angelika Steger |
An Extremal Problem For Random Graphs And The Number Of Graphs With Large Even-Girth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comb. ![In: Comb. 18(1), pp. 101-120, 1998. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
AMS Subject Classification (1991) Classes: 05A16, 05C35, 05C38, 05C80 |
28 | Shu-Tao Xia, Fang-Wei Fu 0001 |
Minimum Pseudoweight and Minimum Pseudocodewords of LDPC Codes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Inf. Theory ![In: IEEE Trans. Inf. Theory 54(1), pp. 480-485, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
28 | Keke Liu, Zesong Fei, Jingming Kuang 0001 |
Three algebraic methods for constructing nonbinary LDPC codes based on finite fields. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PIMRC ![In: Proceedings of the IEEE 19th International Symposium on Personal, Indoor and Mobile Radio Communications, PIMRC 2008, 15-18 September 2008, Cannes, French Riviera, France, pp. 1-5, 2008, IEEE. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
28 | Sikyung Kim, Mohammad Mynuddin Gani Mazumder, Se Jin Park |
A Conformal Mapping Approach for Shoe Last Design. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FBIT ![In: Frontiers in the Convergence of Bioscience and Information Technologies 2007, FBIT 2007, Jeju Island, Korea, October 11-13, 2007, pp. 512-518, 2007, IEEE Computer Society, 978-0-7695-2999-8. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
28 | Alain Bretto, Luc Gillibert |
G-graphs for the cage problem: a new upper bound. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISSAC ![In: Symbolic and Algebraic Computation, International Symposium, ISSAC 2007, Waterloo, Ontario, Canada, July 28 - August 1, 2007, Proceedings, pp. 49-53, 2007, ACM, 978-1-59593-743-8. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
G-graphs, cage graphs, graphs from group |
28 | Veselin Jungic, Daniel Král, Riste Skrekovski |
Colorings Of Plane Graphs With No Rainbow Faces. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comb. ![In: Comb. 26(2), pp. 169-182, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classification (2000): 05C15 |
28 | Iannis Tourlakis |
New Lower Bounds for Vertex Cover in the Lovasz-Schrijver Hierarchy. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: 21st Annual IEEE Conference on Computational Complexity (CCC 2006), 16-20 July 2006, Prague, Czech Republic, pp. 170-182, 2006, IEEE Computer Society, 0-7695-2596-2. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
28 | Xiao-Yu Hu, Evangelos Eleftheriou, Dieter-Michael Arnold |
Regular and irregular progressive edge-growth tanner graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Inf. Theory ![In: IEEE Trans. Inf. Theory 51(1), pp. 386-398, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
28 | Joan Feigenbaum, Sampath Kannan, Andrew McGregor 0001, Siddharth Suri, Jian Zhang 0004 |
Graph distances in the streaming model: the value of space. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2005, Vancouver, British Columbia, Canada, January 23-25, 2005, pp. 745-754, 2005, SIAM, 0-89871-585-7. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP BibTeX RDF |
|
28 | Thomas P. Hayes, Eric Vigoda |
Coupling with the stationary distribution and improved sampling for colorings and independent sets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2005, Vancouver, British Columbia, Canada, January 23-25, 2005, pp. 971-979, 2005, SIAM, 0-89871-585-7. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP BibTeX RDF |
|
28 | Keith E. Mellinger |
LDPC Codes from Triangle-Free Line Sets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Des. Codes Cryptogr. ![In: Des. Codes Cryptogr. 32(1-3), pp. 341-350, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
polarity, LDPC codes, cap |
28 | Lei Wei 0003 |
Several properties of short LDPC codes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Commun. ![In: IEEE Trans. Commun. 52(5), pp. 721-727, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
28 | Martin E. Dyer, Alan M. Frieze, Thomas P. Hayes, Eric Vigoda |
Randomly Coloring Constant Degree 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. 582-589, 2004, IEEE Computer Society, 0-7695-2228-9. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
28 | Christopher Parker, Peter Rowley |
Subgroup-Chain Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Graphs Comb. ![In: Graphs Comb. 19(4), pp. 537-545, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
28 | Thomas P. Hayes, Eric Vigoda |
A Non-Markovian Coupling for Randomly Sampling Colorings. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 44th Symposium on Foundations of Computer Science (FOCS 2003), 11-14 October 2003, Cambridge, MA, USA, Proceedings, pp. 618-627, 2003, IEEE Computer Society, 0-7695-2040-5. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
28 | Paul S. Bonsma |
The Complexity of the Matching-Cut Problem for Planar Graphs and Other Graph Classes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science, 29th International Workshop, WG 2003, Elspeet, The Netherlands, June 19-21, 2003, Revised Papers, pp. 93-105, 2003, Springer, 3-540-20452-0. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
28 | Lukasz Kowalik, Maciej Kurowski |
Short path queries in planar graphs in constant time. ![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. 143-148, 2003, ACM, 1-58113-674-9. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
shortest path, queries, planar graph |
28 | Guy Kortsarz, Robert Krauthgamer |
On approximating the achromatic number. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, January 7-9, 2001, Washington, DC, USA., pp. 309-318, 2001, ACM/SIAM, 0-89871-490-7. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP BibTeX RDF |
|
28 | Andreas Brandstädt |
Short Disjoint Cycles in Cubic Bridgeless Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: 17th International Workshop, WG '91, Fischbachau, Germany, June 17-19, 1991, Proceedings, pp. 239-249, 1991, Springer, 3-540-55121-2. The full citation details ...](Pics/full.jpeg) |
1991 |
DBLP DOI BibTeX RDF |
|
26 | Venkatesh Raman 0001, Saket Saurabh 0001, C. R. Subramanian 0001 |
Faster fixed parameter tractable algorithms for finding feedback vertex sets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Algorithms ![In: ACM Trans. Algorithms 2(3), pp. 403-415, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
parameterized complexity, Feedback vertex set, girth |
26 | Gerard J. Chang, Chiuyuan Chen, Yaping Chen |
Vertex and Tree Arboricities of Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Optim. ![In: J. Comb. Optim. 8(3), pp. 295-306, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
arboricity, block-cactus graph, tree, planar graph, hamiltonian cycle, cograph, acyclic, series-parallel graph, girth |
15 | Zhenzhen Lou, Lu Lu 0012, Xueyi Huang |
Spectral Radius of Graphs with Given Size and Odd Girth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. J. Comb. ![In: Electron. J. Comb. 31(1), 2024. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
15 | Rong Chen, Yidong Zhou |
Graphs with Girth $2\ell+1$ and Without Longer Odd Holes that Contain an Odd $K_4$-Subdivision. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. J. Comb. ![In: Electron. J. Comb. 31(1), 2024. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
15 | Wei Ren, Jian Shuai, Yuan Mei |
Experiment-Based Reliability Analysis of Girth Welds on Different Grade Steel Pipelines. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Reliab. ![In: IEEE Trans. Reliab. 73(1), pp. 492-505, March 2024. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
15 | Qi Wang, Jingping Che, Huaan Li, Zhen Luo, Bo Zhang, Hui Liu |
Tanner (3, 23)-Regular QC-LDPC Codes: Cycle Structure and Girth Distribution. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Access ![In: IEEE Access 12, pp. 26591-26609, 2024. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
15 | Danjun Huang, Xianxi Wu |
Equitable Coloring of IC-Planar Graphs with Girth g ≥ 7. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Axioms ![In: Axioms 12(9), pp. 822, September 2024. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
15 | Valentin Bartier, Nicolas Bousquet, Jihad Hanna, Amer E. Mouawad, Sebastian Siebertz |
Token Sliding on Graphs of Girth Five. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 86(2), pp. 638-655, February 2024. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
15 | Gang Zhang, Baoyindureng Wu |
Cycle Isolation of Graphs with Small Girth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Graphs Comb. ![In: Graphs Comb. 40(2), pp. 38, April 2024. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
15 | Hongyang Wang |
On the chromatic number of graphs of odd girth without longer odd holes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Appl. Math. ![In: Discret. Appl. Math. 342, pp. 227-230, January 2024. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
15 | Lushuai Xu, Shaohua Dong, Haotian Wei, Donghua Peng, Weichao Qian, Qingying Ren, Luming Wang, Yundong Ma |
Intelligent identification of girth welds defects in pipelines using neural networks with attention modules. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Eng. Appl. Artif. Intell. ![In: Eng. Appl. Artif. Intell. 127(Part B), pp. 107295, January 2024. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
15 | Vladislav Taranchuk |
A simple proof for the lower bound of the girth of graphs D(n,q). ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Math. ![In: Discret. Math. 347(1), pp. 113705, January 2024. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
15 | Garner Cochran |
Large girth and small oriented diameter graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Math. ![In: Discret. Math. 347(4), pp. 113846, April 2024. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
15 | David K. Garnick |
Radius $r$ extremal graphs of girth 5. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Australas. J Comb. ![In: Australas. J Comb. 89, pp. 1-23, June 2024. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP BibTeX RDF |
|
15 | Reza Naserasr, Weiqiang Yu |
On the packing number of antibalanced signed simple planar graphs of negative girth at least 5. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Optim. ![In: J. Comb. Optim. 47(2), pp. 9, March 2024. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
15 | Alina Harbuzova, Ce Jin 0001, Virginia Vassilevska Williams, Zixuan Xu |
Improved Roundtrip Spanners, Emulators, and Directed Girth Approximation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, SODA 2024, Alexandria, VA, USA, January 7-10, 2024, pp. 4641-4669, 2024, SIAM, 978-1-61197-791-2. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
15 | Grahame Erskine, James Tuite |
Small Graphs and Hypergraphs of Given Degree and Girth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. J. Comb. ![In: Electron. J. Comb. 30(1), 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
15 | Ming Xu, Xiaoyan Cheng, Yuansheng Tang |
Girth of the algebraic bipartite graph D(k,q). ![Search on Bibsonomy](Pics/bibsonomy.png) |
Finite Fields Their Appl. ![In: Finite Fields Their Appl. 92, pp. 102296, December 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
15 | Ilya D. Shkredov |
On a girth-free variant of the Bourgain-Gamburd machine. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Finite Fields Their Appl. ![In: Finite Fields Their Appl. 90, pp. 102225, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
15 | Palaniyappan Nithya, Suresh Elumalai, Selvaraj Balachandran, Sourav Mondal |
Smallest ABS index of unicyclic graphs with given girth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Appl. Math. Comput. ![In: J. Appl. Math. Comput. 69(5), pp. 3675-3692, October 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
15 | Juhua Wang, Jianhua Zhang, Quan Zhou, Lintao Zhang |
Full-Length Row-Multiplier QC-LDPC Codes With Girth Eight and Short Circulant Sizes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Access ![In: IEEE Access 11, pp. 22250-22265, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
15 | Wang Hui, Adnan Aslam, Salma Kanwal, Mahnoor Akram, Tahira Sumbal Shaikh, Xuewu Zuo |
Ordering Unicyclic Connected Graphs with Girth g ≥ 3 Having Greatest SK Indices. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Symmetry ![In: Symmetry 15(4), pp. 871, March 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
15 | Valentin Bartier, Nicolas Bousquet, Carl Feghali, Marc Heinrich, Benjamin Moore, Théo Pierron |
Recoloring Planar Graphs of Girth at Least Five. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIAM J. Discret. Math. ![In: SIAM J. Discret. Math. 37(1), pp. 332-350, March 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
15 | Kaiyang Lan, Feng Liu |
The Chromatic Number of a Graph with Two Odd Holes and an Odd Girth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Graphs Comb. ![In: Graphs Comb. 39(6), pp. 125, December 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
15 | Benjamin Friedman, Sean McGuinness |
Girth Conditions and Rota's Basis Conjecture. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Graphs Comb. ![In: Graphs Comb. 39(3), pp. 51, June 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
15 | Ashwin Jacob, Michal Wlodarczyk 0001, Meirav Zehavi |
Finding Long Directed Cycles Is Hard Even When DFVS Is Small Or Girth Is Large. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2308.06145, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
15 | Alina Harbuzova, Ce Jin 0001, Virginia Vassilevska Williams, Zixuan Xu |
Improved Roundtrip Spanners, Emulators, and Directed Girth Approximation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2310.20473, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
15 | Jialu Zhu, Xuding Zhu |
The circular chromatic number of signed series-parallel graphs of given girth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Appl. Math. ![In: Discret. Appl. Math. 341, pp. 82-92, December 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
15 | Alex Alochukwu, Peter Dankelmann |
On Wiener index and average eccentricity of graphs of girth at least 6 and (C4,C5)-free graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Appl. Math. ![In: Discret. Appl. Math. 330, pp. 98-111, May 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
15 | Xiaoling Liu, Lei Sun, Wei Zheng |
Path partition of planar graphs with girth at least six. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Math. Algorithms Appl. ![In: Discret. Math. Algorithms Appl. 15(7), pp. 2250158:1-2250158:7, October 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
15 | Dharmeshkumar Patel, Ninad Bhatt |
Performance Evaluation of Conventional and Neural Network-Based Decoder for an Audio of Low-Girth LDPC Code. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Electr. Comput. Eng. ![In: J. Electr. Comput. Eng. 2023, pp. 1071142:1-1071142:17, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
15 | Iva Antoncic, Primoz Sparl |
On tetravalent half-arc-transitive graphs of girth 5. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Math. ![In: Discret. Math. 346(10), pp. 113577, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
15 | Ming Xu, Xiaoyan Cheng, Yuansheng Tang |
On the girth cycles of the bipartite graph D(k,q). ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Math. ![In: Discret. Math. 346(9), pp. 113500, September 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
15 | Min Chen 0012, André Raspaud, Weifan Wang 0001, Weiqiang Yu |
An (F3, F5)-partition of planar graphs with girth at least 5. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Math. ![In: Discret. Math. 346(2), pp. 113216, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|