Sign in
Facet browsing currently unavailable
Page 1 of 100 results
Sort by: relevance publication year
|
Pisot-cyclotomic quasilattices and their symmetry semigroups BOOK CHAPTER published 23 June 1998 in Quasicrystals and Discrete Geometry |
|
Non-crystallographic root systems BOOK CHAPTER published 23 June 1998 in Quasicrystals and Discrete Geometry |
|
Spectrum of dynamical systems arising from Delone sets BOOK CHAPTER published 23 June 1998 in Quasicrystals and Discrete Geometry |
|
Counting d -Step Paths in Extremal Dantzig Figures JOURNAL ARTICLE published January 1998 in Discrete & Computational Geometry |
|
A Note on Counting Connected Graph Covering Projections JOURNAL ARTICLE published May 1998 in SIAM Journal on Discrete Mathematics |
|
Linear dynamical systems of dimension two over the ring of integers modulo pt JOURNAL ARTICLE published December 2020 in Discrete Mathematics, Algorithms and Applications Research funded by Innovative Research Group Project of the National Natural Science Foundation of China (11961050) |
|
The JOURNAL ARTICLE published March 2014 in Discrete Applied Mathematics Research funded by NSC (101-2115-M-033-004) |
|
Counting JOURNAL ARTICLE published December 2015 in Discrete Mathematics Research funded by ERC (280152) |
|
Counting spanning trees of (1, JOURNAL ARTICLE published February 2024 in Discrete Applied Mathematics Research funded by National Natural Science Foundation of China (12171402,12271235) | Natural Science Foundation of Fujian Province (2021J06029) |
|
Generating and counting unlabeled JOURNAL ARTICLE published February 2014 in Discrete Applied Mathematics Research funded by CNPq (305372/2009-2) |
|
On the counting function of the sets of parts JOURNAL ARTICLE published June 2006 in Discrete Mathematics |
|
Counting JOURNAL ARTICLE published November 2016 in Discrete Applied Mathematics Research funded by European Union’s Seventh Framework Programme (334828) |
|
On set systems with restricted intersections modulo JOURNAL ARTICLE published February 2009 in Discrete Mathematics |
|
Set systems with cross JOURNAL ARTICLE published October 2009 in Discrete Mathematics |
|
On JOURNAL ARTICLE published December 2008 in Discrete Mathematics |
|
Counting maximal independent sets in some JOURNAL ARTICLE published November 2023 in Discrete Applied Mathematics |
|
Counting feasible solutions of the traveling salesman problem with pickups and deliveries is JOURNAL ARTICLE published June 2009 in Discrete Applied Mathematics |
|
Bijective counting of humps and peaks in JOURNAL ARTICLE published October 2015 in Discrete Applied Mathematics Research funded by National Natural Science Foundation of China (10901141) | Zhejiang Provincial Natural Science Foundation of China (LY14A010009,LY15A010008) |
|
Complex- JOURNAL ARTICLE published May 2014 in Discrete Mathematics Research funded by NSFC of China (11101088,11271288) |
|
On JOURNAL ARTICLE published February 2019 in Discrete Optimization Research funded by National Research Foundation of the Korean government (2017R1D1A1B03028642) |
![Cite](javascript:showCiteBox("10.1016/j.dam.2013.09.027", "The<mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si7.gif" display="inline" overflow="scroll"><mml:mi>D</mml:mi></mml:math>-representation of nonnegative integers and the Fibonacci factorization of suffixes of infinite Fibonacci words");){kind=link}
![Cite](javascript:showCiteBox("10.1016/j.disc.2015.06.004", "Counting <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si5.gif" display="inline" overflow="scroll"><mml:msub><mml:mrow><mml:mi>K</mml:mi></mml:mrow><mml:mrow><mml:mn>4</mml:mn></mml:mrow></mml:msub></mml:math>-subdivisions");){kind=link}
![Cite](javascript:showCiteBox("10.1016/j.dam.2023.11.018", "Counting spanning trees of (1, <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="d1e173" altimg="si628.svg"><mml:mi>N</mml:mi></mml:math>)-periodic graphs");){kind=link}
![Cite](javascript:showCiteBox("10.1016/j.dam.2011.11.015", "Generating and counting unlabeled<mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si49.gif" display="inline" overflow="scroll"><mml:mi>k</mml:mi></mml:math>-path graphs");){kind=link}
![Cite](javascript:showCiteBox("10.1016/j.disc.2005.11.022", "On the counting function of the sets of parts <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.gif" overflow="scroll"><mml:mi mathvariant="script">A</mml:mi></mml:math> such that the partition function <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si2.gif" overflow="scroll"><mml:mi>p</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mi mathvariant="script">A</mml:mi><mml:mo>,</mml:mo><mml:mi>n</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:math> takes even values for <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si3.gif" overflow="scroll"><mml:mi>n</mml:mi></mml:math> large enough");){kind=link}
![Cite](javascript:showCiteBox("10.1016/j.dam.2016.05.001", "Counting <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si9.gif" display="inline" overflow="scroll"><mml:mn>4</mml:mn><mml:mo>×</mml:mo><mml:mn>4</mml:mn></mml:math> matrix partitions of graphs");){kind=link}
![Cite](javascript:showCiteBox("10.1016/j.disc.2008.09.025", "On set systems with restricted intersections modulo <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.gif" display="inline" overflow="scroll"><mml:mi>p</mml:mi></mml:math> and <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si2.gif" display="inline" overflow="scroll"><mml:mi>p</mml:mi></mml:math>-ary <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si3.gif" display="inline" overflow="scroll"><mml:mi>t</mml:mi></mml:math>-designs");){kind=link}
![Cite](javascript:showCiteBox("10.1016/j.disc.2009.04.014", "Set systems with cross <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.gif" display="inline" overflow="scroll"><mml:mi mathvariant="script">L</mml:mi></mml:math>-intersection and <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si2.gif" display="inline" overflow="scroll"><mml:mi>k</mml:mi></mml:math>-wise <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si3.gif" display="inline" overflow="scroll"><mml:mi mathvariant="script">L</mml:mi></mml:math>-intersecting families");){kind=link}
![Cite](javascript:showCiteBox("10.1016/j.disc.2007.12.034", "On <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.gif" display="inline" overflow="scroll"><mml:msub><mml:mrow><mml:mstyle mathvariant="italic"><mml:mi>STD</mml:mi></mml:mstyle></mml:mrow><mml:mrow><mml:mfrac><mml:mrow><mml:mi>k</mml:mi></mml:mrow><mml:mrow><mml:mn>3</mml:mn></mml:mrow></mml:mfrac></mml:mrow></mml:msub><mml:mrow><mml:mo>[</mml:mo><mml:mi>k</mml:mi><mml:mo>;</mml:mo><mml:mn>3</mml:mn><mml:mo>]</mml:mo></mml:mrow></mml:math>’s");){kind=link}
![Cite](javascript:showCiteBox("10.1016/j.dam.2023.06.023", "Counting maximal independent sets in some <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="d1e4136" altimg="si77.svg"><mml:mi>n</mml:mi></mml:math>-gonal cacti");){kind=link}
![Cite](javascript:showCiteBox("10.1016/j.dam.2009.03.003", "Counting feasible solutions of the traveling salesman problem with pickups and deliveries is <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si3.gif" display="inline" overflow="scroll"><mml:mi>#</mml:mi><mml:mi>P</mml:mi></mml:math>-complete");){kind=link}
![Cite](javascript:showCiteBox("10.1016/j.dam.2015.04.013", "Bijective counting of humps and peaks in <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si5.gif" display="inline" overflow="scroll"><mml:mrow><mml:mo>(</mml:mo><mml:mi>k</mml:mi><mml:mo>,</mml:mo><mml:mi>a</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math>-paths");){kind=link}
![Cite](javascript:showCiteBox("10.1016/j.disc.2013.12.025", "Complex-<mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.gif" display="inline" overflow="scroll"><mml:mi>L</mml:mi></mml:math>matrix and its recognition");){kind=link}
![Cite](javascript:showCiteBox("10.1016/j.disopt.2018.07.002", "On <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="mml12" display="inline" overflow="scroll" altimg="si10.gif"><mml:mi>v</mml:mi><mml:mi>e</mml:mi></mml:math>-degree and <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="mml13" display="inline" overflow="scroll" altimg="si2.gif"><mml:mi>e</mml:mi><mml:mi>v</mml:mi></mml:math>-degree of graphs");){kind=link}