Register | Log in | FAQ      [?] 
Recent | Unread | Search | Authors | Tags | Export

AbnerCYH's combinatorics [128 articles]

Recent papers added to AbnerCYH's library classified by the tag combinatorics. You can also see everyone's combinatorics.
  • An algorithmic version of the blow-up lemma
    Random Struct. Algorithms, Vol. 12, No. 3. (1998), pp. 297-310.
    by János Komlós, Gabor N Sarkozy, Endre Szemerédi
    posted to graph combinatorics algorithms by AbnerCYH on 2008-10-11 20:32:35 as **
  • Blow-up Lemma
    Combinatorica, Vol. 17, No. 1. (1 March 1997), pp. 109-123.
    by János Komlós, Gábor N Sárközy, Endre Szemerédi
    posted to graph combinatorics by AbnerCYH on 2008-10-11 20:30:44 as **
  • 102 combinatorial problems: From the training of the USA IMO team
    by Titu Andreescu
    posted to combinatorics algorithms by AbnerCYH on 2008-09-20 06:47:01 as **
  • A realization algorithm for double domination in graphs
    UTILITAS MATHEMATICA, Vol. 76 (July 2008), pp. 11-24.
    by J Harant, MA Henning
    posted to graph combinatorics algorithms by AbnerCYH on 2008-09-18 22:54:41 as **
  • The upper bound on k-tuple domination numbers of graphs
    European Journal of Combinatorics, Vol. 29, No. 5. (July 2008), pp. 1333-1336.
    by Gerard J Chang
    posted to graph combinatorics by AbnerCYH on 2008-09-18 22:26:20 as **
  • Cutting planes in integer and mixed integer programming
    Discrete Applied Mathematics, Vol. 123, No. 1-3. (15 November 2002), pp. 397-446.
    by Hugues Marchand, Alexander Martin, Robert Weismantel, Laurence Wolsey
    posted to optimization math combinatorics algorithms by AbnerCYH on 2008-09-15 22:55:05 as **
  • Discrete Mathematics With Algorithms
    (22 July 1988)
    by Michael O Albertson, Joan P Hutchinson
    posted to data_structure combinatorics algorithms by AbnerCYH on 2008-09-10 17:23:52 as **
  • An optimal algorithm for checking regularity: (extended abstract)
    (2002), pp. 277-286.
    by Y Kohayakawa, V Rödl, L Thoma
    posted to algorithms combinatorics stochastic testing by AbnerCYH on 2008-07-10 17:00:34 as **
  • The algorithmic aspects of the regularity lemma
    Foundations of Computer Science, 1992. Proceedings., 33rd Annual Symposium on (1992), pp. 473-481.
    by N Alon
    posted to algorithms combinatorics graph by AbnerCYH on 2008-07-08 12:35:49 as **
  • Small subsets inherit sparse $ε$-regularity
    J. Comb. Theory Ser. B, Vol. 97, No. 1. (January 2007), pp. 34-56.
    by Stefanie Gerke, Yoshiharu Kohayakawa, Vojtech Rödl, Angelika Steger
    posted to combinatorics stochastic by AbnerCYH on 2008-07-06 19:26:38 as **
  • The Turán Theorem for Random Graphs
    Comb. Probab. Comput., Vol. 13, No. 1. (January 2004), pp. 61-91.
    by Yoshiharu Kohayakawa, Vojtech Rödl, Mathias Schacht
    posted to combinatorics graph stochastic by AbnerCYH on 2008-07-06 19:26:23 as **
  • Regular pairs in sparse random graphs I
    Random Struct. Algorithms, Vol. 22, No. 4. (July 2003), pp. 359-434.
    by Y Kohayakawa, V Rödl
    posted to combinatorics graph stochastic by AbnerCYH on 2008-07-06 19:26:15 as **
  • The Blow-up Lemma
    Comb. Probab. Comput., Vol. 8, No. 1-2. (1999), pp. 161-176.
    by János Komlós
    posted to combinatorics stochastic by AbnerCYH on 2008-07-06 19:24:47 as **
  • Hypergraphs, quasi-randomness, and conditions for regularity
    J. Comb. Theory Ser. A, Vol. 97, No. 2. (February 2002), pp. 307-352.
    by Yoshiharu Kohayakawa, Vojtech Rödl, Jozef Skokan
    posted to combinatorics graph stochastic by AbnerCYH on 2008-07-06 19:24:37 as **
  • Approximability of dense and sparse instances of minimum 2-connectivity, TSP and path problems
    (2002), pp. 74-83.
    by Béla Csaba, Marek Karpinski, Piotr Krysta
    posted to algorithms combinatorics complexity graph testing by AbnerCYH on 2008-07-06 19:24:02 as **
  • Property testing in hypergraphs and the removal lemma
    (2007), pp. 488-495.
    by V Rödl, M Schacht
    posted to algorithms combinatorics graph testing by AbnerCYH on 2008-07-06 19:23:40 as **
  • Testing versus estimation of graph properties
    (2005), pp. 138-146.
    by Eldar Fischer, Ilan Newman
    posted to algorithms combinatorics graph testing by AbnerCYH on 2008-07-06 19:22:35 as **
  • The algorithmic aspects of the regularity lemma
    J. Algorithms, Vol. 16, No. 1. (January 1994), pp. 80-109.
    by N Alon, RA Duke, H Lefmann, V R&\#246;dl, R Yuster
    posted to algorithms combinatorics graph stochastic testing by AbnerCYH on 2008-07-05 14:09:51 as ***** along with 1 person bfraser
  • The regularity lemma and approximation schemes for dense problems
    (1996)
    by A Frieze
    posted to algorithms combinatorics graph stochastic testing by AbnerCYH on 2008-07-05 14:09:49 as **
  • Property testing and its connection to learning and approximation
    J. ACM, Vol. 45, No. 4. (July 1998), pp. 653-750.
    by Oded Goldreich, Shari Goldwasser, Dana Ron
    posted to algorithms combinatorics graph stochastic testing by AbnerCYH on 2008-07-05 14:09:45 as **
  • On characterizing hypergraph regularity
    Random Struct. Algorithms, Vol. 21, No. 3-4. (2002), pp. 293-335.
    by Y Dementieva, PE Haxell, B Nagle, V Rödl
    posted to algorithms combinatorics graph stochastic testing by AbnerCYH on 2008-07-05 14:09:28 as **
  • An optimal algorithm for checking regularity: (extended abstract)
    (2002), pp. 277-286.
    by Y Kohayakawa, V Rödl, L Thoma
    posted to algorithms combinatorics graph stochastic testing by AbnerCYH on 2008-07-05 14:08:58 as **
  • Hardness of fully dense problems
    Inf. Comput., Vol. 205, No. 8. (August 2007), pp. 1117-1129.
    by Nir Ailon, Noga Alon
    posted to algorithms combinatorics graph stochastic testing by AbnerCYH on 2008-07-05 14:08:27 as **
  • The Regularity Lemma and Its Applications in Graph Theory
    Theoretical Aspects of Computer Science (2002), pp. 149-152.
    by János Komlós, Ali Shokoufandeh, Miklós Simonovits, Endre Szemerédi
    posted to algorithms combinatorics graph stochastic testing by AbnerCYH on 2008-07-03 14:26:39 as **
  • Davenport-Schinzel Sequences and their Geometric Applications
    (1998)
    by Micha Sharir, Pankaj K Agarwal
    posted to combinatorics geometries by AbnerCYH on 2008-07-02 15:09:20 as **
  • Approximation schemes for a class of subset selection problems
    Theoretical Computer Science, Vol. 382, No. 2. (31 August 2007), pp. 151-156.
    by Kirk Pruhs, Gerhard J Woeginger
    posted to algorithms combinatorics optimization by AbnerCYH on 2008-07-01 19:38:55 as **
  • Shellable Nonpure Complexes and Posets. II
    Vol. 349, No. 10. (October 1997), pp. 3945-3975.
    by Anders Bjorner, Michelle L Wachs
    posted to algebra combinatorics order topology by AbnerCYH on 2008-05-27 09:00:39 as **
  • Shellable Nonpure Complexes and Posets. I
    Transactions of the American Mathematical Society, Vol. 348, No. 4. (April 1996), pp. 1299-1367.
    by Anders Bjorner, Michelle L Wachs
    posted to algebra combinatorics order topology by AbnerCYH on 2008-05-27 08:58:33 as **
  • Splay trees, Davenport-Schinzel sequences, and the deque conjecture
    (2008), pp. 1115-1124.
    by Seth Pettie
    posted to combinatorics data_structure by AbnerCYH on 2008-05-24 06:01:42 as **
  • Generalized Davenport-Schinzel sequences
    Combinatorica, Vol. 14, No. 4. (1 December 1994), pp. 463-476.
    by Martin Klazar, Pavel Valtr
    posted to combinatorics by AbnerCYH on 2008-05-24 06:01:35 as **
  • Combinatorics and Partially Ordered Sets: Dimension Theory (Johns Hopkins Studies in the Mathematical Sciences)
    (01 May 1992)
    by William T Trotter
    posted to combinatorics order by AbnerCYH on 2008-05-18 17:34:20 as **
  • The Many Faces Of Modern Combinatorics
    by Cristian L Combinatorics
    posted to combinatorics by AbnerCYH on 2008-05-18 16:05:07 as ** along with 1 person Scis0000002
  • Separators for sphere-packings and nearest neighbor graphs
    J. ACM, Vol. 44, No. 1. (January 1997), pp. 1-29.
    by Gary L Miller, Shang-Hua Teng, William Thurston, Stephen A Vavasis
    posted to algorithms combinatorics geometries graph by AbnerCYH on 2008-05-08 19:24:16 as **
  • The combinatorial encoding of disjoint convex sets in the plane
    Combinatorica, Vol. 28, No. 1. (30 January 2008), pp. 69-81.
    by Jacob Goodman, Richard Pollack
    posted to combinatorics geometries by AbnerCYH on 2008-05-06 10:20:39 as **
  • Properties of intersecting families of ordered sets
    Combinatorica, Vol. 28, No. 1. (30 January 2008), pp. 37-44.
    by Ori Einstein
    posted to combinatorics order by AbnerCYH on 2008-05-06 10:20:13 as **
  • Sorting Jordan sequences in linear time
    (1985), pp. 196-203.
    by Kurt Hoffmann, Kurt Mehlhorn, Pierre Rosenstiehl, Robert E Tarjan
    posted to algorithms combinatorics data_structure geometries by AbnerCYH on 2008-04-28 17:27:15 as **
  • Sorting Jordan sequences in linear time using level-linked search trees
    Inf. Control, Vol. 68, No. 1-3. (1986), pp. 170-184.
    by Kurt Hoffmann, Kurt Mehlhorn, Pierre Rosenstiehl, Robert E Tarjan
    posted to algorithms combinatorics data_structure by AbnerCYH on 2008-04-28 17:23:00 as **
  • Topological Methods in Combinatorics and Geometry
    by Jiri Matousek
    posted to combinatorics geometries topology by AbnerCYH on 2008-04-20 14:17:42 as ** along with 1 person zouzias
  • Geometric Discrepancy: An Illustrated Guide (Algorithms and Combinatorics)
    (15 July 1999)
    by Jiri Matousek
    posted to algorithms combinatorics geometries order stochastic by AbnerCYH on 2008-04-16 03:19:46 as **
  • Permuting in Place
    SIAM Journal on Computing, Vol. 24, No. 2. (1995), pp. 266-278.
    by Faith E Fich, Ian J Munro, Patricio V Poblete
    posted to algorithms combinatorics by AbnerCYH on 2008-04-02 19:18:13 as **
  • In situ, Stable Merging by Way of the Perfect Shuffle
    The Computer Journal, Vol. 43, No. 1. (1 January 2000), pp. 40-53.
    by John Ellis, Minko Markov
    posted to algorithms combinatorics by AbnerCYH on 2008-04-02 17:13:18 as **
  • Computing the cycles in the perfect shuffle permutation
    Information Processing Letters, Vol. 75, No. 5. (31 October 2000), pp. 217-224.
    by John Ellis, Tobias Krahn, Hongbing Fan
    posted to algorithms combinatorics by AbnerCYH on 2008-04-02 16:59:32 as **
  • On the Interplay Between Interval Dimension and Dimension
    SIAM Journal on Discrete Mathematics, Vol. 7, No. 1. (1994), pp. 32-40.
    by S Felsner, M Habib, RH Möhring
    posted to algorithms combinatorics order by AbnerCYH on 2008-04-01 01:58:06 as **
  • Comparability invariance of the fixed point property
    Order, Vol. 2, No. 3. (1985), pp. 269-274.
    by B Dreesen, W Poguntke, P Winkler
    posted to combinatorics graph order by AbnerCYH on 2008-03-29 11:44:25 as **
  • Fast Algorithms with Algebraic Monge Properties
    Mathematical Foundations of Computer Science 2002 (2002), pp. 104-117.
    by Wolfgang Bein, Peter Brucker, Lawrence Larmore, James Park
    posted to algorithms combinatorics math by AbnerCYH on 2008-03-24 17:10:44 as **
  • An optimal algorithm with unknown time complexity for convex matrix searching
    Information Processing Letters, Vol. 36, No. 3. (1 November 1990), pp. 147-151.
    by Lawrence L Larmore
    posted to algorithms combinatorics by AbnerCYH on 2008-03-24 17:10:13 as **
  • A digital analogue of the Jordan curve theorem
    Discrete Applied Mathematics, Vol. 139, No. 1-3. (30 April 2004), pp. 231-251.
    by J Slapal
    posted to combinatorics topology by AbnerCYH on 2008-03-22 18:19:12 as **
  • Digital manifolds: an intuitive definition and some properties
    (1993), pp. 459-460.
    by Li Chen, Jianping Zhang
    posted to combinatorics geometries topology by AbnerCYH on 2008-03-22 18:18:07 as **
  • Topological properties of closed digital spaces: One method of constructing digital models of closed continuous surfaces by using covers
    Computer Vision and Image Understanding, Vol. 102, No. 2. (May 2006), pp. 134-144.
    by Alexander V Evako
    posted to combinatorics topology by AbnerCYH on 2008-03-22 18:17:53 as **
  • Digital Jordan Curve Theorems
    Discrete Geometry for Computer Imagery (2000), pp. 46-56.
    by Christer Kiselman
    posted to combinatorics topology by AbnerCYH on 2008-03-22 18:15:58 as **
    • Note: You may cite this page as: http://www.citeulike.org/user/AbnerCYH/tag/combinatorics

    Result page: 1 2 3 Next RIS BibTeX
    CiteULike organises scholarly (or academic) papers or literature and provides bibliographic (which means it makes bibliographies) for universities and higher education establishments. It helps undergraduates and postgraduates. People studying for PhDs or in postdoctoral (postdoc) positions. The service is similar in scope to EndNote or RefWorks or any other reference manager like BibTeX, but it is a social bookmarking service for scientists and humanities researchers.