Suchergebnisse - combinatorics) Keywords

4-tangrams are 4-avoidable von Ochem, Pascal, Pierron, Théo

“… A tangram is a word in which every letter occurs an even number of times. Thus it can be cut into parts that can be arranged into two identical words. The …”
Volltext

Watson-Crick conjugates of words and languages von Mahalingam, Kalpana, Maity, Anuran

“… In this work, we explore the concept of Watson-Crick conjugates, also known as $θ$-conjugates (where $θ$ is an antimorphic involution), of words and languages …”
Volltext

Words avoiding the morphic images of most of their factors von Ochem, Pascal, Rosenfeld, Matthieu

“… We say that a finite factor $f$ of a word $w$ is \emph{imaged} if there exists a non-erasing morphism $m$, distinct from the identity, such that $w$ contains …”
Volltext

Combinatorics of nondeterministic walks von Élie de Panafieu, Wallner, Michael

“… This paper introduces nondeterministic walks, a new variant of one-dimensional discrete walks. The main difference to classical walks is that its …”
Volltext

Analysis of Students' Combinatorial Thinking Model in Solving Combinatorics Problems von Desfitri, Rita

“… The purpose of this study was to analyze students’ combinatorial thinking in solving combinatorics problems …”
Volltext

A logical limit law for $231$-avoiding permutations von Albert, Michael, Bouvel, Mathilde, Féray, Valentin, Noy, Marc

“… in $[0,1]$. Our tools come mainly from analytic combinatorics and singularity analysis …”
Volltext

Efficient Enumeration of Non-isomorphic Interval Graphs von Mikos, Patryk

“… In this paper, we improve their algorithm and achieve O([n.sup.3] logn) time delay. We also extend the catalog of these graphs providing a list of all non-isomorphic interval graphs for all n up to 15. Keyword …”
Volltext

The Fractal Nature of Combinatorial Sets and Finding Formulas for Combinatorial Numbers von Timofieva, N. K.

“… Using the fractal properties of the sets, an approach to solving enumeration problems in combinatorics is developed …”
Volltext

Extended formulations in combinatorial optimization von Conforti, Michele, Cornuéjols, Gérard, Zambelli, Giacomo

“… This survey is concerned with the size of perfect formulations for combinatorial optimization problems. By “perfect formulation”, we mean a system of linear …”
Volltext

Humanitarian supply chain: a bibliometric analysis and future research directions von Fosso Wamba, Samuel

“… Humanitarian supply chain (HSC) has attracted enormous interest from both practitioners and academics lately, mainly because of its essential role in curbing …”
Volltext

A remark on Kashin’s discrepancy argument and partial coloring in the Komlós conjecture von Bandeira, Afonso S., Maillard, Antoine, Zhivotovskiy, Nikita

“… In this expository note, we discuss an early partial coloring result of B. Kashin (1985). Although this result only implies Spencer’s six standard deviations …”
Volltext

Combinatorics, groups, algorithms, and complexity: conference in honor of Laci Babai's 60th birthday von Seress, Akos, Szegedy, Mario

“… This special issue of Discrete Mathematics & Theoretical Computer Science is dedicated to the conference Combinatorics, Groups, Algorithms, and Complexity held at The Ohio State University between March 21-25, 2010. Honoring Laszlo (Laci …”
Volltext

An efficient approach for searching optimal multi-keywords coverage routes von Yang, Rong, Niu, Baoning, Jin, Pengfei

“… Keyword-aware optimal route queries are a combinatorial optimization problem with three factors, namely keyword coverage, route budget constraint and route popularity, which is NP-hard …”
Volltext

On Colorings of 3-Homogeneous Hypergraphs in 3 Colors von Akolzin, I. A.

“… In this paper, we examine the value m(n, r) in the Erdős–Hajnal problem. Using various methods, we obtain the estimate 27 ≤ m(3) ≤ 35 …”
Volltext

Statistical Mechanics, Integrability and Combinatorics von Fendley, Paul, Pronko, Andrei, Reshetikhin, Nicolai, Wiegmann, Paul, Zinn- Justin, Paul

“… Keywords. Statistical mechanics, lattice models, quantum integrability, exact results, combinatorics, tilings, dimers, growth processes, limit shape phenomena, random matrices, random surfaces, determinantal …”
Volltext

Two-stage stochastic lot-sizing problem under cost uncertainty von Zhou, Zhili, Guan, Yongpei

“… For production planning problems, cost parameters can be uncertain due to marketing activities and interest rate fluctuation. In this paper, we consider a …”
Volltext

Development of collaboration matrix using co-occurrence and combinatoric system as scientometrics analysis von Riyanto, Slamet, Subagyo, Hendro, Marlina, Ekawati, Yaniasih, Yaniasih, Rodiah, Rodiah

“… Design/methodology/approach - This study takes metadata of the author's name, author's affiliate, and keyword from National Scientific Repository (RIN …”
Volltext

The Methodology of Teaching Algorithms of Combinatorics: Permutations, Combinations, Arrangements von MANDARIA, George

“… In this article we have described the methodology for teaching the algorithms of combinatorics which are often used when solving tasks of informatics …”
Volltext

On Transfinite Levels of the Ershov Hierarchy von Peng, Cheng

“… In this thesis, we study Turing degrees in the context of classical recursion theory. What we are interested in is the partially ordered structures $\mathcal …”
Volltext

Classifying human promoters by occupancy patterns identifies recurring sequence elements, combinatorial binding, and spatial interactions von Yang, Xinyi, Vingron, Martin

“… Background Characterizing recurring sequence patterns in human promoters has been a challenging undertaking even nowadays where a near-complete overview of …”
Volltext