The following pages link to Martin Matamala (Q186122):
Displayed 50 items.
- (Q287067) (redirect page) (← links)
- Complexity and dimension (Q287068) (← links)
- Weighted antimagic labeling: an algorithmic approach (Q324749) (← links)
- Domino tilings and related models: Space of configurations of domains with holes (Q596048) (← links)
- Realizing disjoint degree sequences of span at most two: a tractable discrete tomography problem (Q617894) (← links)
- Recursive construction of periodic steady state for neural networks (Q673066) (← links)
- Reaction-diffusion automata: Three states implies universality (Q679434) (← links)
- (Q897260) (redirect page) (← links)
- Injective colorings with arithmetic constraints (Q897262) (← links)
- Convex \(p\)-partitions of bipartite graphs (Q897926) (← links)
- The pickup and delivery problem with transfers: formulation and a branch-and-cut solution method (Q1044088) (← links)
- Minimum Eulerian circuits and minimum de Bruijn sequences (Q1044891) (← links)
- Symmetric discrete universal neural networks (Q1349870) (← links)
- Dynamic behavior of cyclic automata networks (Q1364481) (← links)
- Alternation on cellular automata (Q1390871) (← links)
- On the computational structure of the connected components of a hard problem (Q1607000) (← links)
- Weighted antimagic labeling (Q1752499) (← links)
- AT-free graphs: Linear bounds for the oriented diameter (Q1827858) (← links)
- Constructibility of speed one signal on cellular automata (Q1868848) (← links)
- Dynamic of cyclic automata over \(\mathbb Z^2\) (Q1885924) (← links)
- Chen and Chvátal's conjecture in tournaments (Q2048355) (← links)
- Graphs admitting antimagic labeling for arbitrary sets of positive numbers (Q2184690) (← links)
- A quantitative approach to perfect one-factorizations of complete bipartite graphs (Q2341065) (← links)
- Allowing each node to communicate only once in a distributed system: shared whiteboard models (Q2355326) (← links)
- Nowhere-zero 5-flows and even (1,2)-factors (Q2376096) (← links)
- Graphs admitting antimagic labeling for arbitrary sets of positive integers (Q2413165) (← links)
- A new family of expansive graphs (Q2482107) (← links)
- (Q2741458) (← links)
- Degree Sequence of Tight Distance Graphs (Q2840558) (← links)
- Reconstructing 3-Colored Grids from Horizontal and Vertical Projections is NP-Hard: A Solution to the 2-Atom Problem in Discrete Tomography (Q2902905) (← links)
- (Q3044329) (← links)
- (Q3439705) (← links)
- Solving the Induced Subgraph Problem in the Randomized Multiparty Simultaneous Messages Model (Q3460729) (← links)
- Nowhere-zero 5-flows and (1, 2)-factors (Q3503565) (← links)
- Small Alliances in Graphs (Q3525571) (← links)
- Minimal Eulerian Circuit in a Labeled Digraph (Q3525806) (← links)
- Navigating in a Graph by Aid of Its Spanning Tree (Q3597880) (← links)
- Reconstructing 3-Colored Grids from Horizontal and Vertical Projections Is NP-hard (Q3639290) (← links)
- On the height used by additives BSS machines (Q4336105) (← links)
- (Q4414499) (← links)
- Complexity of approximating the oriented diameter of chordal graphs (Q4459604) (← links)
- (Q4460871) (← links)
- A New Class of Graphs That Satisfies the Chen‐Chvátal Conjecture (Q4604017) (← links)
- On digital nondeterminism (Q4717055) (← links)
- Cyclic automata networks on finite graphs (Q5096347) (← links)
- On NC-real complexity classes for additive circuits and their relations with NC (Q5096867) (← links)
- Vertex partitions and maximum degenerate subgraphs (Q5295501) (← links)
- (Q5321460) (← links)
- (Q5321461) (← links)
- Some remarks about factors of graphs (Q5387016) (← links)