The following pages link to Adam Kapralski (Q1406029):
Displaying 15 items.
- (Q1345528) (redirect page) (← links)
- An alternative presentation of the Schensted correspondence (Q1345529) (← links)
- Minimum 0-extensions of graph metrics (Q1378296) (← links)
- Generating \(r\)-regular graphs (Q1406030) (← links)
- The complexity of the \(T\)-coloring problem for graphs with small degree (Q1406032) (← links)
- A polynomial algorithm for finding \(T\)-span of generalized cacti (Q1406033) (← links)
- Hypercube embedding of generalized bipartite metrics (Q1842652) (← links)
- Reliability covering problems for hypergraphs (Q1968515) (← links)
- Efficient orthogonal drawings of high degree graphs (Q1969947) (← links)
- New results on induced matchings (Q1975379) (← links)
- New methods for the generation of permutations, combinations, and other combinatorial objects in parallel (Q2365578) (← links)
- (Q3493346) (← links)
- (Q3821576) (← links)
- (Q4021765) (← links)
- (Q4872113) (← links)