Pages that link to "Item:Q6108997"
From MaRDI portal
The following pages link to LATIN 2022: Theoretical Informatics (Q6108997):
Displayed 46 items.
- Complexity results on untangling red-blue matchings (Q6101837) (← links)
- Computing and listing avoidable vertices and paths (Q6108998) (← links)
- Klee's measure problem made oblivious (Q6109000) (← links)
- A parameterized approximation algorithm for the multiple allocation \(k\)-hub center (Q6109001) (← links)
- Theoretical analysis of git bisect (Q6109002) (← links)
- Pathlength of outerplanar graphs (Q6109003) (← links)
- Approximations for the Steiner multicycle problem (Q6109004) (← links)
- Approximation schemes for packing problems with \(\ell_p\)-norm diversity constraints (Q6109005) (← links)
- Obtaining approximately optimal and diverse solutions via dispersion (Q6109008) (← links)
- On APN functions whose graphs are maximal Sidon sets (Q6109009) (← links)
- On the subfield codes of a subclass of optimal cyclic codes and their covering structures (Q6109010) (← links)
- Multidimensional Manhattan preferences (Q6109013) (← links)
- Exact learning of multitrees and almost-trees using path queries (Q6109014) (← links)
- Almost optimal proper learning and testing polynomials (Q6109015) (← links)
- Estimating the clustering coefficient using sample complexity analysis (Q6109016) (← links)
- Binary completely reachable automata (Q6109017) (← links)
- Conelikes and ranker comparisons (Q6109018) (← links)
- The net automaton of a rational expression (Q6109019) (← links)
- Embedding arbitrary Boolean circuits into fungal automata (Q6109020) (← links)
- How many times do you need to go back to the future in unary temporal logic? (Q6109021) (← links)
- String attractors and infinite words (Q6109022) (← links)
- On the zero-sum Ramsey problem over \(\mathbb{Z}_2^d\) (Q6109023) (← links)
- On \(\chi \)-diperfect digraphs with stability number two (Q6109024) (← links)
- Percolation and epidemic processes in one-dimensional small-world networks (extended abstract) (Q6109026) (← links)
- A combinatorial link between labelled graphs and increasingly labelled Schröder trees (Q6109027) (← links)
- Min orderings and list homomorphism dichotomies for signed and unsigned graphs (Q6109028) (← links)
- On the zombie number of various graph classes (Q6109029) (← links)
- Patterns in ordered (random) matchings (Q6109030) (← links)
- Tree 3-spanners on generalized prisms of graphs (Q6109031) (← links)
- A general approach to Ammann bars for aperiodic tilings (Q6109033) (← links)
- Cutting a tree with subgraph complementation is hard, except for some small trees (Q6163958) (← links)
- Elastic-degenerate string matching with 1 error (Q6163960) (← links)
- Median and hybrid median \(K\)-dimensional trees (Q6163962) (← links)
- Weighted connected matchings (Q6163963) (← links)
- Space-efficient data structure for next/previous larger/smaller value queries (Q6163965) (← links)
- Near-optimal search time in \(\delta \)-optimal space (Q6163966) (← links)
- List homomorphism: beyond the known boundaries (Q6164000) (← links)
- On the closures of monotone algebraic classes and variants of the determinant (Q6164001) (← links)
- MCSP is hard for read-once nondeterministic branching programs (Q6164002) (← links)
- Bounds on oblivious multiparty quantum communication complexity (Q6164004) (← links)
- Improved parallel algorithms for generalized Baumslag groups (Q6164005) (← links)
- Piercing pairwise intersecting convex shapes in the plane (Q6164007) (← links)
- Local routing algorithms on Euclidean spanners with small diameter (Q6164009) (← links)
- On \(r\)-guarding SCOTs -- a new family of orthogonal polygons (Q6164011) (← links)
- On vertex guarding staircase polygons (Q6164013) (← links)
- On the complexity of half-guarding monotone polygons (Q6164016) (← links)