Result Number | Material Type | Add to My Shelf Action | Record Details and Options |
---|---|---|---|
1 |
Material Type: Ata de Congresso
|
![]() |
Approximation Algorithms Inspired by Kernelization MethodsAbu-Khzam, Faisal N. ; Bazgan, Cristina ; Chopin, Morgan ; Fernau, HenningAlgorithms and Computation, p.479-490 [Periódico revisado por pares]Cham: Springer International PublishingTexto completo disponível |
2 |
Material Type: Ata de Congresso
|
![]() |
Switching discrete control problemAkbarov, R. ; Meherrem, S. ; Cingillioglu, Y.2012 IV International Conference "Problems of Cybernetics and Informatics" (PCI), 2012, p.1-3IEEETexto completo disponível |
3 |
Material Type: Ata de Congresso
|
![]() |
Exploring the Reasons behind the Low ISO 27001 Adoption in Public Organizations in Saudi ArabiaAlshitri, Khalid I. ; Abanumy, Abdulmohsen N.2014 International Conference on Information Science & Applications (ICISA), 2014, p.1-4IEEETexto completo disponível |
4 |
Material Type: Ata de Congresso
|
![]() |
From parametricity to conservation laws, via Noether's theoremAtkey, RobertProceedings of the 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2014, p.491-502New York, NY, USA: ACMTexto completo disponível |
5 |
Material Type: Ata de Congresso
|
![]() |
Algorithms for Hub Label OptimizationBabenko, Maxim ; Goldberg, Andrew V. ; Gupta, Anupam ; Nagarajan, ViswanathAutomata, Languages, and Programming, p.69-80 [Periódico revisado por pares]Berlin, Heidelberg: Springer Berlin HeidelbergTexto completo disponível |
6 |
Material Type: Ata de Congresso
|
![]() |
Visualization of velocity fields in the atmosphere based on scattered radiationBanakh, Viktor ; Falits, AndreySPIE 2009Texto completo disponível |
7 |
Material Type: Ata de Congresso
|
![]() |
Parameterized Algorithms to Preserve ConnectivityBasavaraju, Manu ; Fomin, Fedor V. ; Golovach, Petr ; Misra, Pranabendu ; Ramanujan, M. S. ; Saurabh, SaketAutomata, Languages, and Programming, p.800-811 [Periódico revisado por pares]Berlin, Heidelberg: Springer Berlin HeidelbergTexto completo disponível |
8 |
Material Type: Ata de Congresso
|
![]() |
Physarum Can Compute Shortest Paths: Convergence Proofs and Complexity BoundsBecchetti, Luca ; Bonifaci, Vincenzo ; Dirnberger, Michael ; Karrenbauer, Andreas ; Mehlhorn, KurtAutomata, Languages, and Programming, p.472-483 [Periódico revisado por pares]Berlin, Heidelberg: Springer Berlin HeidelbergTexto completo disponível |
9 |
Material Type: Ata de Congresso
|
![]() |
Counting thin subgraphs via packings faster than meet-in-the-middle timeBjörklund, Andreas ; Kaski, Petteri ; Kowalik, ŁukaszProceedings of the twenty-fifth annual ACM-SIAM symposium on Discrete algorithms, 2014, p.594-603Philadelphia, PA, USA: Society for Industrial and Applied MathematicsTexto completo disponível |
10 |
Material Type: Ata de Congresso
|
![]() |
Noncommutativity Makes Determinants HardBläser, MarkusAutomata, Languages, and Programming, p.172-183 [Periódico revisado por pares]Berlin, Heidelberg: Springer Berlin HeidelbergTexto completo disponível |